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

作者： Liu, Dexi Wan, Changxuan Xiong, Naixue Park, Jong Hyuk Rho, Seungmin Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea Republic of School of Electrical Engineering Korea University Seoul Korea Republic of

Sensor fusion is the combining of sensory data from disparate sources such that the resulting information is in some sense better than would be possible when these sources were used individually. The natural uncertainty exists in these data because sensors are not precise enough. Hence, the intuitive method to store this kind of data is using uncertain database. Finding the top-k entities according to one or more attributes is a powerful technique when the uncertain database contains large quantity of data. However, compared to top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. We propose a method to process entity-based global top-k aggregate queries in uncertain database, which returns the top-k entities that have the highest aggregate value. Our method has two levels, entity state generation and G-topk-E query processing. In the former level, entity states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming-based global top-k entity query processing is employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2012 Springer-Verlag London Limited.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

A dominating set based approach to identify effective leader group of social network

A dominating set based approach to identify effective leader...

引用

19th International Computing and Combinatorics Conference, COCOON 2013

作者： Kim, Donghyun Li, Deying Asgari, Omid Li, Yingshu Tokuta, Alade O. Dept. of Mathematics and Computer Science North Carolina Central University Durham NC 27707 United States Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Renmin 100872 China Dept. of Computer Science Georgia State University Atlanta GA 30303 United States

ISBN: (纸本)9783642387678

Very recently, the study of social networks has received a huge attention since we can learn and understand many hidden properties of our society. This paper investigates the potential of social network analysis to select an effective leadership group of a society. Based on our real life observation, we establish three essential requirements for an effective leadership group, namely Influenceability, Partisanship, and Bipartisanship. Then, we formulate the problem of finding a minimum size leader group satisfying the three requirements as the minimum connected k-core dominating set problem (MCkCDSP), and show its NP-hardness. In addition, we introduce an extension of MCkCDSP, namely MCkCDSP-C, which assumes the society has a number of communities and requires at least one representative from each community should be in the leadership. At last, we propose an approximation algorithm for a subclass of MCkCDSP with k = 2, and show an α-approximation algorithm of MCkCDSP can be used to obtain an α-approximation algorithm of MCkCDSP-C. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A broadcasting multiple blind signature scheme based on quantum GHZ entanglement

引用

International Journal of Modern Physics: Conference Series 2014年第33期ijmpcs卷

作者： Yuan Tian Hong Chen Yan Gao Honglin Zhuang Haigang Lian Zhengping Han Peng Yu Xiangze Kong Xiaojun Wen Key Laboratory of Data Engineering and Knowledge Engineering China (Remin University of China) of Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China China Computer User Association Information Protection Branch Beijing 100089 China School of Computer Science and Engineering Beihang University Beijing 100083 China School of Electronics & Information Engineering Shenzhen Polytechnic Shenzhen 518055 China

Using the correlation of the GHZ triplet states, a broadcasting multiple blind signature scheme is proposed. Different from classical multiple signature and current quantum signature schemes, which could only deliver either multiple signature or unconditional security, our scheme guarantees both by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. Our proposed scheme has the properties of multiple signature, blindness, non-disavowal, non-forgery and traceability. To the best of our knowledge, we are the first to propose the broadcasting multiple blind signature of quantum cryptography.

关键词： Broadcasting multiple blind signature quantum encryption algorithm quantum entanglement quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

On charactering of information propagation in online social networks

引用

Journal of Networks 2013年第1期8卷 124-131页

作者： Han, Xiaoting Niu, Li School of Economics and Management Beihang University Beijing China Key Laboratory of Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China

Recent years have witnessed the explosive growth of online social networks (OSNs), which provide a perfect platform for observing the information propagation. Based on the theory of complex network analysis, considering each node in OSNs as an agent, an information propagation model called IP-OSN has been proposed in this paper, and numerical simulation experiments have been extensively conducted, which show the mechanism of information propagation in OSNs. It can be seen from the experimental results that along with the information spreading scope will be larger while time passing. Moreover, from the network structure perspective, some interesting findings are got. First, the number of initial known nodes has a certain impact on the information propagation speed;however it doesn't affect the number of final known and unknown nodes. Then, the number of neighbors has a great impact on the information propagation process and results. Finally, percentage of different user type is the decisive factor for information propagation either in final node number or propagation speed. This paper attempts to complement the theoretical framework of information propagation and complex networks, and thus to further promote the practice of information control in OSNs. © 2013 ACADEMY PUBLISHER.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Summarizing Large-Scale database Schema Using Community Detection

引用

Journal of Computer Science & Technology 2012年第3期27卷 515-526页

作者：王雪周烜王珊 School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of 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 difficult 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.

关键词： schema summarization large scale community detection

来源：评论

学校读者我要写书评

暂无评论

A new BP algorithm for network marketing performance evaluation of agricultural products

引用

Journal of Applied Sciences 2013年第20期13卷 4332-4335页

作者： Zou, Chun-Fang Huang, Li-Juan School of of Business Administration Jiangxi University of Finance and Economics 330013 Nanchang Jiangxi China School of Information Technology Jiangxi University of Finance and Economics 330013 Nanchang Jiangxi China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics 330013 Nanchang Jiangxi China

Network marketing performance evaluation can sum up and improve the network marketing activities for network enterprises. So, how to evaluate network marketing performance has become a matter of concern in the field related. The study mainly takes agricultural products for example and presents a new algorithm for evaluating network marketing performance based on improved BP neural network algorithm. First, a evaluation indicator system for evaluating network marketing performance of agricultural products is constructed;Second the study analyzes the reasons of the defects of BP neural network algorithm and then designs a new BP algorithm and improves it through changing its learning rate to speed up the calculation and simplify the structure of the original BP algorithm;Finally, the improved algorithm is realized with three e_commerce enterprises are taken for examples to evaluate the network marketing performance and verify the validity and feasibility of the model and the experimental results show that the model can evaluate the network marketing performance of different enterprises practically. © 2013 Asian Network for Scientific Information.

关键词： Agricultural products

来源：评论

学校读者我要写书评

暂无评论

Synonyms weighted LDA for product aspects extraction

引用

International Journal of Applied Mathematics and Statistics 2013年第24期51卷 283-291页

作者： Peng, Yun Wan, Changxuan School of Information and Technology Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China Computer and Information Engineering College Jiangxi Normal University Nanchang 330022 Jiangxi China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China

It is important to extract the aspects from the comments of shoppers about certain products. Product aspect descriptions often contain words of same meaning, and discriminating these synonyms effectively can improve the efficiency of aspects extraction. Standard topic model in identifying those words, because of the absent introduction of priori knowledge, will largely ignore the relations of words meaning. An improved aspects extracting model of LDA by adding synonymous words constraint is proposed in this paper. In the process of words clustering analysis, words with high similarity are aggregated in the same cluster. In the stage of aspects extraction, we introduce words clustering and cluster membership weights as priori knowledge to strengthen the original LDA topic model for features clustering, which can improve the accuracy of product aspects extraction. Our experiments show that synonyms weighted LDA proposed in this paper outperforms the original LDA by a large margin. © 2013 by CESER Publications.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

An approach for personalized tag recommendation based on interest transfer model

An approach for personalized tag recommendation based on int...

引用

9th Web Information Systems and Applications Conference, WISA 2012

作者： Liu, Yue Yang, Nan Yang, Gang School of Information Renmin University of China Bejing China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Bejing China

ISBN: (纸本)9781467330541

Recently, social tagging systems become more and more popular in many Web 2.0 applications. In such systems, Users are allowed to annotate a particular resource with a freely chosen a set of tags. These user-generated tags can represent users' interests more concise and closer to human understanding. Interests will change over time. Thus, how to describe users' interests and interests transfer path become a big challenge for personalized recommendation systems. In this approach, we propose a variable-length time interval division algorithm and user interest model based on time interval. Then, in order to draw users' interests transfer path over a specific time period, we suggest interest transfer model. After that, we apply a classical community partition algorithm in our approach to separate users into communities. Finally, we raise a novel method to measure users' similarities based on interest transfer model and provide personalized tag recommendation according to similar users' interests in their next time intervals. Experimental results demonstrate the higher precision and recall with our approach than classical user-based collaborative filtering methods. © 2012 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

JUFE at INEX 2011 Snippet Retrieval Track

JUFE at INEX 2011 Snippet Retrieval Track

引用

Lecture Notes in Computer Science

作者： Liu, Dexi Wan, Changxuan Liao, Guoqiong Zhong, Minjuan Liu, Xiping School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9783642357336

Jiangxi University of Finance and Economics (JUFE) submitted 8 runs to the Snippet Retrieval Track at INEX *** report describes an XML snippet retrieval method based on Average Topic Generalization (ATG) model used by JUFE. The basic idea of the ATG is that different element in an XML document plays different role and hence should has distinguishing importance. The ATG model sets a weight automatically to each element according to its tag or path in the XML document. Then, the BM25EW model based on the ATG is proposed to retrieve and rank the relevant elements in an XML document collection. All windows in the most relevant elements are scored and those windows with higher scores are extracted as snippets. By comparing with the runs under different strategies, the performance are discussed and analyzed in detail. © Springer-Verlag Berlin Heidelberg 2012.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：