Bisociative discovery of interesting relations between domains

Authors:
Uwe Nagel;Kilian Thiel;Tobias Kötter;Dawid Piatek;Michael R. Berthold
Affiliations:
Dept. of Computer and Information Science, University of Konstanz;Dept. of Computer and Information Science, University of Konstanz;Dept. of Computer and Information Science, University of Konstanz;Dept. of Computer and Information Science, University of Konstanz;Dept. of Computer and Information Science, University of Konstanz
Venue:
IDA'11 Proceedings of the 10th international conference on Advances in intelligent data analysis X
Year:
2011

Citing 4
Cited 3

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

Bisociative knowledge discovery

IDA'11 Proceedings of the 10th international conference on Advances in intelligent data analysis X
Fitness in evolutionary art and music: what has been used and what could be used?

EvoMUSART'12 Proceedings of the First international conference on Evolutionary and Biologically Inspired Music, Sound, Art and Design
From information networks to bisociative information networks

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 can otherwise not be accomplished. 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.