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

作者： Hu, He Du, Xiaoyong School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MoE No. 59 Zhongguancun St. Beijing100872 China

Online tagging is crucial for the acquisition and organization of web knowledge. We present TYG (Tag-as-You-Go) in this paper, a web browser extension for online tagging of personal knowledge on standard web pages. We investigate an approach to combine a K-Medoid-style clustering algorithm with the user input to achieve semi-automatic web page annotation. The annotation process supports user-defined tagging schema and comprises an automatic mechanism that is built upon clustering techniques, which can automatically group similar HTML DOM nodes into clusters corresponding to the user specification. TYG is a prototype system illustrating the proposed approach. Experiments with TYG show that our approach can achieve both efficiency and effectiveness in real world annotation scenarios. © 2014 World Scientific Publishing Company.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Multi-verifier: A novel method for fact statement verification

Multi-verifier: A novel method for fact statement verificati...

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Wang, Teng Zhu, Qing Wang, Shan Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783642374005

Untruthful information spreads on the web, which may mislead users or have a negative impact on user experience. In this paper, we propose a method called Multi-verifier to determine the truthfulness of a fact statement. The basic idea is that whether a fact statement is truthful or not depends on the information related to the fact statement. We utilize a popular search engine to collect the top-n search results that are most related to the target fact statement. We then propose support score to measure the extent to which a search result supports the fact statement, and we make use of credibility ranking to rank the search results. At last, we combine the support score and credibility ranking value of a search result to evaluate its contribution to a fact statement determination. Based on the contributions of the search results, we determine the fact statement. Our proposals are evaluated by experiments and results show availability and high precision of the proposed method. © 2013 Springer-Verlag.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

INK: A cloud-based system for efficient top-k interval keyword search 14

INK: A cloud-based system for efficient top-k interval keywo...

引用

23rd ACM International Conference on information and knowledge Management, CIKM 2014

作者： Li, Rui Zhang, Xiao Zhou, Xin Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781450325981

It is insufficient to search temporal text by only focusing on either time attribute or keywords today as we pay close attention to the evolution of event with time. Both temporal and textual constraints need to be considered in one single query, called Top-k Interval Keyword Query (TIKQ). In this paper, we presents a cloud-based system named INK that supports efficient execution of TIKQs with appropriate effectiveness on Hadoop and HBase. In INK, an Adaptive Index Selector (AIS) is devised to choose the better execution plan for various TIKQs adaptively based on the proposed cost model, and leverage two novel hybrid index modules (TriI and IS-Tree) to combine keyword and interval filtration seamlessly.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

FindCredPg: A novel method to find credible pages based on trust web graph

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Wang, Teng Zhu, Qing Wang, Shan Liang, Jingfan Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9783642292521

Finding credible pages is a challenging problem on the Web. Our key observation in this paper is that credible pages usually link to credible content-related pages, which is different from a normal page usually links to normal pages in spam page detection. We propose a novel method to find credible pages based on the trust web graph we define. This method first measures the content correlation between pages connected by hyperlinks, then it combines web link structure with content correlation value of pages to build a trust web graph. At last, credible pages are found successfully by using trust relation of vertices on the trust web graph. We construct a real-world data set by crawling millions of pages on the web and run a set of experiments on this data set. Experiment results show that the accuracy of this method is near 80% and the efficiency is higher. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Hypertext systems

来源：评论

学校读者我要写书评

暂无评论

Summarizing large-scale database schema using community detection

Summarizing large-scale database schema using community dete...

引用

作者： Wang, Xue Zhou, Xuan Wang, Shan School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China

Schema summarization on large-scale databases is a challenge. In a typical large database schema, a great proportion of the tables are closely connected through a few high degree tables. It is thus dificult to separate these tables into clusters that represent different topics. Moreover, as a schema can be very big, the schema summary needs to be structured into multiple levels, to further improve the usability. In this paper, we introduce a new schema summarization approach utilizing the techniques of community detection in social networks. Our approach contains three steps. First, we use a community detection algorithm to divide a database schema into subject groups, each representing a specific subject. Second, we cluster the subject groups into abstract domains to form a multi-level navigation structure. Third, we discover representative tables in each cluster to label the schema summary. We evaluate our approach on Freebase, a real world large-scale database. The results show that our approach can identify subject groups precisely. The generated abstract schema layers are very helpful for users to explore database. © 2012 Springer Science+Business Media, LLC & Science Press, China.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: knowledge management technologies and applications: A literature review

RETRACTED ARTICLE: Knowledge management technologies and app...

引用

作者： An, Xiaomi Wang, Wang Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China

ISBN: (纸本)9781424469291

knowledge management (KM) technologies and applications are fundamental to the success of KM programs. This paper aims to find out linkages between newly-developed KM theories and various technologies and their relevant applications. It explores various understandings on KM technologies, their functions and benefits to organizations, and several types of classification of KM technologies and their applications by reviewing literature. The authors ask and answer the following questions: (1) How are KM technologies defined in literature according to their different perspectives or disciplines? (2) What are the functions, or the roles, of the KM technologies and their applications as enabling KM? and (3) How are KM technologies classified in literature? This study may have implications to mapping, building and operating KM programs that need to have concerns about KM technologies. Different schools of thought on KM technologies, their functions and benefits and their strengths and limitations as solutions to KM problems shall be taken into account. © 2010 IEEE.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Dynamic balanced storage in wireless sensor networks 07

Dynamic balanced storage in wireless sensor networks

引用

DMSN '07: 4th Workshop on data Management for Sensor Networks

作者： Lai, Yongxuan Chen, Hong Wang, Yufeng School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE No.59 Zhongguancun Street Haidian District Beijing China

ISBN: (纸本)9781595939111

data-centric storage is an effective and important technique in the wireless sensor networks. It stores the sensing data according to their values by mapping them to some point in the network in order to avoid routing all the values outside the network and flooding the queries. However, in most data-centric storage schemes, there is a "hotspot" problem due to the skewness of data and randomness of the mapping functions. Large number of sensor readings (events) may be routed to the same point by the predefined hashed function. In this paper, we propose a new Dynamic BAlanced data-centric Storage (DBAS) scheme, a cooperative strategy between the base station and the in-network processing in wireless sensor network. Our scheme, which utilizes the rich resources in the base station and is aware of the data distributions of the network, dynamically adjusts the mappings from readings to the storage points to balance the storage and workload in the network, as well as to reduce the cost of storing these readings. Moreover, it takes advantage of perimeter routing algorithm of the GPSR routing protocol to store multiple copies of readings to improve the robustness of the network with little overhead. Simulation results show that DBAS is more balanced and energy efficient than the traditional data-centric storage mechanism in wireless sensor network.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A method for measuring journal discriminative capacity and its application in WOS 15th

A method for measuring journal discriminative capacity and i...

引用

15th International Conference on Sustainable Digital Communities, iConference 2020

作者： Wang, Hao Zhang, Baolong Deng, Sanhong Su, Xinning School of Information Management Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China

ISBN: (纸本)9783030436865

Journal discriminative capacity refers to the degree of difference between the journals in research subjects, and is of great significance for detecting the level of journal differentiation. Current research on journal discrepancies is predominantly focused on the quantitative analysis of journal content, and rarely measures the degree of journal difference. To address this lapse in research, a method from the perspective of difference is proposed in this paper to quantitatively measure and analyze the discriminative capacity of journals. Using the bibliographic of Science Citation Index (SCI), Social Science Citation Index (SSCI), and Arts & Humanities Citation Index (A&HCI) journals from 2015–2017 as the data source, the contents differences of 23 Library and information Science (LIS) journals are analyzed through hierarchical clustering and journal discriminative capacity (JDC) measurement. The discriminative capacity of disciplines is then calculated and combined with multidimensional scaling analysis to detect the difference characteristics of journals in ten disciplines, and the mean JDC is used to explore the overall differences of disciplines. Results show that the discriminative capacity of LIS journals is obviously stratified, the journals of library science are the most discriminating, and the journals of evaluation and review are the weakest. In addition, the journals of different disciplines have distinct disciplinary characteristics, with the discriminative capacity of SCI journals as the most notable, followed by SSCI journals, and with A&HCI journals displaying the weakest discriminative capacity. © Springer Nature Switzerland AG 2020.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

Multi-fuzzy-objective graph pattern matching with big graph data

引用

Journal of database Management 2019年第4期30卷 24-40页

作者： Li, Lei Zhang, Fang Liu, Guanfeng 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 Zhongxing Telecommunication Equipment Corporation Nanjing China Macquarie University Sydney Australia

Big graph data is different from traditional data and they usually contain complex relationships and multiple attributes. With the help of graph pattern matching, a pattern graph can be designed, satisfying special personal requirements and locate the subgraphs which match the required pattern. Then, how to locate a graph pattern with better attribute values in the big graph effectively and efficiently becomes a key problem to analyze and deal with big graph data, especially for a specific domain. This article introduces fuzziness into graph pattern matching. Then, a genetic algorithm, specifically an NSGA-II algorithm, and a particle swarm optimization algorithm are adopted for multifuzzy-objective optimization. Experimental results show that the proposed approaches outperform the existing approaches effectively. © 2019,IGI Global.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：