Sciweavers

731 search results - page 10 / 147
» Taxonomy-superimposed graph mining
Sort
View
BMCBI
2008
208views more  BMCBI 2008»
13 years 7 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 9 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen