Review of bisonet abstraction techniques

Authors:
Fang Zhou;Sébastien Mahler;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;Department of Computer Science and Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland
Venue:
Bisociative Knowledge Discovery
Year:
2012

Citing 45
Cited 3

A Partitioning Strategy for Nonuniform Problems on Multiprocessors

IEEE Transactions on Computers
Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
An improved spectral graph partitioning algorithm for mapping parallel computations

SIAM Journal on Scientific Computing
CLIP: concept learning from inference patterns

Artificial Intelligence - Special issue: AI research in Japan
A multilevel algorithm for partitioning graphs

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
Geometric Separators for Finite-Element Meshes

SIAM Journal on Scientific Computing
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
A graph distance metric combining maximum common subgraph and minimum common supergraph

Pattern Recognition Letters
Topic-sensitive PageRank

Proceedings of the 11th international conference on World Wide Web
Improvement of HITS-based algorithms on web documents

Proceedings of the 11th international conference on World Wide Web
Algorithmics and applications of tree and graph searching

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Frequent Subgraph Discovery

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data

PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Scaling personalized web search

WWW '03 Proceedings of the 12th international conference on World Wide Web
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Algorithms for estimating relative importance in networks

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
CloseGraph: mining closed frequent graph patterns

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Graph indexing: a frequent structure-based approach

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Fast discovery of connection subgraphs

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
SPIN: mining maximal frequent subgraphs from graph databases

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
An Efficient Algorithm for Discovering Frequent Subgraphs

IEEE Transactions on Knowledge and Data Engineering
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
Substructure similarity search in graph databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Finding Frequent Patterns in a Large Sparse Graph*

Data Mining and Knowledge Discovery
Discovering informative connection subgraphs in multi-relational graphs

ACM SIGKDD Explorations Newsletter
Closure-Tree: An Index Structure for Graph Queries

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Searching Substructures with Superimposed Distance

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Center-piece subgraphs: problem definition and fast solutions

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
SAGA: a subgraph matching tool for biological graphs

Bioinformatics
Compressing probabilistic Prolog programs

Machine Learning
Subgraph Support in a Single Large Graph

ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Finding reliable subgraphs from large probabilistic graphs

Data Mining and Knowledge Discovery
TALE: A Tool for Approximate Large Graph Matching

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Substructure discovery using minimum description length and background knowledge

Journal of Artificial Intelligence Research
ProbLog: a probabilistic prolog and its application in link discovery

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
What is frequent in a single graph?

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in 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
Towards creative information exploration based on koestler's concept of bisociation

Bisociative Knowledge Discovery

Network analysis: overview

Bisociative Knowledge Discovery
Simplification of networks by edge pruning

Bisociative Knowledge Discovery
Network compression by node and edge mergers

Bisociative Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

BisoNets represent relations of information items as networks. The goal of BisoNet abstraction is to transform a large BisoNet into a smaller one which is simpler and easier to use, although some information may be lost in the abstraction process. An abstracted BisoNet can help users to see the structure of a large BisoNet, or understand connections between distant nodes, or discover hidden knowledge. In this paper we review different approaches and techniques to abstract a large BisoNet. We classify the approaches into two groups: preference-free methods and preference-dependent methods.