Sciweavers

113 search results - page 10 / 23
» Frequent subgraph pattern mining on uncertain graph data
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 11 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 1 months ago
Direct mining of discriminative patterns for classifying uncertain data
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
Chuancong Gao, Jianyong Wang
EDBT
2009
ACM
138views Database» more  EDBT 2009»
15 years 4 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
DIS
2007
Springer
15 years 1 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
SAC
2008
ACM
14 years 9 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee