Sciweavers

728 search results - page 22 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
13 years 12 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
KDD
2012
ACM
226views Data Mining» more  KDD 2012»
11 years 10 months ago
TourViz: interactive visualization of connection pathways in large graphs
We present TOURVIZ, a system that helps its users to interactively visualize and make sense in large network datasets. In particular, it takes as input a set of nodes the user spe...
Duen Horng Chau, Leman Akoglu, Jilles Vreeken, Han...
SSD
1997
Springer
140views Database» more  SSD 1997»
13 years 11 months ago
Spatial Data Mining: A Database Approach
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
CIKM
2009
Springer
13 years 11 months ago
Mining data streams with periodically changing distributions
Dynamic data streams are those whose underlying distribution changes over time. They occur in a number of application domains, and mining them is important for these applications....
Yingying Tao, M. Tamer Özsu
IJIT
2004
13 years 9 months ago
IMDC: An Image-Mapped Data Clustering Technique for Large Datasets
In this paper, we present a new algorithm for clustering data in large datasets using image processing approaches. First the dataset is mapped into a binary image plane. The synthe...
Faruq A. Al-Omari, Nabeel I. Al-Fayoumi