Sciweavers

49 search results - page 2 / 10
» An Apriori-Based Algorithm for Mining Frequent Substructures...
Sort
View
ICTAI
2007
IEEE
13 years 11 months ago
A Probabilistic Substructure-Based Approach for Graph Classification
The classification of graph based objects is an important challenge from a knowledge discovery standpoint and has attracted considerable attention recently. In this paper, we pres...
H. D. K. Moonesinghe, Hamed Valizadegan, Samah Jam...
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
13 years 10 months ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
DASFAA
2005
IEEE
153views Database» more  DASFAA 2005»
13 years 10 months ago
FASST Mining: Discovering Frequently Changing Semantic Structure from Versions of Unordered XML Documents
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
Qiankun Zhao, Sourav S. Bhowmick
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
13 years 11 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 5 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang