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

3rd International Conference on Innovative Computing Information and Control, ICICIC'08

作者： Li, Haifeng Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769531618

Sequential pattern mining is an important problem in continuous, fast, dynamic and unlimited stream mining. Recently approximate mining algorithms are proposed which spend too many system resources and can only obtain the partial feature of stream. In this paper, a multi-level evolving sequential pattern mining model ESPMM is presented to address this problem thus the mostly entire stream feature is obtained. Furthermore, because of the smaller support of sequential patterns in each level, a mining method BMLA based on Levenshtein-Automata is proposed which builds state conversion model to compute sequences' similarity in linear time. The experiment results show this model is effective and efficient. © 2008 IEEE.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

A Review-Based Reputation Evaluation Approach for Web Services

引用

Journal of Computer Science & Technology 2009年第5期24卷 893-900页

作者：李海华杜小勇 Member 田萱 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Information Science & Technology Beijing Forestry University Beijing 100083 China

Web services are commonly perceived as an environment of both offering opportunities and threats. In this environment, one way to minimize threats is to use reputation evaluation, which can be computed, for example, through transaction feedback. However, the current feedback-based approach is inaccurate and ineffective because of its inner limitations （e.g., feedback quality problem）. As the main source of feedback, the qualities of existing on-line reviews are often varied greatly from low to high, the main reasons include：（1） they have no standard expression formats, （2） dishonest comments may exist among these reviews due to malicious attacking. Up to present, the quality problem of review has not been well solved, which greatly degrades their importance on service reputation evaluation. Therefore, we firstly present a novel evaluation approach for review quality in terms of multiple metrics. Then, we make a further improvement in service reputation evaluation based on those filtered reviews. Experimental results show the effectiveness and efficiency of our proposed approach compared with the naive feedback-based approaches.

关键词： Web services reputation evaluation review quality measurement

来源：评论

学校读者我要写书评

暂无评论

Preventing Recommendation Attack in Trust-Based Recommender Systems

引用

Journal of Computer Science & Technology 2011年第5期26卷 823-828页

作者：张富国 School of Information and Technology Jiangxi University of Finance and Economics Institute of Information Resource Management Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics

Despite its success,similarity-based collaborative filtering suffers from some limitations,such as scalability,sparsity and recommendation *** work has shown incorporating trust mechanism into traditional collaborative filtering recommender systems can improve these *** argue that trust-based recommender systems are facing novel recommendation attack which is different from the profile injection attacks in traditional recommender *** the best of our knowledge,there has not any prior study on recommendation attack in a trust-based recommender *** analyze the attack problem,and find that ＂victim＂ nodes play a significant role in the ***,we propose a data provenance method to trace malicious users and identify the ＂victim＂ nodes as distrust users of recommender *** study of the defend method is done with the dataset crawled from Epinions website.

关键词： data lineage ＂victim＂ node attack trust propagation

来源：评论

学校读者我要写书评

暂无评论

Representation learning: serial-autoencoder for personalized recommendation

引用

Frontiers of Computer Science 2024年第4期18卷 61-72页

作者： Yi ZHU Yishuai GENG Yun LI Jipeng QIANG Xindong WU School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of the People’s Republic of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China

Nowadays,the personalized recommendation has become a research hotspot for addressing information *** this,generating effective recommendations from sparse data remains a ***,auxiliary information has been widely used to address data sparsity,but most models using auxiliary information are linear and have limited *** to the advantages of feature extraction and no-label requirements,autoencoder-based methods have become quite ***,most existing autoencoder-based methods discard the reconstruction of auxiliary information,which poses huge challenges for better representation learning and model *** address these problems,we propose Serial-Autoencoder for Personalized Recommendation(SAPR),which aims to reduce the loss of critical information and enhance the learning of feature ***,we first combine the original rating matrix and item attribute features and feed them into the first autoencoder for generating a higher-level representation of the ***,we use a second autoencoder to enhance the reconstruction of the data representation of the prediciton rating *** output rating information is used for recommendation *** experiments on the MovieTweetings and MovieLens datasets have verified the effectiveness of SAPR compared to state-of-the-art models.

关键词： personalized recommendation autoencoder representation learning collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A Timeline-Based Algorithm for Personalized Tag Recommendation

A Timeline-Based Algorithm for Personalized Tag Recommendati...

引用

11th International Conference on Web Information Systems engineering

作者： Yu, Zhaohui Wang, Puwei Du, Xiaoyong Cui, Jianwei Xu, Tianren Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9783642243950

Recently, tagging has been a flexible and important way to share and categorize web resources, these user-generated tags are effective to represent user interests because these tags reflect human being's judgments while more concise and closer to human understanding, and the user interests are changing over time. Thus, modeling user interests to meet individual user needs is an important challenge for personalization and information filtering applications, such as recommender systems. In this paper, we apply a distance decay model for modeling user interests in terms of tags based on timeline. We then propose a novel algorithm to measure users' similarities in terms of their tagging activity over a specific time period 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 personalized tag recommendation algorithm than other existing methods.

关键词： timeline user interests distance decay model personalized tag recommendation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

In-memory join algorithms on GPUs for large-data 21

In-memory join algorithms on GPUs for large-data

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Guo, Chengxin Chen, Hong Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9781728120584

In traditional databases, join is one of the most computationally expensive operations in query processing. During the past years, GPU has been adopted to improve the performance of join processing because of the features of massive parallelism and high memory bandwidth. Limited by the capacity of GPU memory and the absence of virtual memory management, however, handling the relations that exceed the capacity of the GPU memory is a challenge for GPU-based join algorithms. Because of the high computing throughput provided by GPUs and the low bandwidth of data communication between the CPUs and the GPUs, data have to be partitioned to fit the features of GPUs and to reduce the cost of data transmission. Furthermore, a series of novel techniques have been developed on the GPUs, which can benefit the join algorithms. In this work, we focus on the optimizing of processing join operator on large relations and propose the designs of in-memory hash join and sort-merge join on GPUs. We present the data partition method on the GPUs implemented with a pipeline mechanism. Furthermore, the shuffle instructions and the CUDA streams are applied in our algorithms to best utilize the GPUs. Experimental results indicate that our hash join algorithm delivers up to 1.51X and 1.24X speedup over the state-of-the-art hash join algorithm on CPUs on NVIDIA GTX1080ti-Pascal GPU and TitanV-Volta GPU respectively. For sort-merge join, our algorithm achieves up to 3.52X and 2.21X improvements on the same GPUs respectively compared to the baselines on CPUs. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Method for the Efficient Similarity Calculation

An Adaptive Method for the Efficient Similarity Calculation

引用

14th International Conference on database Systems for Advanced Applications

作者： Cai, Yuanzhe Liu, Hongyan He, Jun Du, Xiaoyong Jia, Xu Key Labs of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783642008863

SimRank is a well-known algorithm for similarity calculation based on object-to-object relationship. However, it suffers from high computation cost. Inthis paper, we find that the convergence behavior of different object pairs is different when we use SimRank to compute the similarity of objects. Many similarity scores converge fast, while others need more time before convergence. Based on this observation, we propose an adaptive method called Adaptive-SimRank to speed up similarity calculation. Using this method, we don't need to recalculate those converged pairs' similarity. The experiments conducted on web datasets and synthetic dataset show that our new method can reduce the running time by nearly 35%.

关键词： Similarity Calculation Linkage Mining

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Parallel hybrid join algorithm on GPU 21

Parallel hybrid join algorithm on GPU

引用

作者： Guo, Chengxin Chen, Hong Zhang, Feng Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9781728120584

In data analytics applications, join is a general and time consuming operation. Optimizing join algorithms can benefit the query processing significantly. The emerging of GPUs provides a massive parallelism solution for improving the performance of the join operation. The hash join (HJ) and sort merge join (SMJ), which are two widely used join algorithms, have been proved effective for efficient join processing on the GPUs. Both algorithms have their own advantages and drawbacks, offering the chance of combining the advantages of HJ and SMJ on GPUs. In processing join operation on GPUs, data need to be transmitted between the CPU and the GPU due to the discrete GPU memory design, which causes performance degradation because of the high PCIe data transfer overhead. As GPUs are becoming more powerful than before, the performance gap between data transmission and GPU execution increases, which makes it even harder to implement an efficient join on GPUs. In this paper, we focus on the optimization of join algorithms on GPUs. We propose the Parallel Hybrid Join algorithm on GPUs(PHYJ) to combine the advantages of HJ and SMJ, and overlap the data communication and GPU execution with a pipeline mechanism. In our evaluation, the PHYJ shows up to 1.72X and 1.55X speedup over the up-to-date HJ and SMJ algorithms respectively on a NVIDIA GTX 1080ti-Pascal GPU. On the TitanV-Volta GPU, up to 1.54X and 1.42X improvements can be achieved over the baseline HJ and SMJ algorithms respectively. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：