Sciweavers

396 search results - page 59 / 80
» Efficient Mining of Spatiotemporal Patterns
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
IEAAIE
2009
Springer
14 years 4 months ago
Incremental Mining of Ontological Association Rules in Evolving Environments
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
Ming-Cheng Tseng, Wen-Yang Lin
VLDB
1998
ACM
112views Database» more  VLDB 1998»
14 years 1 months ago
Incremental Clustering for Mining in a Data Warehousing Environment
Data warehouses provide a great deal of opportunities for performing data mining tasks such as classification and clustering. Typically, updates are collected and applied to the d...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 11 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 1 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar