A novel probabilistic clustering model for heterogeneous networks
From MaRDI portal
Publication:1689548
DOI10.1007/s10994-016-5544-1zbMath1454.62195OpenAlexW2291317804MaRDI QIDQ1689548
Publication date: 12 January 2018
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5544-1
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic graphical models (62H22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Algorithm AS 136: A K-Means Clustering Algorithm
- Managing and mining graph data
- Introduction to Information Retrieval
- An Efficient Heuristic Procedure for Partitioning Graphs
- Factor graphs and the sum-product algorithm
- Community structure in social and biological networks
- 10.1162/jmlr.2003.3.4-5.993
- Historical Development of the Newton–Raphson Method
- Exploring and inferring user–user pseudo‐friendship for sentiment analysis with heterogeneous networks
This page was built for publication: A novel probabilistic clustering model for heterogeneous networks