Sciweavers

85 search results - page 5 / 17
» Efficient incremental constrained clustering
Sort
View
TKDE
2012
245views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
13 years 11 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny
CAD
2010
Springer
13 years 7 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
TCAD
2008
92views more  TCAD 2008»
13 years 7 months ago
IP Watermarking Using Incremental Technology Mapping at Logic Synthesis Level
Abstract--This paper proposes an adaptive watermarking technique by modulating some closed cones in an originally optimized logic network (master design) for technology mapping. Th...
Aijiao Cui, Chip-Hong Chang, Sofiène Tahar
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
14 years 8 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...