Clustering large attributed information networks: an efficient incremental computing approach

DOI10.1007/S10618-012-0263-0MaRDI QIDQ1945001zbMATH OpenOpenAlexFDO

Authors Hong Cheng, Yang Zhou, Xin Huang, Jeffrey Xu Yu

Publication date 28 March 2013

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10618-012-0263-0

zbMATH Keywords

graph clusteringparallel computingincremental computationvertex partitioningedge weightsclustering refinementrandom walk distancesSA-clusterstructural and attribute similaritiesvertex properties

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Clustering analysis in large graphs with rich attributes
• Multiple clusterings of heterogeneous information networks
• scientific article; zbMATH DE number 1559578
• Incremental Clustering and Dynamic Information Retrieval
• A fast and efficient algorithm to identify clusters in networks
• Complex network community detection based on core graph incremental clustering
• Weighted clustering of attributed multi-graphs

Cites work

• Community discovery using nonnegative matrix factorization
• Computing Communities in Large Networks Using Random Walks
• Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
• Gaussian elimination is not optimal
• Random walk with restart: fast solutions and applications

Cited in

(9)

• MapReduce-based graph structural clustering algorithm
• Community detection in node-attributed social networks: a survey
• Weighted clustering of attributed multi-graphs
• Inc-cluster
• SA-cluster
• Efficient clustering of large uncertain graphs using neighborhood information
• A branch-and-price procedure for clustering data that are graph connected
• Clustering analysis in large graphs with rich attributes
• Clustering data that are graph connected

Describes a project that uses

Uses Software

• SimRank
• GraphScope

This page was built for publication: Clustering large attributed information networks: an efficient incremental computing approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945001)