| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
16 February 2025 |
|
| | | |
|
Article overview
| |
|
Parallel Clustering of Graphs for Anonymization and Recommender Systems | Frederic Prost
; Jisang Yoon
; | Date: |
1 Sep 2016 | Abstract: | Graph clustering is widely used in many data analysis applications. In this
paper we propose several parallel graph clustering algorithms based on Monte
Carlo simulations and expectation maximization in the context of stochastic
block models. We apply those algorithms to the specific problems of recommender
systems and social network anonymization. We compare the experimental results
to previous propositions. | Source: | arXiv, 1609.0161 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|