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

arXiv 2024年

作者： Zhang, Zijian Cai, Qingpeng Liu, Ziru Hu, Lantao Liu, Shuchang Zhao, Xiangyu Liu, Qidong Jiang, Peng Yu, Jiaao Zhang, Chunxu Zhao, Hongwei Gai, Kun Jilin University City University of Hong Kong Jilin China Kuaishou Technology Beijing China City University of Hong Kong Hong Kong Xi’an Jiaotong University City University of Hong Kong Xi’an China Jilin University Jilin China Beijing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

Multi-domain recommendation and multi-task recommendation have demonstrated their effectiveness in leveraging common information from different domains and objectives for comprehensive user modeling. Nonetheless, the practical recommendation usually faces multiple domains and tasks simultaneously, which cannot be well-addressed by current methods. To this end, we introduce M3oE, an adaptive Multi-domain Multi-task Mixture-of-Experts recommendation framework. M3oE integrates multi-domain information, maps knowledge across domains and tasks, and optimizes multiple objectives. We leverage three mixture-of-experts modules to learn common, domain-aspect, and task-aspect user preferences respectively to address the complex dependencies among multiple domains and tasks in a disentangled manner. Additionally, we design a two-level fusion mechanism for precise control over feature extraction and fusion across diverse domains and tasks. The framework’s adaptability is further enhanced by applying AutoML technique, which allows dynamic structure optimization. To the best of the authors’ knowledge, our M3oE is the first effort to solve multi-domain multi-task recommendation self-adaptively. Extensive experiments on two benchmark datasets against diverse baselines demonstrate M3oE’s superior performance. The implementation code is available to ensure reproducibility1 Copyright © 2024, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

GPFedRec: Graph-Guided Personalization for Federated Recommendation

arXiv

引用

arXiv 2023年

作者： Zhang, Chunxu Long, Guodong Zhou, Tianyi Zhang, Zijian Yan, Peng Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia UMIACS University of Maryland Maryland United States College of Computer Science and Technology Jilin University City University of Hong Kong China

The federated recommendation system is an emerging AI service architecture that provides recommendation services in a privacy-preserving manner. Using user-relation graphs to enhance federated recommendations is a promising topic. However, it is still an open challenge to construct the user-relation graph while preserving data locality-based privacy protection in federated settings. Inspired by a simple motivation, similar users share a similar vision (embeddings) to the same item set, this paper proposes a novel Graph-guided Personalization for Federated Recommendation (GPFedRec). The proposed method constructs a user-relation graph from user-specific personalized item embeddings at the server without accessing the users' interaction records. The personalized item embedding is locally fine-tuned on each device, and then a user-relation graph will be constructed by measuring the similarity among client-specific item embeddings. Without accessing users' historical interactions, we embody the data locality-based privacy protection of vanilla federated learning. Furthermore, a graph-guided aggregation mechanism is designed to leverage the user-relation graph and federated optimization framework simultaneously. Extensive experiments on five benchmark datasets demonstrate GPFedRec's superior performance. The in-depth study validates that GPFedRec can generally improve existing federated recommendation methods as a plugin while keeping user privacy safe. Code is available to ease reproducibility. Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Iterated fractal based on distance ratio

引用

Ruan Jian Xue Bao/Journal of Software 2006年第SUPPL.期17卷 70-77页

作者： Zhang, Xi-Zhe Lu, Tian-Yang Wang, Zheng-Xuan College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China Department of Computer Science and Technology Harbin Engineering University Harbin 150001 China

The escape time algorithm cannot render the convergence region of mapping, so there are some black regions in escape time fractal. In this paper, a novel method is presented to construct fractal image, which is named the distance ratio iteration method. This method performs iteration on two points and render fractal image by using their distance ratio convergence times. Taking complex mapping z←zα+c as example, the generalized Mandelbrot and Julia sets are constructed based on distance ratio and their visual properties are analyzed. The result fractal image has complex and self-similarity structure in inner convergence region. It is proved that the boundary of distance ratio fractal is the same as M-J set when α>0, and some visual structure of it with various exponent α are discussed. When α<0, the generalized Mandelbrot and Julia set based on distance ratio have some complex structures which M-J set does not have.

关键词： Computer graphics

来源：评论

学校读者我要写书评

暂无评论

Content- and semantic-based progressive multimodal image retrieval

引用

ICIC Express Letters 2011年第1期5卷 201-206页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Zhang, Xiaoli Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Qianjin Avenue Changchun 130012 China Institute of Computer Graphics and Image Processing Dalian Nationalities University Economic and Technological Development Zone Liaohe Road Dalian 116600 China

Image retrieval has been an active research topic due to its great importance in the field of image management, digital library and web searching. However, the performances of the existing approaches, including text-based or content-based image retrieval, are often unsatisfactory. Inspired by text-based image retrieval, we propose semantic-based approach, whose similarity computation is semantic relevance rather than word matching. In this paper, a novel approach of progressive image retrieval based on content and semantic is proposed. The proposed retrieval model overcomes the drawbacks of pure content-based and text-based image retrieval, which exploits the strengths of both semantic- and content-based methods, minimizing their weaknesses. Experiments demonstrate the effectiveness and efficiency of the proposed method for image retrieval. © 2011 ISSN.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient collision detection algorithm based on separating bounding volumes

引用

Ruan Jian Xue Bao/Journal of Software 2008年第SUPPL.期19卷 143-150页

作者： Wang, Yi Li, Wen-Hui Zhang, Zhen-Hua Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

An efficient collision detection method based on separating bounding volume (SBV) is proposed. The positions and shapes of SBVs are determined by the optimal separating support hyper planes of two objects. SBVs not only can efficiently detect the separation of models, but have a high culling ratio when models are intersecting. In order to compute SBVs efficiently, an approximate method using SVM is also put forward and tested. At last in penetration region, a method combined with GPU and SBVs is designed to handle the proximity queries. Experimental results illustrate that SBVs based collision detection algorithm is applicable to exact collision detection for 3D models even without topologies and achieves more efficient and balanced performances in separating, colliding and especially puncturing cases. © 2008 by Journal of Software. All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Biogeography-based optimization for cluster analysis

Biogeography-based optimization for cluster analysis

引用

International Conference on Computer, Communication and computational Sciences, ICCCCS 2016

作者： Wu, Xueyan Wang, Hainan Chen, Zhimin Lu, Zhihai Phillips, Preetha Wang, Shuihua Zhang, Yudong School of Computer Science and Technology Nanjing Normal University NanjingJiangsu210023 China Key Laboratory of Statistical Information Technology & Data Mining State Statistics Bureau ChengduSichuan610225 China School of Computer and Information Engineering Henan Normal University XinxiangHenan453000 China School of Electronic Information Shanghai Dianji University Shanghai200240 China Key Laboratory of Symbolic Computation & Knowledge Engineering of Ministry of Education Jilin University ChangchunJilin130012 China Guangxi Key Laboratory of Manufacturing System & Advanced Manufacturing Technology GuilinGuangxi541004 China School of Natural Sciences and Mathematics Shepherd University ShepherdstownWV25443 United States West Virginia School of Osteopathic Medicine 400 N Lee St LewisburgWV24901 United States Department of Electrical Engineering The City College of New York CUNY New YorkNY10031 United States State Key Lab of CAD & CG Zhejiang University HangzhouZhejiang310027 China Manchester Metropolitan University ManchesterM156BH United Kingdom

ISBN: (纸本)9789811037696

With the aim of resolving the issue of cluster analysis more precisely and validly, a new approach was proposed based on biogeography-based optimization (abbreviated as BBO) algorithm. (Method) First, we reformulated the problem with an optimization model based on the variance ratio criterion (VARAC). Then, BBO was presented to search the optimal solution of the VARAC. There are 400 data of four groups in the experimental dataset, which have the degrees of overlapping of three distinct scales. The first one is nonoverlapping, the second one is partial overlapping, and the last is severely overlapping. BBO algorithm was compared with three different state-of-the-art approaches. We ran every algorithm 20 times. In this experiment, our results demonstrate the maximum VARAC values that can be found by BBO. The conclusion is that BBO is predominant which is extremely quick for the issue of clustering analysis. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Schgt-Im: Influence Maximization for Heterogeneous Networks Based on a Self-Supervised Clustered Heterogeneous Graph Transformer

SSRN

引用

SSRN 2022年

作者： Li, Ying Li, Linlin Liu, Xiangyu Liu, Yijun Li, Qianqian Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Jilin Province Changchun130013 China The Faculty of Science and Engineering University of Nottingham NottinghamNG7 2RD United Kingdom Institutes of Science and Development Chinese Academy of Sciences Beijing100190 China School of Public Policy and Management University of Chinese Academy of Sciences Beijing100190 China

Influence maximization (IM) has drawn considerable attention in recent years. Most existing IM methods focus on homogeneous networks, and do not consider the heterogeneity and the attributes of different types of nodes in heterogeneous networks. However, heterogeneous networks are ubiquitous in real-world and encompass rich semantics and complex structural information. Additionally, the clustering characteristics embedded in a network have a critical and significant impact on the process of information diffusion, which has not been considered in IM models based on heterogeneous networks. To address the challenges posed by the heterogeneity and clustering structure in heterogeneous networks, we propose a novel deep learning framework based on a self-supervised clustered heterogeneous graph transformer for IM in heterogeneous networks, named SCHGT-IM. SCHGT-IM aggregates the heterogeneity and clustering information in heterogeneous networks and includes a clustered cascade (CC) model as an information diffusion model to improve the realism of simulations. We evaluate the performance of SCHGT-IM in comparison with that of state-of-the-art IM models on three academic heterogeneous networks extracted from DBLP dataset. The experimental influence spread results show that SCHGT-IM is superior to five state-of-the-art algorithms and performs effectively in terms of selecting influential seed nodes of different types from heterogeneous networks. © 2022, The Authors. All rights reserved.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Combining Immune with Ant Colony Algorithm for Geometric Constraint Solving

Combining Immune with Ant Colony Algorithm for Geometric Con...

引用

International Workshop on knowledge Discovery and Data Mining (WKDD)

作者： Hua Yuan Yi Li Wenhui Li Kong Zhao Duo Wang Rongqin Yi Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China School of Computer Science & Engineering Changchun University of Technology China Suzhou Top Institute of Information Technology Suzhou China

Geometric constraint problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on ant colony optimization algorithm and the immune system model is proposed to provide solution to the geometric constraints problem. In the new algorithm, affinity calculation process and pheromone trail lying is embedded to maintain diversity and carry out the global search and the local search in many directions rather than one direction around the same individual simultaneously. This new algorithm different with current optimization methods in that it gets the good solution by excluding bad solutions. The experimental results reported here will shed more light into how affects the hybrid algorithm's search power in solving geometric constraint problem.

关键词： Immune system Ant colony optimization Nonlinear equations knowledge engineering Computer science Educational technology Evolutionary computation Data mining Laboratories Computer science education

来源：评论

学校读者我要写书评

暂无评论

Improving helpful actions for contingent planning with enforced observations

引用

Journal of computational Information Systems 2013年第7期9卷 2691-2698页

作者： Wei, Wei Ouyang, Dantong Zhao, Xiangfu Zhang, Liming College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua 321004 China

We tackle the problem of improving the helpful actions technique for contingent planning. A revision of the heuristic computation that rearranges the relaxed planning graph is proposed, where the unreasonable conformant actions can be excluded from the resulting helpful actions collection and replaced with enforced observation to the belief state. Pruning with the improved helpful actions, we consequently cut all the non-branching plans out of the solution space. Experimental results show that our method brings considerable improvements in both of plan quality and runtime efficiency. Copyright © 2013 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Unsupervised key-phrases extraction from scientific papers using domain and linguistic knowledge

Unsupervised key-phrases extraction from scientific papers u...

引用

International Conference on Digital Information Management (ICDIM)

作者： Mikalai Krapivin Maurizio Marchese Andrei Yadrantsau Yanchun Liang Department of Information Engineering and Computer Science University of Trento Italy Department of Computer Science Belarusian State University Minsk Belarus College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University China

The domain of Digital Libraries presents specific challenges for unsupervised information extraction to support both the automatic classification of documents and the enhancement of userspsila navigation in the digital content. In this paper, we propose a combined use of machine learning techniques (i.e. Support Vector Machines) and Natural Language Processing techniques (i.e. Stanford NLP parser) to tackle the problem of unsupervised key-phrases extraction from scientific papers. The proposed method strongly depends on the robust structural properties of a scientific paper as well as on the lexical knowledge that we are able to mine from its text. For the experimental assessment we have use a subset of ACM papers in the Computer Science domain containing 400 documents. Preliminary evaluation of the approach shows promising result that improves - on the same data-set - on state-of-the-art Bayesian learning system KEA from a minimum 27% to a maximum 77% depending on KEA parameters tuning and specific evaluation set. Our assessment is performed by comparison with key-phrases assigned by human experts in the specific domain and freely available through ACM portal.

关键词： Data mining Software libraries Navigation Machine learning Support vector machines Support vector machine classification Natural language processing Robustness Computer science Bayesian methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：