QQ客服 官方微博 反馈留言

	Detecting the fuzzy clusters of complex networks
	Liu, Jian
	2010
关键词	Fuzzy clusters Optimal prediction k-Means Fuzzy c-means Steepest descent Conjugate gradient Projection AUTOMATED MODEL SELECTION COMMUNITY STRUCTURE GAUSSIAN MIXTURE
英文摘要	To find the best partition of a large and complex network into a small number of clusters has been addressed in many different ways. However, the probabilistic setting in which each node has a certain probability of belonging to a certain cluster has been scarcely discussed. In this paper, a fuzzy partitioning formulation, which is extended from a deterministic framework for network partition based on the optimal prediction of a random walker Markovian dynamics, is derived to solve this problem. The algorithms are constructed to minimize the objective function under this framework. It is demonstrated by the simulation experiments that our algorithms can efficiently determine the probabilities with which a node belongs to different clusters during the learning process. Moreover, they are successfully applied to two real-world networks, including the social interactions between members of a karate club and the relationships of some books on American politics bought from Amazon.com. (C) 2009 Elsevier Ltd. All rights reserved.; Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; SCI(E); EI; 3; ARTICLE; 4; 1334-1345; 43
语种	英语
出处	SCI ; EI
出版者	模式识别
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/157674]
专题	数学科学学院
推荐引用方式 GB/T 7714	Liu, Jian. Detecting the fuzzy clusters of complex networks. 2010-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。