Sciweavers

195 search results - page 21 / 39
» Clustering-Based K-Anonymisation Algorithms
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Multi-stage branch-and-bound for maximum variance disparity clustering
A split-and-merge framework based on a maximum variance criterion is proposed for disparity clustering. The proposed algorithm transforms low-level stereo disparity information to...
Ninad Thakoor, Venkat Devarajan, Jean Gao
74
Voted
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 3 months ago
Identifying valid solutions for the inference of regulatory networks
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. The problem often is multi-modal and therefore appropriate optimi...
Christian Spieth, Felix Streichert, Nora Speer, An...
IRAL
2003
ACM
15 years 2 months ago
Keyword-based document clustering
1 Document clustering is an aggregation of related documents to a cluster based on the similarity evaluation task between documents and the representatives of clusters. Terms and t...
Seung-Shik Kang
ISCC
1999
IEEE
176views Communications» more  ISCC 1999»
15 years 1 months ago
Image Browsing using Hierarchical Clustering
Digital images and video clips are becoming popular due to the increase in the availability of consumer devices that capture digital images and video clips. Digital content is als...
Santhana Krishnamachari, Mohamed Abdel-Mottaleb
JMLR
2006
108views more  JMLR 2006»
14 years 9 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan