Finding representative nodes in probabilistic graphs

Authors:
Laura Langohr;Hannu Toivonen
Affiliations:
Department of Computer Science and Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland;Department of Computer Science and Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland
Venue:
Bisociative Knowledge Discovery
Year:
2012

Citing 11
Cited 1

Mining the network value of customers

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification

SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Multicast Feedback Suppression Using Representatives

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques
Finding Representative Set from Massive Data

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Center-piece subgraphs: problem definition and fast solutions

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Selecting representative examples and attributes by a genetic algorithm

Intelligent Data Analysis
Finding reliable subgraphs from large probabilistic graphs

Data Mining and Knowledge Discovery
Fast approximate spectral clustering

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Link discovery in graphs derived from biological databases

DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences

Network analysis: overview

Bisociative Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the problem of identifying representative nodes in probabilistic graphs, motivated by the need to produce different simple views to large BisoNets. We define a probabilistic similarity measure for nodes, and then apply clustering methods to find groups of nodes. Finally, a representative is output from each cluster. We report on experiments with real biomedical data, using both the k-medoids and hierarchical clustering methods in the clustering step. The results suggest that the clustering based approaches are capable of finding a representative set of nodes.