Towards discovery of subgraph bisociations

Authors:
Uwe Nagel;Kilian Thiel;Tobias Kötter;Dawid Piątek;Michael R. Berthold
Affiliations:
Nycomed-Chair for Bioinformatics and Information Mining, Dept. of Computer and Information Science, University of Konstanz, Germany;Nycomed-Chair for Bioinformatics and Information Mining, Dept. of Computer and Information Science, University of Konstanz, Germany;Nycomed-Chair for Bioinformatics and Information Mining, Dept. of Computer and Information Science, University of Konstanz, Germany;Nycomed-Chair for Bioinformatics and Information Mining, Dept. of Computer and Information Science, University of Konstanz, Germany;Nycomed-Chair for Bioinformatics and Information Mining, Dept. of Computer and Information Science, University of Konstanz, Germany
Venue:
Bisociative Knowledge Discovery
Year:
2012

Citing 6
Cited 3

Fast hierarchical clustering and other applications of dynamic closest pairs

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Community-Based Recommendation System to Reveal Unexpected Interests

MMM '05 Proceedings of the 11th International Multimedia Modelling Conference
Mining Graph Data

Mining Graph Data
TANGENT: a novel, 'Surprise me', recommendation algorithm

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Pure spreading activation is pointless

Proceedings of the 18th ACM conference on Information and knowledge management
Node Similarities from Spreading Activation

ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining

Towards bisociative knowledge discovery

Bisociative Knowledge Discovery
From information networks to bisociative information networks

Bisociative Knowledge Discovery
Network analysis: overview

Bisociative Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

The discovery of surprising relations in large, heterogeneous information repositories is gaining increasing importance in real world data analysis. If these repositories come from diverse origins, forming different domains, domain bridging associations between otherwise weakly connected domains can provide insights into the data that are not accomplished by aggregative approaches. In this paper, we propose a first formalization for the detection of such potentially interesting, domain-crossing relations based purely on structural properties of a relational knowledge description.