Sciweavers

306 search results - page 6 / 62
» Mining tree queries in a graph
Sort
View
KDD
1997
ACM
131views Data Mining» more  KDD 1997»
14 years 23 hour ago
Discovery of Actionable Patterns in Databases: The Action Hierarchy Approach
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
Gediminas Adomavicius, Alexander Tuzhilin
SERP
2004
13 years 9 months ago
Design and Evaluation of an Automated Aspect Mining Tool
Attention to aspect oriented programming (AOP) is rapidly growing as its benefits in large software system development and maintenance are increasingly recognized. However, existin...
David Shepherd, Emily Gibson, Lori L. Pollock
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 5 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
14 years 1 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
DIS
2007
Springer
13 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono