Sciweavers

319 search results - page 10 / 64
» Algorithms for Mining Distance-Based Outliers in Large Datas...
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 10 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...
BMCBI
2008
114views more  BMCBI 2008»
14 years 10 months ago
Visualization of large influenza virus sequence datasets using adaptively aggregated trees with sampling-based subscale represen
Background: With the amount of influenza genome sequence data growing rapidly, researchers need machine assistance in selecting datasets and exploring the data. Enhanced visualiza...
Leonid Zaslavsky, Yiming Bao, Tatiana A. Tatusova
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 2 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
15 years 4 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
CIKM
2008
Springer
14 years 12 months ago
Suppressing outliers in pairwise preference ranking
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...
Vitor R. Carvalho, Jonathan L. Elsas, William W. C...