Sciweavers

1836 search results - page 91 / 368
» Mining Clustering Dimensions
Sort
View
KDD
2004
ACM
237views Data Mining» more  KDD 2004»
16 years 2 months ago
Bayesian Model-Averaging in Unsupervised Learning From Microarray Data
Unsupervised identification of patterns in microarray data has been a productive approach to uncovering relationships between genes and the biological process in which they are in...
Mario Medvedovic, Junhai Guo
121
Voted
DKE
2006
126views more  DKE 2006»
15 years 1 months ago
FRACTURE mining: Mining frequently and concurrently mutating structures from historical XML documents
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 2 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
ICPP
2005
IEEE
15 years 7 months ago
VLAN-Based Minimal Paths in PC Cluster with Ethernet on Mesh and Torus
In a PC cluster with Ethernet, well-distributed multiple paths among hosts can be obtained by applying VLAN technology. In this paper, we propose VLAN topology sets and path assig...
Tomohiro Otsuka, Michihiro Koibuchi, Akiya Jouraku...
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
15 years 6 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen