A novel probabilistic clustering model for heterogeneous networks
From MaRDI portal
Publication:1689548
Recommendations
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- Algorithm AS 136: A K-Means Clustering Algorithm
- An Efficient Heuristic Procedure for Partitioning Graphs
- Clustering by passing messages between data points
- Community structure in social and biological networks
- Exploring and inferring user–user pseudo‐friendship for sentiment analysis with heterogeneous networks
- Factor graphs and the sum-product algorithm
- Historical Development of the Newton–Raphson Method
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- Introduction to Information Retrieval
- Managing and mining graph data
Cited in
(7)- Multiple clusterings of heterogeneous information networks
- HeteRank: a general similarity measure in heterogeneous information networks by integrating multi-type relationships
- Unsupervised meta-path selection for text similarity measure based on heterogeneous information networks
- IMPROVED CLUSTERING THROUGH HETEROGENEITY IN PREFERENTIAL ATTACHMENT NETWORKS
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE
- Clustering probabilistic graphs using neighbourhood paths
This page was built for publication: A novel probabilistic clustering model for heterogeneous networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689548)