Sciweavers

154 search results - page 9 / 31
» Binary clustering
Sort
View
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
14 years 11 months ago
On Privacy-Preservation of Text and Sparse Binary Data with Sketches
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
Charu C. Aggarwal, Philip S. Yu
CAP
2010
14 years 4 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ICC
2009
IEEE
121views Communications» more  ICC 2009»
14 years 7 months ago
Three Layered Hidden Markov Models for Binary Digital Wireless Channels
Abstract--Generative models are created to be used in the design and performance assessment of high layer wireless communication protocols and some error control strategies. Genera...
Omar S. Salih, Cheng-Xiang Wang, David I. Laurenso...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
ECML
2006
Springer
14 years 11 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev