Sciweavers

1285 search results - page 55 / 257
» On the Complexity of Ordinal Clustering
Sort
View
COMCOM
2004
81views more  COMCOM 2004»
13 years 8 months ago
A performance anomaly in clustered on-line transaction processing systems
This paper presents a simulation study on complex On-Line Transaction Processing systems using TPC-C workload. The impacts on the response time of Inter-Connection Network (ICN) i...
Hong Cai, Hisao Kameda, Jie Li
AAI
2006
71views more  AAI 2006»
13 years 9 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
ICPP
2000
IEEE
14 years 1 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
BMCBI
2008
160views more  BMCBI 2008»
13 years 9 months ago
A comparison of four clustering methods for brain expression microarray data
Background: DNA microarrays, which determine the expression levels of tens of thousands of genes from a sample, are an important research tool. However, the volume of data they pr...
Alexander L. Richards, Peter Holmans, Michael C. O...
DATAMINE
2006
89views more  DATAMINE 2006»
13 years 9 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh