Sciweavers

1390 search results - page 34 / 278
» Self-Sizing of Clustered Databases
Sort
View
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
14 years 6 months ago
CORE: Nonparametric Clustering of Large Numeric Databases.
Current clustering techniques are able to identify arbitrarily shaped clusters in the presence of noise, but depend on carefully chosen model parameters. The choice of model param...
Andrej Taliun, Arturas Mazeika, Michael H. Bö...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
14 years 13 days ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
BMCBI
2010
136views more  BMCBI 2010»
13 years 9 months ago
SCPS: a fast implementation of a spectral method for detecting protein families on a genome-wide scale
Background: An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed...
Tamás Nepusz, Rajkumar Sasidharan, Alberto ...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
14 years 17 days ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
14 years 10 months ago
Cluster Hull: A Technique for Summarizing Spatial Data Streams
John Hershberger, Nisheeth Shrivastava, Subhash Su...