Sciweavers

960 search results - page 72 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
226
Voted
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 4 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
158
Voted
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 4 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
SSD
2007
Springer
131views Database» more  SSD 2007»
15 years 10 months ago
Efficiently Mining Regional Outliers in Spatial Data
With the increasing availability of spatial data in many applications, spatial clustering and outlier detection has received a lot of attention in the database and data mining comm...
Richard Frank, Wen Jin, Martin Ester
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
15 years 8 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
219
Voted
VLDB
2007
ACM
102views Database» more  VLDB 2007»
16 years 4 months ago
Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
Fei Xu, Chris Jermaine