Sciweavers

104 search results - page 6 / 21
» TRIPS and TIDES: new algorithms for tree mining
Sort
View
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 7 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
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
13 years 11 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
HICSS
2009
IEEE
144views Biometrics» more  HICSS 2009»
14 years 2 months ago
Privacy Preserving Decision Tree Mining from Perturbed Data
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
Li Liu, Murat Kantarcioglu, Bhavani M. Thuraisingh...
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
14 years 7 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha