Sciweavers

148 search results - page 21 / 30
» Mining top-K frequent itemsets from data streams
Sort
View
CIKM
2006
Springer
14 years 9 days 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...
ACSW
2004
13 years 10 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
ICDM
2009
IEEE
141views Data Mining» more  ICDM 2009»
14 years 3 months ago
Discovering Excitatory Networks from Discrete Event Streams with Applications to Neuronal Spike Train Analysis
—Mining temporal network models from discrete event streams is an important problem with applications in computational neuroscience, physical plant diagnostics, and human-compute...
Debprakash Patnaik, Srivatsan Laxman, Naren Ramakr...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 9 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
2003
IEEE
160views Data Mining» more  ICDM 2003»
14 years 1 months 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