Sciweavers

253 search results - page 37 / 51
» Experiments with patch-based object classification
Sort
View
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
15 years 1 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
ECCV
2006
Springer
15 years 1 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
72
Voted
NIPS
2008
14 years 11 months ago
Unsupervised Learning of Visual Sense Models for Polysemous Words
Polysemy is a problem for methods that exploit image search engines to build object category models. Existing unsupervised approaches do not take word sense into consideration. We...
Kate Saenko, Trevor Darrell
80
Voted
CSDA
2008
128views more  CSDA 2008»
14 years 9 months ago
Assessing agreement of clustering methods with gene expression microarray data
In the rapidly evolving field of genomics, many clustering and classification methods have been developed and employed to explore patterns in gene expression data. Biologists face...
Xueli Liu, Sheng-Chien Lee, George Casella, Gary F...
SIAMIS
2008
93views more  SIAMIS 2008»
14 years 9 months ago
Convex Source Support and Its Application to Electric Impedance Tomography
The aim in electric impedance tomography is to recover the conductivity inside a physical body from boundary measurements of current and voltage. In many situations of practical im...
Martin Hanke, Nuutti Hyvönen, Stefanie Reussw...