544 search results - page 51 / 109 » Clustering with Instance-level Constraints |
ASPDAC
1999
ACM
14 years 1 days ago
1999
ACM
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
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...
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
The word error rate of any optical character recognition system (OCR) is usually substantially below its component or character error rate. This is especially true of Indic langua...