Sciweavers

679 search results - page 32 / 136
» Scaling Clustering Algorithms to Large Databases
Sort
View
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
15 years 11 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 10 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
CIDR
2011
252views Algorithms» more  CIDR 2011»
14 years 9 months ago
Hyder - A Transactional Record Manager for Shared Flash
Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool ...
Philip A. Bernstein, Colin W. Reid, Sudipto Das
IPPS
2007
IEEE
16 years 6 days ago
Bi-criteria Scheduling Algorithm with Deployment in Cluster
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...
Feryal-Kamila Moulaï, Gregory Mounie
KDD
2004
ACM
285views Data Mining» more  KDD 2004»
15 years 11 months ago
Effective localized regression for damage detection in large complex mechanical structures
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...