System and method for probabilistic relational clustering
View Patent ↗Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such as Web mining, search marketing, bioinformatics, citation analysis, and epidemiology. A probabilistic model is presented for relational clustering, which also provides a principal framework to unify various important clustering tasks including traditional attributes-based clustering, semi-supervised clustering, co-clustering and graph clustering. The model seeks to identify cluster structures for each type of data objects and interaction patterns between different types of objects. Under this model, parametric hard and soft relational clustering algorithms are provided under a large number of exponential family distributions. The algorithms are applicable to relational data of various structures and at the same time unify a number of state-of-the-art clustering algorithms: co-clustering algorithms, the k-partite graph clustering, and semi-supervised clustering based on hidden Markov random fields.
1. A method of detection of a community in a network, comprising:
automatically optimizing an unsupervised mixed membership relational clustering model based on at least respective relationships between a plurality of interrelated data objects, dependent on different latent classes having respective latent class membership parameters, by maximizing a likelihood function to estimate unknown parameters of a joint probability distribution over latent indicators of the plurality of interrelated data objects having at least one type of data associated with different latent classes, having at least one of respective data object attributes, homogeneous relations between the respective data object and data objects having the same type, and heterogeneous relations between the respective data object and data objects having different types, and observations of the plurality of data object attributes;
clustering the interrelated plurality of data objects according to the optimized unsupervised mixed membership relational clustering model;
wherein the plurality of interrelated data objects comprise a set of web documents, wherein the respective data object attributes comprise a web document text and the relations between respective data objects comprise link information; and
responding to a web search query based on the clustering.
2. The method according to claim 1 , wherein said optimizing comprises iteratively maximizing an expectation function.
3. The method according to claim 1 , wherein the plurality of data objects comprise a comprising plurality of different interrelated types of data associated with respectively different latent classes, having respective data object attributes, homogeneous relations between the respective data object and data objects having the same type, and heterogeneous relations between the respective data object and data objects having different types.
4. The method according to claim 1 , wherein the latent indicators have respective latent class membership parameters generated based on a distribution selected from the group consisting of a multinomial distribution, a Bernoulli distribution, a normal distribution, and an exponential distribution.
5. The method according to claim 1 , wherein the likelihood function is maximized using a posterior computed using the Gibbs sampler.
6. The method according to claim 1 , wherein the clustering comprise using the optimized mixed membership relational clustering model to partition an arbitrarily complex graph involving at least the data object attributes, the homogeneous relations and the heterogeneous relations.
7. A method of detection of a community in a network, comprising:
automatically optimizing an unsupervised mixed membership relational clustering model based on at least respective relationships between a plurality of interrelated data objects, dependent on different latent classes having respective latent class membership parameters, by maximizing a likelihood function to estimate unknown parameters of a joint probability distribution over latent indicators of the plurality of interrelated data objects having at least one type of data associated with different latent classes, having at least one of respective data object attributes, homogeneous relations between the respective data object and data objects having the same type, and heterogeneous relations between the respective data object and data objects having different types, and observations of the plurality of data object attributes;
clustering the interrelated plurality of data objects according to the optimized unsupervised mixed membership relational clustering model;
wherein the plurality of interrelated data objects comprise a set of media objects; and
providing a media recommendation based on the clustering.
8. The method according to claim 7 , wherein said optimizing comprises iteratively maximizing an expectation function.
9. The method according to claim 7 , wherein the plurality of data objects comprise a comprising plurality of different interrelated types of data associated with respectively different latent classes, having respective data object attributes, homogeneous relations between the respective data object and data objects having the same type, and heterogeneous relations between the respective data object and data objects having different types.
10. The method according to claim 7 , wherein the latent indicators have respective latent class membership parameters generated based on a distribution selected from the group consisting of a multinomial distribution, a Bernoulli distribution, a normal distribution, and an exponential distribution.
11. The method according to claim 7 , wherein the likelihood function is maximized using a posterior computed using the Gibbs sampler.
12. The method according to claim 7 , wherein the clustering comprise using the optimized mixed membership relational clustering model to partition an arbitrarily complex graph involving at least the data object attributes, the homogeneous relations and the heterogeneous relations.
13. The method according to claim 7 , wherein the data object attributes of the media data objects comprise actor names.
14. A method of detection of a community in a network, comprising:
automatically optimizing an unsupervised mixed membership relational clustering model based on at least respective relationships between a plurality of interrelated data objects, dependent on different latent classes having respective latent class membership parameters, by maximizing a likelihood function to estimate unknown parameters of a joint probability distribution over latent indicators of the plurality of interrelated data objects having at least one type of data associated with different latent classes, having at least one of respective data object attributes, homogeneous relations between the respective data object and data objects having the same type, and heterogeneous relations between the respective data object and data objects having different types, and observations of the plurality of data object attributes; clustering the interrelated plurality of data objects according to the optimized unsupervised mixed membership relational clustering model;
wherein the plurality of interrelated data objects comprise a set of social network data objects, and relations comprise social links; and
detecting a social community within the social network data objects, based on the clustering.
15. The method according to claim 14 , wherein said optimizing comprises iteratively maximizing an expectation function.
16. The method according to claim 14 , wherein the plurality of data objects comprise a comprising plurality of different interrelated types of data associated with respectively different latent classes, having respective data object attributes, homogeneous relations between the respective data object and data objects having the same type, and heterogeneous relations between the respective data object and data objects having different types.
17. The method according to claim 14 , wherein the latent indicators have respective latent class membership parameters generated based on a distribution selected from the group consisting of a multinomial distribution, a Bernoulli distribution, a normal distribution, and an exponential distribution.
18. The method according to claim 14 , wherein the likelihood function is maximized using a posterior computed using the Gibbs sampler.
19. The method according to claim 14 , wherein the clustering comprise using the optimized mixed membership relational clustering model to partition an arbitrarily complex graph involving at least the data object attributes, the homogeneous relations and the heterogeneous relations.
20. The method according to claim 12 , wherein the social network data comprises Facebook pages.