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

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

来源：评论

学校读者我要写书评

暂无评论

Learning continuous network emerging dynamics from scarce observations via data-adaptive stochastic processes

引用

Science China(Information Sciences) 2024年第12期67卷 240-255页

作者： Jiaxu CUI Qipeng WANG Bingyi SUN Jiming LIU Bo YANG College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Public Computer Education and Research Center Jilin University Department of Computer Science Hong Kong Baptist University

Learning network dynamics from the empirical structure and spatio-temporal observation data is crucial to revealing the interaction mechanisms of complex networks in a wide range of domains. However,most existing methods only aim at learning network dynamic behaviors generated by a specific ordinary differential equation instance, resulting in ineffectiveness for new ones, and generally require dense *** observed data, especially from network emerging dynamics, are usually difficult to obtain, which brings trouble to model learning. Therefore, learning accurate network dynamics with sparse, irregularly-sampled,partial, and noisy observations remains a fundamental challenge. We introduce a new concept of the stochastic skeleton and its neural implementation, i.e., neural ODE processes for network dynamics(NDP4ND), a new class of stochastic processes governed by stochastic data-adaptive network dynamics, to overcome the challenge and learn continuous network dynamics from scarce observations. Intensive experiments conducted on various network dynamics in ecological population evolution, phototaxis movement, brain activity, epidemic spreading, and real-world empirical systems, demonstrate that the proposed method has excellent data adaptability and computational efficiency, and can adapt to unseen network emerging dynamics, producing accurate interpolation and extrapolation with reducing the ratio of required observation data to only about 6% and improving the learning speed for new dynamics by three orders of magnitude.

关键词： complex networks network dynamics emerging spatio-temporal dynamics neural processes

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Recovering accurate labeling information from partially valid data for effective multi-label learning 29

Recovering accurate labeling information from partially vali...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Li, Ximing Wang, Yang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University China Key Laboratory of Knowledge Engineering With Big Data Ministry of Education Hefei University of Technology China School of Computer Sci and Information Engineering Hefei University of Technology China

ISBN: (纸本)9780999241165

Partial Multi-label Learning (PML) aims to induce the multi-label predictor from datasets with noisy supervision, where each training instance is associated with several candidate labels but only partially valid. To address the noisy issue, the existing PML methods basically recover the ground-truth labels by leveraging the ground-truth confidence of the candidate label, i.e., the likelihood of a candidate label being a ground-truth one. However, they neglect the information from non-candidate labels, which potentially contributes to the ground-truth label recovery. In this paper, we propose to recover the ground-truth labels, i.e., estimating the ground-truth confidences, from the label enrichment, composed of the relevance degrees of candidate labels and irrelevance degrees of non-candidate labels. Upon this observation, we further develop a novel two-stage PML method, namely Partial MultiLabel Learning with Label Enrichment-Recovery (PML3ER), where in the first stage, it estimates the label enrichment with unconstrained label propagation, then jointly learns the ground-truth confidence and multi-label predictor given the label enrichment. Experimental results validate that PML3ER outperforms the state-of-the-art PML methods. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A neural kernel framework for relation extraction

引用

Expert Systems with Applications 2025年 286卷

作者： Wang, Kai Chen, Yanping Yang, Weizhe Huang, Ruizhang Qin, Yongbin Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and Technology Guizhou University China State Key Laboratory of Public Big Data Guizhou University China

Relation extraction (RE) poses significant challenges due to the complexity of identifying semantic relationships between overlapping entity pairs within sentences. Traditional kernel-based methods effectively leverage instance-level similarities but heavily depend on manually designed kernel functions, requiring substantial domain expertise and limiting their flexibility. On the other hand, neural network approaches excel at automatically learning abstract feature representations but typically neglect critical instance-specific information, potentially missing valuable relational details during inference. These limitations motivate the exploration of a hybrid approach that effectively integrates the strengths of traditional kernels with the representational power of neural networks. In this paper, we propose a neural kernel framework designed to bridge this critical gap. The proposed framework employs neural kernels, whose parameters are initialized based on task-specific objectives and optimized through neural training procedures, enabling adaptive learning of similarity measures without relying on handcrafted kernel functions. By maintaining instance-level details through annotated training examples, neural kernels create discriminative, flexible decision boundaries tailored specifically to the relation extraction task. We further develop three complementary neural kernel components, instance kernel, description kernel, and cluster kernel, to show the advantages of kernel substitution. Extensive experiments on the ACE 2005, SemEval 2010, and CoNLL 2004 datasets demonstrate that our neural kernel framework significantly outperforms existing state-of-the-art methods, achieving F1-scores of 88.11 %, 91.08 %, and 98.63 %, respectively. © 2025 Elsevier Ltd

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Local feature aggregation algorithm based on graph convolutional network

引用

Frontiers of Computer Science 2022年第3期16卷 203-205页

作者： Hao WANG Liyan DONG Minghui SUN College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China

1Introduction and main contributions In the field of social networks and knowledge graphs,semi-supervised learning models based on graph convolutional networks have achieved great success in node classification[1],inductive node embedding[2],link prediction[3],and *** semi-supervised models based on graph convolutional network(GCN)[4]expect to obtain more feature information of a graph or accelerate the training.

关键词： convolution aggregation semi

来源：评论

学校读者我要写书评

暂无评论

Using New Fusion Operations to Improve Trust Expressiveness of Subjective Logic

引用

Wuhan University Journal of Natural Sciences 2011年第5期16卷 376-382页

作者： ZHOU Hongwei1,2,3,SHI Wenchang1,2,LIANG Zhaohui1,2,LIANG Bin1,2 1.key laboratory of data engineering and knowledge engineering,ministry of education,Beijing 100872,China 2.School of Information,Renmin University of China,Beijing 100872,China 3.Institute of Electronic Technology,Information engineering University of PLA,Zhengzhou 450004,Henan,China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China School of Information Renmin University of China Beijing China Institute of Electronic Technology Information Engineering University of PLA Zhengzhou Henan China

Subjective logic provides a means to describe the trust relationship of the realworld. However, existing fusion operations it offers Weal fused opiniotts equally, which makes it impossible to deal with the weighted opinions effectively. A. Jcsang presents a solution, which combines the discounting operator and the fusion operator to produce the consensus to the problem. In this paper, we prove that this approach is unsuitable to deal with the weighted opinions because it increases the uncertainty of the consensus. To address the problem, we propose two novel fusion operators that are capable of fusing opinions according to the weight of opinion in a fair way, and one of the strengths of them is improving the trust expressiveness of subjective logic. Furthermore, we present the justification on their definitions with the mapping between the evidence space and the opinion space. Comparisons between existing operators and the ones we proposed show the effectiveness of our new fusion operations.

关键词： trust subjective logic opinion fusion weizht

来源：评论

学校读者我要写书评

暂无评论

The rewriting algorithm for disjunctive queries between peer ontologies

The rewriting algorithm for disjunctive queries between peer...

引用

3rd International Conference on Semantics, knowledge, and Grid, SKG 2007

作者： Qin, Biao Wang, Shan Dept. of Computer Science Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China

ISBN: (纸本)0769530079

We study the problem of answering queries given a set of mappings between peer ontologies. In addition to the schema mapping between peer ontologies, there are axioms to give constraints to classes and properties. We propose a set of rules to build graphs for the axioms. Because the axioms have different properties, the generated graphs are classified into four sets. In each peer, its RDF/OWL query languages can support regular expressions. If it wants to be transitive along semantic paths in peer knowledge management systems, we must rewrite conjunctive and disjunctive queries between peers. Because conjunctive queries are well-understood, we focus on a novel algorithm to rewrite disjunctive queries along semantic paths based on the graphs. For all atoms of a disjunctive query, we consider its union as a set and find the maximum rewritings over peers through a graphical way. Finally we do extensive simulation experiments. The simulation results show our algorithm can generate more rewritings than the naive rewriting algorithm at each distance. © 2007 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

DeciLS-PBO: an effective local search method for pseudo-Boolean optimization

引用

Frontiers of Computer Science 2024年第5期18卷 239-241页

作者： Luyu JIANG Dantong OUYANG Qi ZHANG Liming ZHANG College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering(Ministry of Education) Jilin UniversityChangchun 130012China

1 Introduction Local search method is a rising star for solving combinatorial optimization problems in recent years,and the state-of-the-art local search-based incomplete Maximum Satisfiability(MaxSAT)solversshowpromi... 详细信息

关键词： Max optimization local

来源：评论

学校读者我要写书评

暂无评论

SGSH: Stimulate Large Language Models with Skeleton Heuristics for knowledge Base Question Generation

SGSH: Stimulate Large Language Models with Skeleton Heuristi...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：