检索结果-内蒙古大学图书馆

2024 Findings of the Association for Computational Linguistics: NAACL 2024

作者： Guo, Shasha Liao, Lizi Zhang, Jing Wang, Yanling Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education China Singapore Management University Singapore Zhongguancun Laboratory China

ISBN: (纸本)9798891761193

knowledge base question generation (KBQG) aims to generate natural language questions from a set of triplet facts extracted from KB. Existing methods have significantly boosted the performance of KBQG via pre-trained language models (PLMs) thanks to the richly endowed semantic knowledge. With the advance of pre-training techniques, large language models (LLMs) (e.g., GPT-3.5) undoubtedly possess much more semantic knowledge. Therefore, how to effectively organize and exploit the abundant knowledge for KBQG becomes the focus of our study. In this work, we propose SGSH - a simple and effective framework to Stimulate GPT-3.5 with Skeleton Heuristics to enhance KBQG. The framework incorporates "skeleton heuristics", which provides more fine-grained guidance associated with each input to stimulate LLMs to generate optimal questions, encompassing essential elements like the question phrase and the auxiliary verb. More specifically, we devise an automatic data construction strategy leveraging ChatGPT to construct a skeleton training dataset, based on which we employ a soft prompting approach to train a BART model dedicated to generating the skeleton associated with each input. Subsequently, skeleton heuristics are encoded into the prompt to incentivize GPT-3.5 to generate desired questions. Extensive experiments demonstrate that SGSH derives the new state-of-the-art performance on the KBQG tasks. The code is now available on Github. © 2024 Association for Computational Linguistics.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Efficient SPARQL query processing in mapreduce through data partitioning and indexing

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Nie, Zhi Du, Fang Chen, Yueguo Du, Xiaoyong Xu, Linhao Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China IBM Research China Beijing China

ISBN: (纸本)9783642292521

Processing SPARQL queries on single node is obviously not scalable, considering the rapid growth of RDF knowledge bases. This calls for scalable solutions of SPARQL query processing over Web-scale RDF data. There have been attempts for applying SPARQL query processing techniques in MapReduce environments. However, no study has been conducted on finding optimal partitioning and indexing schemes for distributing RDF data in MapReduce. In this paper, we investigate RDF data partitioning technique that provides effective indexing schemes to support efficient SPARQL query processing in MapReduce. Our extensive experiments over a huge real-life RDF dataset show the performance of the proposed partitioning and indexing schemes for efficient SPARQL query processing. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A hardware sandbox using processor virtualization for untrusted native code

A hardware sandbox using processor virtualization for untrus...

引用

2013 International Forum on Computer and Information Technology, IFCIT 2013

作者： Wu, Xin Shi, Wen Chang Liang, Bin Key Laboratory of Data Engineering and Knowledge Engineering Renmin University Ministry Of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9783038350194

Native code which is in the form of browser plugins and native binaries in browser extensions brings significant security threats and has attracted considerable attention in recent years. Many researches focus on dangerous behaviors in browser extensions for new security countermeasures but there is no fundamental improvement. Constructing an individual isolation domain and providing sandboxed execution of the code is a key idea to address this problem. However current approach relies heavily on the trust of a module executing within the context of the whole untrusted browser code base accompanied with inevitable vulnerabilities. In this paper, we propose an innovative sandbox utilizing the hardware virtualization support available in modern Intel and AMD processors to construct an individual isolation domain for each benign-but-buggy native code. Our approach push the responsibilities for security down to the hardware level and minimize the difficulties encountered with software based approaches. By utilizing the processor instruction VMENTER or VMEXIT to cause the context switch, we can obtain a better system performance. © (2014) Trans Tech Publications, Switzerland.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Using ontology to enhance collaborative recommendation based on community

Using ontology to enhance collaborative recommendation based...

引用

9th International Conference on Web-Age Information Management, WAIM 2008

作者： Yu, Li School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China

ISBN: (纸本)9780769531854

Collaborative filtering is an important personalized recommendation technique applied widely in E-commerce. It is not adapted to multi-interest or title recommendation for the 'general neighbourhood' problem which is analyzed in this paper. Based on it, collaborative filtering recommendation based on community is presented by introducing the concept 'community neighbourhood' in the paper. Unfortunately, it results into severer sparsity problem which makes heavy effect on its performance. In order to overcome it, an ontological A-priori score is used to infer user preference and to pre-fill null rating first. After pre-filling using the ontology method, then collaborative filtering based on community is executed based on a dense rating matrix. The experiment shows that collaborative filtering based on community makes generally better performance than traditional method when data is not very sparse, and ontology method can truly enhance collaborative filtering based on community since the sparsity is overcame. © 2008 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Improve top-K recommendation by extending review analysis

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Zhu, Qing Xing, Zhe Liang, Jingfan School of Information Renmin University of China Beijing 100872 China Key Laboratory for Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing 100872 China

ISBN: (纸本)9783642292521

The Web has become the popular place for people to purchase product and acquire services, so collaborative filtering is one of the most important algorithms applied in e-commerce recommendation systems. Unfortunately, it is widely recognized that the traditional recommendation methods are inefficient when the user rating data is extremely sparse. In order to overcome the limitations, good recommendation tools are needed to help Web customers determine the products and satisfaction services. In this paper, we propose a multi-dimensional adaptive recommendation algorithm by extending opinion analysis to improve top-k recommendation. In the first step, the novel algorithm that uses extened opinion analysis, creatively combines three dimensional recommendation models: user-based, item-based and opinion-based collaborative filtering. It successfully integrates opinion mining technology with collaborative filtering algorithm. In the second step, we configured the dynamic measurement would help us determine the weight of three dimensions: user-based, item-based and opinion-based analysis, and hence get the final prediction result. The experimental results show that multi-dimensional recommendation can effectively alleviate the dataset sparsity problem and achieve better prediction accuracy compared to other traditional collaborative recommendation algorithms. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

EEG-Based Joint Semi-supervised Learning for Major Depressive Disorder Detection 26th

EEG-Based Joint Semi-supervised Learning for Major Depressi...

引用

26th International Conference on Pattern Recognition, ICPR 2022

作者： Chen, Tao Zheng, Tong Shi, Jinlong Guo, Yanrong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9783031376597

Major Depressive Disorder (MDD) has been a major mental disease in recent years, imposing huge negative impacts on both our society and individuals. The current clinical MDD detection methods, such as self-report scales and interviews, often suffer from their subjectiveness. In contrast, electroencephalography (EEG) signals reflect brain activity and can be used as an effective information source for MDD detection. However, the learning-based MDD detection methods with EEG data usually neglect the valuable information contained in the unlabeled data, therefore possibly suffering from the label scarcity issue. In this context, we propose a simple EEG-based Joint Semi-supervised Learning (JSL) model for the MDD detection task, which fully leverages the information from unlabeled data. Specifically, by equipping the unlabeled samples with the intermediately predicted pseudo labels, the accurate position of the class-specific centroids in the feature space can be gradually refined. Based on that, the auxiliary labels based on a heuristic centroid-based classifier can be obtained, which plays an effective complementary role in predicting the sample labels. The experiments on a public dataset demonstrate the effectivenes s of our method, showing an obvious performance gain via using the proposed semi-supervised strategy. © 2023, Springer Nature Switzerland AG.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A Semi-supervised Bilingual Lexicon Induction Method for Distant Language Pairs Based on Bidirectional Adversarial Model 12

A Semi-supervised Bilingual Lexicon Induction Method for Dis...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Zhi, Wenwu Zhang, Yuhong Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Ministry of Education !!!School of Computer Science and Information Engineering @@@Hefei University of Technology Hefei China

ISBN: (纸本)9781665438582

Bilingual lexicon induction (BLI) can transfer knowledgefrom well- to under- resourced language, and has been widelyapplied to various NLP tasks. Recent work on BLI is projection-based that learns a mapping to connect source and target embedding spaces, with the isomorphism assumption. Unfortunately, the isomorphism assumption doesn't hold gener-ally, especially in typologically distant language pairs. Moreover, without supervised signals guiding, the training will further com-plicates BLI, making the performance of unsupervised methods unsatisfactory. To broke the restrict of isomorphism, we propose a semi-supervised method for distant BLI tasks, named A Semi-supervised Bilingual Lexicon Induction method in Latent Space based on Bidirectional Adversarial Model. First, two latent spaces are learned by two autoencoders for source and target domain independently to weaken the constraint of isomorphism in the embedding spaces. Then we add a few pairs of dictionary to learn the initial mapping to connect the Latent Space. Last, based on initial mapping, Cycle-Consistency is combined with Distance constraint constraint to maintain the geometry structure of both embedding spaces stable in the learning of bi-direction mapping based on adversarial model. By conducting extensive experiments, our method gets state-of-the-art results on most language pairs, especially with significant improvements on distant language pairs. © 2021 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Detecting stealthy malware with inter-structure and imported signatures 11

Detecting stealthy malware with inter-structure and imported...

引用

6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011

作者： Liang, Bin You, Wei Shi, Wenchang Liang, Zhaohui Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9781450305648

Recent years have witnessed an increasing threat from kernel rootkits. A common feature of such attack is hiding malicious objects to conceal their presence, including processes, sockets, and kernel modules. Scanning memory with object signatures to detect the stealthy rootkit has been proven to be a powerful approach only when it is hard for adversaries to evade. However, it is difficult, if not impossible, to select fields from a single data structure as robust signatures with traditional techniques. In this paper, we propose the concepts of inter-structure signature and imported signature, and present techniques to detect stealthy malware based on these concepts. The key idea is to use cross-reference relationships of multiple data structures as signatures to detect stealthy malware, and to import some extra information into regions attached to target data structures as signatures. We have inferred four invariants as signatures to detect hidden processes, sockets, and kernel modules in Linux respectively and implemented a prototype detection system called DeepScanner. Meanwhile, we have also developed a hypervisor-based monitor to protect imported signatures. Our experimental result shows that our DeepScanner can effectively and efficiently detect stealthy objects hidden by seven real-world rootkits without any false positives and false negatives, and an adversary can hardly evade DeepScanner if he/she does not break the normal functions of target objects and the system. Copyright 2011 ACM.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

COCA: More accurate multi-dimensional histograms out of more accurate correlations detection

COCA: More accurate multi-dimensional histograms out of more...

引用

9th International Conference on Web-Age Information Management, WAIM 2008

作者： Wei, Cao Xiongpai, Qin Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769531854

Detecting and exploiting correlations among columns in relational databases are of great value for query optimizers to generate better query execution plans (QEPs). We propose a more robust and informative metric, namely, entropy correlation coefficients, other than chi-square test to detect correlations among columns in large datasets. We introduce a novel yet simple kind of multi-dimensional synopses named COCA-Hist to cope with different correlations in databases. With the aid of the precise metric of entropy correlation coefficients, correlations of various degrees can be detected effectively;when correlation coefficients testify to mutual independence among columns, the AVI (attribute value independence) assumption can be adopted undoubtedly. COCA can also serve as a data-mining tool with superior qualities as CORDS does. We demonstrate the effectiveness and accuracy of our approach by several experiments. © 2008 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

VID Join： Mapping Trajectories to Points of Interest to Support Location-Based Services

引用

Journal of Computer Science & Technology 2015年第4期30卷 725-744页

作者：商烁谢珂心郑凯刘家俊文继荣 Department of Computer Science China University of Petroleum Beijing 102249 China School of Information Technology and Electrical Engineering The University of Queensland Brisbane QLD 4072 Australia School of Computer Science and Technology Soochow University Suzhou 215006 China Commonwealth Scientific and Industrial Research Organisation Kenmore QLD 4069 Australia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100080 China

Variable influence duration （VID） join is a novel spatio-temporal join operation between a set T of trajectories and a set P of spatial points. Here, trajectories are traveling histories of moving objects （e.g., travelers）, and spatial points are points of interest （POIs, e.g., restaurants）. VID join returns all pairs of （τs, p） if τs is spatially close to p for a long period of time, where τs is a segment of trajectory τ ∈ T and p ∈ P. Each returned （τs, p） implies that the moving object associated with τs stayed at p （e.g., having dinner at a restaurant）. Such information is useful in many aspects, such as targeted advertising, social security, and social activity analysis. The concepts of influence and influence duration are introduced to measure the spatial closeness between τ and p, and the time spanned, respectively. Compared to the conventional spatio-temporal join, the VID join is more challenging since the join condition varies for different POIs, and the additional temporal requirement cannot be indexed effectively. To process the VID join e？ciently, three algorithms are developed and several optimization techniques are applied, including spatial duplication reuse and time duration based pruning. The performance of the developed algorithms is verified by extensive experiments on real spatial data.

关键词： trajectory spatial database spatial join spatio-temporal join

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：