Sciweavers

104 search results - page 4 / 21
» TRIPS and TIDES: new algorithms for tree mining
Sort
View
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 7 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
14 years 6 months ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 6 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SDM
2010
SIAM
184views Data Mining» more  SDM 2010»
13 years 7 months ago
A Robust Decision Tree Algorithm for Imbalanced Data Sets
We propose a new decision tree algorithm, Class Confidence Proportion Decision Tree (CCPDT), which is robust and insensitive to class distribution and generates rules which are st...
Wei Liu, Sanjay Chawla, David A. Cieslak, Nitesh V...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 6 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà