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

Solving traveling salesman problem by ant colony optimization algorithm with association rule

Journal of information and Computational Science 2007年第3期4卷 1011-1016页

作者： Gao, Shang Xia, Xiaoyan Zhang, Lei Zhuang, Fengting School of Electronics and Information Jiangsu University of Science and Technology Zhenjiang 212003 China Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou 215006 China

The traveling salesman problem (TSP) is among the most important combinatorial problems. Ant colony optimization (ACO) algorithm is a recently developed algorithm which has been successfully applied to several NP-hard problems, such as traveling salesman problem, quadratic assignment problem and job-shop problem. Association rule (AR) is the key in knowledge in data mining for finding the best data sequence. A new algorithm which integrates ACO and AR is proposed to solve TSP problems. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, the new algorithm is better than ACO.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

3D Representation of Chinese Event Factuality

3D Representation of Chinese Event Factuality

引用

第十五届汉语词汇语义学国际研讨会

作者： CAO Yuan ZHU Qiaoming LI Peifeng School of Computer Science and Technology of Soochow University Key Lab of Computer Information Processing Technology of Jiangsu Province

In general,Chinese event factuality is determined by the specific vocabularies and syntactic structures of *** Chinese event factuality corpus is to annotate these specific vocabularies and syntactic *** these information is raw and complex,it will result in high computation complexity and low correct rate if we use these information to compute factuality *** paper proposes a 3D representation of Chinese event factuality based on the annotated factual information in a Chinese event factuality *** also presents the transformation rules between the factual information and 3D representation and those between the 3D representation and event *** experimental results demonstrate the effectiveness of our 3D representation.

关键词： Representation of Chinese Event Factuality

来源：评论

学校读者我要写书评

暂无评论

An efficient strategy for enhancing robustness and immunization in wireless sensor networks

引用

Journal of Networks 2009年第3期4卷 170-177页

作者： Shu-Kui, Zhang Sheng-Rong, Gong Zhi-Ming, Cui Quan, Liu Institute of Computer Science and Technology Soochow University Suzhou 215006 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou 215006 China

To provide cost-effective protection for sensor networks, We introduce an immunization method where the percentage of required vaccinations for immunity are close to the optimal value of a targeted immunization scheme. Our strategy retains the advantage of being purely local, without the need of knowledge on the global network structure. The method consists of selecting the vertex with the highest degree within a distance d and asking for a neighbor that has more links than himself or more than a given threshold and immunizing him. Analysis and simulation results show that the above method is valid. It enhances network robustness against virus and provide useful hints in the search of optimal immunization strategies as the development and deploying of a sensor network system. © 2009 ACADEMY PUBLISHER.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Research on improved coding and decoding algorithm for fountain codes

Research on improved coding and decoding algorithm for fount...

引用

International Conference on Wireless Communications and Signal processing (WCSP)

作者： Zhifeng Zhu Liulei Zhou Jia Hou School of Electronics and Information Engineering Soochow University Jiangsu China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Jiangsu China

ISBN: (纸本)9781479973408

Fountain code is a class of graph-based linear erasure codes, which can effectively solve the problems such as network congestion and feedback cracking for its characteristics of rateless and can resume when interrupted, and has a lower complexity of encoding and decoding. However, there are still some problems in the process of encoding and decoding, including the degree distribution structure may be destroyed, parameters of the generating matrix are not fixed, and it cannot recover source datas from the remaining encoded packets with no degree one. So, the basic theory of fountain codes from three aspects are introduced in this paper, i.e., degree distribution, encoding and decoding principles. Therefore the improved algorithms according to the above three aspects are presented. Simulation results show that the proposed algorithm is more efficient than the previous one.

关键词： Decoding Encoding Algorithm design and analysis Solitons Robustness Vectors Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Advances in Data and Web Management 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Qing Li Ling Feng Jian Pei Sean X. Wang Xiaofang Zhou Qiao-Ming Zhu

ISBN: (数字)9783642006722

ISBN: (纸本)9783642006715

This book constitutes the proceedings of the joint International Conference APWeb/WAIM 2009 which was held in Suzhou, China, during April 1-4, 2009. The 42 full papers presented together with 26 short papers and the abstracts of 2 keynote speeches were carefully reviewed and selected for inclusion in the book. The topics covered are query processing, topic-based techniques, Web data processing, multidimensional data analysis, stream data processing, data mining and its applications, and data management support to advanced applications.

关键词： computer Communication Networks Data Mining and Knowledge Discovery information Systems Applications (incl. Internet) information Storage and Retrieval Pattern Recognition information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT ONLINE labEL CONSISTENT HASHING FOR LARGE-SCALE CROSS-MODAL RETRIEVAL

EFFICIENT ONLINE LABEL CONSISTENT HASHING FOR LARGE-SCALE CR...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Yi, Jinhan Liu, Xin Cheung, Yiu-Ming Xu, Xing Fan, Wentao He, Yi Department of Computer Science and Technology Huaqiao University Xiamen361021 China Xiamen Key Lab. of Computer Vision and Pattern Recognition Fujian Key Lab. of Big Data Intelligence and Security China Department of Computer Science Hong Kong Baptist University Kowloon Hong Kong School of Computer Science and Engineering University of Electronic Science and Technology of China China Provincial Key Laboratory for Computer Information Processing Technology Soochow University China

ISBN: (纸本)9781665438643

Existing cross-modal hashing still faces three challenges: (1) Most batch-based methods are unsuitable for processing large-scale and streaming data. (2) Current online methods often suffer from insufficient semantic association, while lacking flexibility to learn the hash functions for varying streaming data. (3) Existing supervised methods always require much computation time or accumulate large quantization loss to learn hash codes. To address above challenges, we present an efficient Online label Consistent Hashing (OLCH) for cross-modal retrieval, which aims to incrementally learn hash codes for the current arriving data, while updating the hash functions at a streaming manner. To be specific, an online semantic representation learning framework is designed to adaptively preserve the semantic similarity across different modalities, and a mini-batch online gradient descent approach associated with forward-backward splitting is developed to optimize the hash functions. Accordingly, the hash codes are adaptively learned online with the high discriminative capability, while avoiding high computation complexity to process the streaming data. Experimental results show its outstanding performance in comparison with the-state-of-arts. © 2021 IEEE computer Society. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Multi-level threshold image segmentation based on PSNR using artificial bee colony algorithm

引用

Research Journal of Applied Sciences, Engineering and technology 2012年第2期4卷 104-107页

作者： Yun-Fei, Cao Yong-Hao, Xiao Wei-Yu, Yu Yong-Chang, Chen School of Electronic and Information Engineering South China University of Technology Guangzhou China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou Jiangsu 215006 China

Image segmentation is still a crucial problem in image processing. It hasn yet been solved very well. In this study, we propose a novel multi-level thresholding image segmentation method based on PSNR using artificial bee colony algorithm (ABCA). PSNR is considered as an objective function of ABCA. The multi-level thresholds (t*1, t*2 ,...., t*n-1, t*n) are those maximizing the PSNR. We compare entropy and PSNR in segmenting gray-level images. The experiments results demonstrate proposed method is effective and efficient. © Maxwell Scientific Organization, 2012.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

An evolution-based robust social influence evaluation method in Online Social Networks

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8787卷 141-157页

作者： Zhu, Feng Liu, Guanfeng Liu, An Zhao, Lei Zhou, Xiaofang School of Computer Science and Technology Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou215006 China School of Information Technology and Electrical Engineering University of Queensland Brisbane4072 Australia

Online Social Networks (OSNs) are becoming popular and attracting lots of participants. In OSN based e-commerce platforms, a buyer’s review of a product is one of the most important factors for other buyers’ decision makings. A buyer who provides high quality reviews thus has strong social influence, and can impact a large number of participants’ purchase behaviours in OSNs. However, the dishonest participants can cheat the existing social influence evaluation models by using some typical attacks, like Constant and Camouflage, to obtain fake strong social influence. Therefore, it is significant to accurately evaluate such social influence to recommend the participants who have strong social influences and provide high quality product reviews. In this paper, we propose an Evolutionary-Based Robust Social Influence (EB-RSI) method based on the trust evolutionary models. In our EB-RSI, we propose four influence impact factors in social influence evaluation, i.e., Total Trustworthiness (TT), Fluctuant Trend of Being Advisor (FTBA), Fluctuant Trend of Trustworthiness (FTT) and Trustworthiness Area (TA). They are all significant in the influence evaluation. We conduct experiments onto a real social network dataset Epinions, and validate the effectiveness and robustness of our EB-RSI by comparing with state-of-the-art method, SoCap. The experimental results demonstrate that our EB-RSI can more accurately evaluate participants’ social influence than SoCap. © Springer International Publishing Switzerland 2014.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Application of learning Vector quantization network on web pages classification in agricultural website

引用

Journal of information and Computational Science 2009年第1期6卷 139-145页

作者： Fu, Zetian Wang, Chuanyi Zhao, Ming Liu, Lixin Zhang, Xiaoshuan China Agricultural University Beijing 100083 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University Suzhou 215000 China

VQ (Learning Vector Quantization) is kind of supervised and competitive learning artificial neural network and adopted in many domains, such as pattern categorization, products classification, mechanical detection. This paper proposes a new application, which integrates LVQ network with Central Vector classification method on agricultural products web pages classification as key function of the vertical search engine. The experiment shows that LVQ has higher precision compared with CPN network and the precision increases more quickly with the increasing of training numbers. © 2009 Binary information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Make your choice for multimodal knowledge graph completion

引用

Knowledge-Based Systems 2025年 323卷

作者： Yifan Xue Shuoyan Ren Wanqiang Cai Yingyao Ma Lotfi Senhadji Huazhong Shu Jiasong Wu Laboratory of Image Science and Technology Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education Nanjing 210096 China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing Southeast University Nanjing 210096 China School of Artificial Intelligence and Computer Science Jiangnan University Wuxi 214122 China Univ Rennes INSERM LTSI - UMR 1099 F-35000 Rennes France Centre de Recherche en Information Biomédicale Sino-français (CRIBs) Univ Rennes INSERM F-35000 Rennes France

Knowledge graph completion (KGC) aims to predict missing entities in knowledge graphs by learning effective representations of entities and their relations. Recent advances have explored multimodal KGC by incorporating structural, textual, and visual information. However, two critical challenges remain unresolved: (1) modal heterogeneity, where significant differences in feature distributions across modalities hinder effective fusion; and (2) spatial heterogeneity, where embedding knowledge graphs in a single geometric space fails to capture their complex topological structures. To address these challenges, we propose ChoicE, a unified framework that leverages a mixture of experts (MoE) design for both encoding and decoding. In the encoder, the multimodal chooser preprocesses multiple modalities to derive embedding representations for each modality. These representations are then processed by distinct experts specialized for structural, textual, and visual features, facilitating effective fusion while preserving modality-specific information. In the decoder, the geometric chooser projects the unified multimodal embeddings into Euclidean, complex, or hyperbolic space, dynamically selecting the most appropriate space to model the inference patterns inherent to each query. Extensive experiments on multiple benchmark datasets demonstrate that ChoicE effectively overcomes these dilemmas and achieves state-of-the-art performance in multimodal KGC. The data and code are released at https://***/r/ChiocE-master/ .

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：