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

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

作者： Deng, Song Wan, Changxuan Liu, Xiping School of Information Technology Jiangxi University of Finance and Ecomomics Nanchang China School of Software Jiangxi Agricultural University Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9780769545448

There are hundreds or thousands of web data sources providing data of relevance to a particular domain on the Web, so how to find a suitable set of sources quickly to integrate from a number of sources is becoming more and more important. Traditional data sources selection methods that are based on data quality do not consider quality characteristics of data sources under the different domains, but select the same quality dimensions for quality evaluation models. As a result, accuracies of a traditional method under different domains are quite different. In light of this, we propose a Web multimedia source selection method based on user feedback. We gain accurate core quality dimensions of data sources under the multimedia domain based on user feedback, and then achieve a quality estimation model of the multimedia data sources. The experiments on hundreds of real-world multimedia data sources have proved that our approach is efficient and accurate. © 2011 IEEE.

关键词： Accuracy Computers data Source data models databases Equations Mathematical model Multimedia Multimedia communication Quality Dimensions User Feedback Web data source data quality estimation model quality evaluation model quality multimedia computing mult

来源：评论

学校读者我要写书评

暂无评论

Analysis of bandwagon and average hybrid attack model against trust-based recommender systems

Analysis of bandwagon and average hybrid attack model agains...

引用

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

作者： Zhang, Fuguo School of Information and Technology Jiangxi University of Finance and Economics Nanchang China Institute of Information Resource Management Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9780769545448

Recommender systems have been accepted as a vital application on the web by offering product advice or information that users might be interested in. Despite its success, similarity-based collaborative filtering suffers from some significant limitations, such as scalability, sparsity and recommendation attack. Prior work has shown incorporating trust mechanism into traditional collaborative filtering recommender systems can improve these limitations. However, trust-based recommender systems are also known to be vulnerable to profile infection attacks. Malicious users can inject a large number of biased profiles into such a system in order to make recommendations that favor or disfavor given items. In this paper, we propose a bandwagon and average hybrid attack model and analysis the effectiveness of the attack model against topic-level trust-based recommender algorithm. The results of our experiments conducted on well-known dataset show that the hybrid attack model is more effective than other attack models. © 2011 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Reduce pruning cost to accelerate multimedia kNN search over MBRs based index structures

Reduce pruning cost to accelerate multimedia kNN search over...

引用

3rd International Conference on Multimedia information Networking and Security, MINES 2011

作者： Li, Hui Zhang, Xiao Wang, Shan School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

ISBN: (纸本)9780769545592

MBR (Minimum Bounding Rectangle) has been widely used to represent multimedia data objects for multimedia indexing techniques. In kNN search, MINDIST and MINMAXDIST was the most popular pruning metrics employed by MBR based index structures. However, with the increase of dimensionality, the computation costs of above two metrics are expensive, and the involved distance computations may become the considerable component. In this paper, to improve the performance of kNN search over multimedia data, we proposed an approach to reduce the computation cost of pruning heuristics by use the cheap upper bound of MINMAXDIST instead of its precise value, and then we derive enhanced cheap heuristics based on this upper bound for kNN pruning, which are helpful to avoid visiting unnecessary data objects and MBRs. We conducted an extensive experimental study on a large real-life multimedia dataset called MSRA-MM 2.0, obtained from the commercial Bing Image search engine. The results show that the proposed approach significantly reduced the computation cost and boosted the overall performance of MBR based multimedia kNN search. © 2011 IEEE.

关键词： Cost reduction

来源：评论

学校读者我要写书评

暂无评论

A practice probability frequent pattern mining method over transactional uncertain data streams

A practice probability frequent pattern mining method over t...

引用

Lecture Notes in Computer Science

作者： Liao, Guoqiong Wu, Linqing Wan, Changxuan Xiong, Naixue School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China Department of Computer Science Georgia State University United States

ISBN: (纸本)9783642236402

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns;(2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree;and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space. © 2011 Springer-Verlag.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Efficient Duplicate Detection on Cloud Using a New Signature Scheme

Efficient Duplicate Detection on Cloud Using a New Signature...

引用

12th International Conference on Web-Age information Management

作者： Rong, Chuitian Lu, Wei Du, Xiaoyong Zhang, Xiao Key Labs. of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China Shanghai Key Laboratory of Intelligent Information Processing China

ISBN: (纸本)9783642235344;9783642235351

Duplicate detection has been well recognized as a crucial task to improve the quality of data. Related work on this problem mainly aims to propose efficient approaches over a single machine. However, with increasing volume of the data, the performance to identify duplicates is still far from satisfactory. Hence, we try to handle the problem of duplicate detection over MapReduce, a share-nothing paradigm. We argue the performance of utilizing MapReduce to detect duplicates mainly depends on the number of candidate record pairs. In this paper, we proposed a new signature scheme with new pruning strategy over MapReduce to minimize the number of candidate record pairs. Our experimental results over both real and synthetic datasets demonstrate that our proposed signature based method is efficient and scalable.

关键词： duplicate detection MapReduce Cloud

来源：评论

学校读者我要写书评

暂无评论

Lawyer information integration and recommendation by multi-source information validation

Lawyer information integration and recommendation by multi-s...

引用

2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011

作者： Liu, Tao Fan, Biao Hu, He Du, Xiao-Yong Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9781457703065

On the internet, all-round lawyer information is located at separated information sources, which prevent web users from effective information acquisition. In order to build a unified view of separated, heterogeneous, and often redundant lawyer information, we propose a new information integration method using multi-source information cross-validation. Based on the unified integrated data, a lawyer recommendation system is built. Several key technologies are presented and evaluated, including the multi-source information acquisition and validation. Experimental results indicate the key techniques used in the system are effective for lawyer information integration and recommendation. © 2011 IEEE.

关键词： information retrieval

来源：评论

学校读者我要写书评

暂无评论

Improving performance by creating a native join-index for OLAP

引用

Frontiers of Computer Science 2011年第2期5卷 236-249页

作者： Yansong ZHANG Shan WANG Jiaheng LU National Survey Research Center at Renmin University of China Beijing 100872 China Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

The performance of online analytical processing （OLAP） is critical for meeting the increasing requirements of massive volume analytical applications. Typical techniques, such as in-memory processing, column-storage, and join indexes focus on high perfor- mance storage media, efficient storage models, and reduced query processing. While they effectively perform OLAP applications, there is a vital limitation： main- memory database based OLAP （MMOLAP） cannot provide high performance for a large size data set. In this paper, we propose a novel memory dimension table model, in which the primary keys of the dimension table can be directly mapped to dimensional tuple addresses. To achieve higher performance of dimensional tuple access, we optimize our storage model for dimension tables based on OLAP query workload features. We present directly dimensional tuple accessing （DDTA） based join （DDTA- JOIN）, a technique to optimize query processing on the memory dimension table by direct dimensional tuple access. We also contribute by proposing an optimization of the predicate tree to shorten predicate operation length by pruning useless predicate processing. Our experimental results show that the DDTA-JOIN algorithm is superior to both simulated row-store main memory query processing and the open-source column-store main memory database MonetDB, thanks to the reduced join cost and simple yet efficient query processing.

关键词： directly dimensional tuple accessing (DDTA) – DDTA JOIN – native join index – predicate tree

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient routing of vehicular ad hoc network based on position service information

引用

Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and information Science of Wuhan University 2012年第9期37卷 1126-1129页

作者： Tan, Wenhu Li, Qingquan School of Electronic Information Wuhan University Luojia Hill Wuhan 430072 China Engineering Research Center for Spatio-Temporal Data Smart Acquisition and Application Ministry of Education Wuhan University 129 Luoyu Road Wuhan 430079 China College of Physical Science and Technology Central China Normal University 152 Luoyu Road Wuhan 430079 China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University 129 Luoyu Road Wuhan 430079 China

A routing protocol based on position service information is proposed which adopts the cooperation of micro-scale routing within a road limits and macro-scale routing between roads for VANETS. The optimized Dijkstra algorithm is employed to calculate an oriented optimum route for source and destination. The simulation results show that the proposed protocol enhances the throughputs and reduce the end-to-end delay.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel skyline processing using hyperplane projections 11

Efficient parallel skyline processing using hyperplane proje...

引用

2011 ACM SIGMOD and 30th PODS 2011 Conference

作者： Köhler, Henning Yang, Jing Zhou, Xiaofang School of Information Technology and Electrical Engineering University of Queensland Australia School of Information Renmin University of China Key Labs. of Data Engineering and Knowledge Engineering BeiJing China

ISBN: (纸本)9781450306614

The skyline of a set of multi-dimensional points (tuples) consists of those points for which no clearly better point exists in the given set, using component-wise comparison on domains of interest. Skyline queries, i.e., queries that involve computation of a skyline, can be computationally expensive, so it is natural to consider parallelized approaches which make good use of multiple processors. We approach this problem by using hyperplane projections to obtain useful partitions of the data set for parallel processing. These partitions not only ensure small local skyline sets, but enable efficient merging of results as well. Our experiments show that our method consistently outperforms similar approaches for parallel skyline computation, regardless of data distribution, and provides insights on the impacts of different optimization strategies. © 2011 ACM.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：