Sciweavers

728 search results - page 13 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 7 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
PAMI
2002
135views more  PAMI 2002»
13 years 7 months ago
Density-Based Multiscale Data Condensation
Pabitra Mitra, C. A. Murthy, Sankar K. Pal
DEXA
2003
Springer
147views Database» more  DEXA 2003»
14 years 27 days ago
Context-Aware Data Mining Framework for Wireless Medical Application
Abstract. Data mining, which aims at extracting interesting information from large collections of data, has been widely used as an effective decision making tool. Mining the datas...
Pravin Vajirkar, Sachin Singh, Yugyung Lee
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 8 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
11 years 10 months ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken