Sciweavers

573 search results - page 30 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
CIKM
2006
Springer
13 years 11 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
14 years 2 months ago
Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
ICDE
2007
IEEE
172views Database» more  ICDE 2007»
14 years 2 months ago
A New Data Cube for Integrating Data Mining and OLAP
Recently there is much need of discovering useful knowledge from massive log-data which are generated by Webbased information systems. Such log-data have multiple attributes about...
Tadashi Ohmori, Masahide Naruse, Mamoru Hoshi
ICDM
2003
IEEE
160views Data Mining» more  ICDM 2003»
14 years 29 days ago
Indexing and Mining Free Trees
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
Yun Chi, Yirong Yang, Richard R. Muntz