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

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Zhao, Tingting Pei, Bin Zhao, Suyun Chen, Hong Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China

ISBN: (纸本)9783642385612

Feature selection is a powerful tool of dimension reduction from datasets. In the last decade, more and more researchers have paid attentions on feature selection. Further, some researchers begin to focus on feature selection from probabilistic datasets. However, in the existing method of feature selection from probabilistic data, the distance hidden in probabilistic data is neglected. In this paper, we design a new distance measure to select informative feature from probabilistic databases, in which both the distance and randomness in the data are considered. And then, we propose a feature selection algorithm based on the new distance and develop two accelerative algorithms to boost the computation. Furthermore, we introduce a parameter into the distance to reduce the sensitivity to noise. Finally, the experimental results verify the effectiveness of our algorithms. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Efficient compressed index for top-k spatial keyword query

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 157-168页

作者： Zhou, Xin Zhang, Xiao An, Run-Gong Xue, Zhong-Bin Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing100872 China School of Information Renmin University Beijing100872 China

Location-Based services guide a user to find the object which provides services located in a particular position or region (e.g., looking for a coffee shop near a university). Given a query location and multiple keywords, location-based services return the most relevant objects ranked according to location proximity and text relevancy. Various hybrid indexes have been proposed in recent years which combine R-tree and inverted index to improve query efficiency. Unfortunately, the state-of-the-art approaches require more space in order to reduce response time. Cache mechanism is inefficient due to huge storage overhead. In this paper, a novel index based on index compressed technology (CSTI) is proposed, to answer top-k SKQ. CSTI significantly reduces storage overhead (by at least 80%), while maintaining efficient query performance. Extensive experiments based on real dataset and simulated dataset confirm CSTI is effective and efficient. ©2014 ISCAS.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Fast SimRank computation over disk-resident graphs

Fast SimRank computation over disk-resident graphs

引用

18th International Conference on database Systems for Advanced Applications, DASFAA 2013

作者： Zhang, Yinglong Li, Cuiping Chen, Hong Sheng, Likun Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education And Department of Computer Science Renmin University of China China JiangXi Agricultural University China

ISBN: (纸本)9783642374494

There are many real-world applications based on similarity between objects, such as clustering, similarity query processing, information retrieval and recommendation systems. SimRank is a promising measure of similarity based on random surfers model. However, the computational complexity of SimRank is high and several optimization techniques have been proposed. In the paper optimization issue of Sim-Rank computation in disk-resident graphs is our primary focus. First we suggest a new approach to compute *** we propose optimization techniques that improve the time cost of the new approach from O (kN2 D2) to O (kNL), where k is the number of iteration, N is the number of nodes, L is the number of edges, and D is the average degree of nodes. Meanwhile, a threshold sieving method is presented to reduce storage and computational cost. On this basis, an external algorithm computing SimRank in disk-resident graphs is introduced. In the experiments, our algorithm outperforms its opponent whose computation complexity also is O (kNL). © Springer-Verlag 2013.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

MFSV: A truthfulness determination approach for fact statements

MFSV: A truthfulness determination approach for fact stateme...

引用

18th International Conference on database Systems for Advanced Applications, DASFAA 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: (纸本)9783642374494

How to determine the truthfulness of a piece of information becomes an increasingly urgent need for users. In this paper, we propose a method called MFSV, to determine the truthfulness of fact statements. We first calculate the similarity between a piece of related information and the target fact statement and capture the credibility ranking of the related information through combining importance ranking and popularity ranking. Based on these, contributions of a piece of related information to the truthfulness determination is derived. Then we propose two methods to determine the truthfulness of the target fact statement. At last, we run comprehensive experiments to show MFSV's availability and high accuracy. © Springer-Verlag 2013.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

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

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

来源：评论

学校读者我要写书评

暂无评论

Identification of misleading product description in e-commerce website

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 127-135页

作者： Long, Yin Liu, Hong-Yan He, Jun Hu, He Du, Xiao-Yong Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing100872 China School of Information Renmin University of China Beijing100872 China School of Economics and Management Tsinghua University Beijing100084 China

Online shopping has been accepted by more and more consumers. C2C websites provide thousands of offers for consumers as a mainstream e-commerce platform. When customers search products in C2C website, some returned offers have misleading description. Misleading description means that the description does not convey the actual price of products, but usually claiming much lower price for the purpose of attracting more consumers. The misleading offers affect consumers' judgments and bring bad influences on the websites' reputation. This paper proposes an approach that combines statistical model HMM with statistical outlier detection method to detect misleading offers. HMM model is built to determine the product that an offer description really designates, providing an efficient solution to eliminate the ambiguity of the offer description caused by description irregularities. The statistical outlier detection method is effective to deal with limited product offer information. The paper further conducts experiments on real data set of electric business websites and the results demonstrate the effectiveness of the proposed approach. ©2014 ISCAS.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A framework for personalized management of domain ontologies

A framework for personalized management of domain ontologies

引用

2012 IEEE/ACIS 11th International Conference on Computer and Information Science, ICIS 2012

作者： Liu, Runnan Wang, Puwei Zheng, Shixian Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China

ISBN: (纸本)9780769546940

As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies to users during run time according to user preferences. It helps that users can focus on their interested parts, instead of the whole. It increases the efficiency of ontology-based application. This paper proposes a framework for personalized management of domain ontologies. In this framework, a user model firstly is introduced to describe user preferences. Secondly, domain ontologies are decomposed into moderate-scale modules with high cohesion and low coupling. During run time, modules that a user is interested in are selected out based on the user's preferences. Finally, the selected modules are combined to construct personalized views of domain ontologies for the user. © 2012 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Combining N-gram retrieval with weights propagation on massive RDF graphs

Combining N-gram retrieval with weights propagation on massi...

引用

2012 9th International Conference on Fuzzy Systems and knowledge Discovery, FSKD 2012

作者： Hu, He Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781467300223

N-gram approach takes the position information into account additionally and thus can offer higher accuracy in query answering than keyword based approaches and is widely used in IR and NLP. However, in large-scale RDF graphs, URIs instead of documents are the ranking and querying units;URIs are usually much shorter than documents, and different URIs are interlinked into a massive network. One shot n-gram querying is usually not good for the RDF data in many cases. In this paper, we present a hybrid framework which combines the n-gram retrieval with link analysis based weight propagation. The idea is to exploit the link structures in the RDF data graphs and propagate the one shot n-gram score weights along with these links. Large scale experiments using MapReduce on Billion Triples Challenge dataset show the hybrid framework achieves an 80.3% improvement in relevance scores over mere n-gram retrieval. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：