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

24th International Conference on Neural Information Processing (ICONIP)

作者： Zhao, Zhi-Lin Huang, Ling Wang, Chang-Dong Lai, Jian-Huang Yu, Philip S. Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou Peoples R China Univ Illinois Dept Comp Sci Chicago IL USA Tsinghua Univ Inst Data Sci Beijing Peoples R China

ISBN: (纸本)9783319701394;9783319701387

Recently, recommendation algorithms have been widely used to improve the benefit of businesses and the satisfaction of users in many online platforms. However, most of the existing algorithms generate intermediate output when predicting ratings and the error of intermediate output will be propagated to the final results. Besides, since most algorithms predict all the unrated items, some predicted ratings may be unreliable and useless which will lower the efficiency and effectiveness of recommendation. To this end, we propose a Low-rank and Sparse Matrix Completion (LSMC) method which recovers rating matrix directly to improve the quality of rating prediction. Following the common methodology, we assume the structure of the predicted rating matrix is low-rank since rating is just connected with some factors of user and item. However, different from the existing methods, we assume the matrix is sparse so some unreliable predictions will be removed and important results will be retained. Besides, a slack variable will be used to prevent overfitting and weaken the influence of noisy data. Extensive experiments on four real-world datasets have been conducted to verify that the proposed method outperforms the state-of-the-art recommendation algorithms.

关键词： recommendation algorithms Low-rank Sparse

来源：评论

学校读者我要写书评

暂无评论

A Graph-Based recommendation Algorithm on Quaternion Algebra

引用

SN Computer Science 2022年第4期3卷 1-15页

作者： Kurt, Zuhal Gerek, Ömer Nezih Bilge, Alper Özkan, Kemal Department of Computer Engineering Atılım University Ankara Turkey Department of Electrical and Electronics Engineering Eskişehir Technical University Eskişehir Turkey Department of Computer Engineering Akdeniz University Antalya Turkey Department of Computer Engineering Eskişehir Osmangazi University Eskişehir Turkey

This study presents a novel Quaternion-based link prediction method to be used in different recommendation systems. The method performs Quaternion algebra-based computations while making use of expressive and wide-ranged learning properties of the Hamilton products. The proposed key capabilities rely on link prediction to boost performance in top-N recommendation tasks. According to the achieved experimental results, the proposed method allows for highly improved performance according to three quality measurements: (i) hits rate, (ii) coverage, and (iii) novelty;when applied to two datasets, namely the Movielens and Hetrec datasets. To assess the flexibility level of the proposed algorithm in terms of incorporating alternative sources of information, further wide-scale tests are carried out on three subsets of the Amazon dataset. Hence, the effectiveness of Quaternion algebra in graph-based recommendation algorithms is verified. The algorithms suggested here are further enhanced using similarity and dissimilarity factors between users and items, as well as ‘like’ and ‘dislike’ relationships between users and items. It is observed that this approach is adaptable by incorporating different information sources and can successfully overcome the drawbacks of conventional graph-based recommender systems. It is argued that the proposed novel idea of Quaternion-based link prediction method stands as a superior alternative to existing methods. © 2022, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： Graphs Link prediction Quaternions recommendation algorithms

来源：评论

学校读者我要写书评

暂无评论

Coupling Semantic Association Graphs with Contrastive Learning in recommendation 27

Coupling Semantic Association Graphs with Contrastive Learni...

引用

27th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)

作者： Ji, Yifan Zhou, Jing Commun Univ China Sch Comp & Cyber Sci Beijing Peoples R China

ISBN: (纸本)9798350391961;9798350391954

Knowledge graphs (KGs) are typically used to enhance the performance of recommender systems by leveraging their characteristic to supplement the sparse user-item interaction data in the latter. This is because KGs feature abundant semantic information about entities (e.g. users or items in recommender systems) and inter-entity relationships. Deep learning has been seen gain wide use in boosting the performance of recommender systems. Thanks to focusing merely on nodes in a KG, or entities, such an approach, however, suffers from well capturing the semantics hidden in the node connectivity when learning node embeddings, leading to undesirable discovery of potential semantic associations between nodes. Against this background, we propose for recommender systems a multi-level cross-view contrastive learning mechanism that learns high-quality feature representations from unlabeled data. By incorporating item-item correlations into item embeddings, we developed an inter-item semantic association graph (SAG), which was intended to model more comprehensive and finer-grained inter-item semantic associations. A series of experiments have been carried out and the findings verify that the proposed mechanism outperforms other baseline models on all metrics, confirming the effectiveness of coupling SAGs with contrastive learning in enhancing the performance of recommender systems.

关键词： graph neural network semantic similarity contrastive learning knowledge graph recommendation algorithms

来源：评论

学校读者我要写书评

暂无评论

Visual Analysis of recommendation Performance 17

Visual Analysis of Recommendation Performance

引用

11th ACM Conference on Recommender Systems (RecSys)

作者： Coba, Ludovik Symeonidis, Panagiotis Zanker, Markus Free Univ Bozen Fac Comp Sci Piazza Domenicani 3 I-39100 Bolzano Italy

ISBN: (纸本)9781450346528

rrecsys is a novel library in R for developing and assessing recommendation algorithms. In this demo, we extend rrecsys with functions for visual analytics of recommendation performance, that is one of the strong capabilities of the R environment. In particular, we show how the library can be used to depict dataset characteristics, train and test recommendation algorithms and to visually assess, for instance, their capability to exploit long-tail items for making correct predictions.

关键词： recommendation algorithms R evaluation Visualization

来源：评论

学校读者我要写书评

暂无评论

A Multiobjective Genetic Algorithm based Hybrid recommendation Approach

A Multiobjective Genetic Algorithm based Hybrid Recommendati...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Wang, Pan Zuo, Xingquan Guo, Congcong Li, Ruihong Zhao, Xinchao Luo, Chaomin Beijing Univ Posts & Telecommun Sch Comp Sci Beijing Peoples R China Minist Educ Key Lab Trustworthy Distributed Comp & Serv Beijing Peoples R China Beijing Univ Posts & Telecommun Sch Sci Beijing Peoples R China Univ Detroit Mercy Dept Elect & Comp Detroit MI 48221 USA

ISBN: (纸本)9781538627266

Personalized recommendation approaches have received much attention over the years. In this paper, we propose a hybrid recommendation approach that integrates an item-based collaborative filtering, a user-based collaborative filtering and a matrix factorization method. The approach considers the two objectives of recommendation's accuracy and diversity simultaneously. First, a set of items is created separately by each of the three methods. Then, items produced by the three methods are combined into a set of candidate items. Finally, a multiobjective genetic algorithm is adopted to choose a set of Pareto recommendation lists from the set. Experimental results show that the proposed approach is very effective and is able to produce better Pareto solutions than those comparative approaches.

关键词： recommendation algorithms multiobjective optimization algorithms hybrid algorithm

来源：评论

学校读者我要写书评

暂无评论

Tuning in to Personalized Music: A Spotify API-Based Hybrid recommendation System Integrating Content-Based and Popularity-Based Approaches 2

Tuning in to Personalized Music: A Spotify API-Based Hybrid ...

引用

2nd IEEE International Conference on Futuristic Technologies, INCOFT 2023

作者： Bachal, Tarush Kumar, Ashwin Bachal, Anish Gutte, Vitthal S. Mit World Peace University Department of Computer Engineering & Technology Maharashtra Pune India Mit World Peace University Department of Electronics and Communication Engineering Maharashtra Pune India Dr. Vishwanath Karad Mit World Peace University Department of Computer Engineering and Technology Maharashtra Pune India

ISBN: (纸本)9798350308846

This research paper offers a comprehensive approach for constructing a successful music recommendation system that integrates popularity- and content-based approaches. The suggested method intends to improve music discovery for users in an era of expansive music libraries and personalized user experiences. It makes use of the Spotify API to compile thorough track data and employs data preparation methods to guarantee data quality. The recommendation engine is the center of the research. Song recommendations are personalized by a content-based algorithm that bases them on aural features. In addition, a hybrid model balances user preferences and trending music by weighting track popularity by release date. A user-friendly GUI is included to make it easier for users to interact, allowing users to input their favorite music and get recommendations right away. Although the code serves as the basis for a strong recommendation system, later versions can include performance criteria for evaluation, such as accuracy, precision, and recall. This study contributes to the constantly developing field of music technology and user pleasure by providing a foundation for the improvement of music recommendation systems. © 2023 IEEE.

关键词： Content-Based Data Analysis Data Preprocessing Hybrid recommendation Personalization Popularity-Based recommendation algorithms Spotify API User Interface

来源：评论

学校读者我要写书评

暂无评论

A recommendation system to support design patterns selection

A recommendation system to support design patterns selection

引用

2010 IEEE Symposium on Visual Languages and Human-Centric Computing, VL/HCC 2010

作者： Navarro, Ignacio Díaz, Paloma Malizia, Alessio Computer Science Universidad Carlos III DEI Lab Leganés Madrid Spain

ISBN: (纸本)9780769542065

Pattern languages might be useful tools for design as far as designers can identify the right patterns. For this users need to understand the relationships between patterns and how to combine them. In this process, knowing how patterns have been used by other designers might help in identifying the best combination of solutions. In this paper we propose a module that recommends patterns based on the selection already made by them, with a view to supporting designers in making the correct design decisions. © 2010 IEEE.

关键词： component design decisions design patterns design patterns selection information filtering object-oriented methods pattern languages recommendation algorithms recommendation system recommender systems

来源：评论

学校读者我要写书评

暂无评论

Thesis Reviewer recommendation Based on Multi-Graph Neural Networks

Thesis Reviewer Recommendation Based on Multi-Graph Neural N...

引用

2024 International Conference on Machine Learning and Intelligent Computing, MLIC 2024

作者： Wang, Tao Fu, Peng Zhang, Jing Chen, Kaixuan Nanjing University of Science and Technology Nanjing China Jiangsu Guidgine Educational Evaluation Inc. Nanjing China

Thesis review is a crucial step in ensuring the quality of academic theses, and accurately recommending reviewers for theses is currently a problem that needs to be addressed. When reviewer information is incomplete, it is difficult to achieve good recommendation results. This paper proposes a Multi-Graph Neural Network algorithm for review reviewer recommendation in thesis review. Based on the keyword-reviewer bipartite graph, a graph neural network model is constructed. By utilizing graph neural networks, high-order relationships between reviews and keywords can be explored, enabling the discovery of reviews' implicit research interests and expanding their research interests to some extent. Additionally, incorporating keyword-keyword interaction graphs and review-review interaction graphs allows for information exchange operations in the two graphs separately, enhancing the representation of keywords and reviews. We conducted experiments on real thesis reviews and compared the proposed algorithm with other recommendation algorithms. The results show that the proposed algorithm achieves favorable results across various evaluation metrics, demonstrating the effectiveness of the algorithm presented in this paper. © 2024 T. Wang, P. Fu, J. Zhang & K. Chen.

关键词： Bipartite Graph Graph Neural Networks recommendation algorithms Thesis Reviewer recommendation

来源：评论

学校读者我要写书评

暂无评论

Composite recommendations： from items to packages

引用

Frontiers of Computer Science 2012年第3期6卷 264-277页

作者： Min XIE Laks V. S. LAKSHMANAN Peter T. WOOD Department of Computer Science University of British Columbia Vancouver V6T 1Z4 Canada Department of Computer Science and Information Systems Birkbeck University of London London WCIE 7HX UK

Classical recommender systems provide users with a list of recommendations where each recommendation consists of a single item, e.g., a book or DVD. However, sev- eral applications can benefit from a system capable of recom- mending packages of items, in the form of sets. Sample appli- cations include travel planning with a limited budget （price or time） and twitter users wanting to select worthwhile tweeters to follow, given that they can deal with only a bounded num- ber of tweets. In these contexts, there is a need for a system that can recommend the top-k packages for the user to choose from. Motivated by these applications, we consider composite recommendations, where each recommendation comprises a set of items. Each item has both a value （rating） and a cost associated with it, and the user specifies a maximum total cost （budget） for any recommended set of items. Our composite recommender system has access to one or more component recommender systems focusing on different do- mains, as well as to information sources which can provide the cost associated with each item. Because the problem of deciding whether there is a recommendation （package） whose cost is under a given budget and whose value exceeds some threshold is NP-complete, we devise several approximation algorithms for generating the top-k packages as recommen- dations. We analyze the efficiency as well as approximation quality of these algorithms. Finally, using two real and two synthetic datasets, we subject our algorithms to thorough ex- perimentation and empirical analysis. Our findings attest tothe efficiency and quality of our approximation algorithms for the top-k packages compared to exact algorithms.

关键词： recommendation algorithms optimization,top-k query processing

来源：评论

学校读者我要写书评

暂无评论

DPM: A novel distributed large-scale social graph processing framework for link prediction algorithms

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 78卷 474-480页

作者： Corbellini, Alejandro Godoy, Daniela Mateos, Cristian Schiaffino, Silvia Zunino, Alejandro UNICEN ISISTAN CONICET Paraje Arroyo Seco Campus Univ RA-7000 Buenos Aires DF Argentina

Large-scale graphs have become ubiquitous in social media. Computer-based recommendations in these huge graphs pose challenges in terms of algorithm design and resource usage efficiency when processing recommendations in distributed computing environments. Moreover, recommendation algorithms for graphs, particularly link prediction algorithms, have different requirements depending of the way the underlying graph is traversed. Path-based algorithms usually perform traversals in different directions to build a large ranking of vertices to recommend, whereas random walk-based algorithms build an initial subgraph and perform several iterations on those vertices to compute the final ranking. In this work, we propose a distributed graph processing framework called Distributed Partitioned Merge (DPM), which supports both types of algorithms and we compare its performance and resource usage w.r.t. two relevant frameworks, namely Fork-Join and Pregel. In our experiments, we show that in most tests DPM outperforms both Pregel and Fork-Join in terms of recommendation time, with a minor penalization in network usage in some scenarios. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Distributed graph processing recommendation algorithms Online Social Networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：