Sciweavers

31 search results - page 5 / 7
» An Iterative Improvement Procedure for Hierarchical Clusteri...
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Adaptive Distance Metric Learning for Clustering
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
Jieping Ye, Zheng Zhao, Huan Liu
INCDM
2007
Springer
69views Data Mining» more  INCDM 2007»
14 years 1 months ago
Simultaneous Co-clustering and Modeling of Market Data
For difficult prediction problems, practitioners often segment the data into relatively homogenous groups and then build a model for each group. This two-step procedure usually res...
Meghana Deodhar, Joydeep Ghosh
BMCBI
2011
12 years 11 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 1 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
CCE
2004
13 years 7 months ago
A decomposition method for synthesizing complex column configurations using tray-by-tray GDP models
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
Mariana Barttfeld, Pío A. Aguirre, Ignacio ...