Sciweavers

5608 search results - page 1058 / 1122
» On the Theory of Matchgate Computations
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 1 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 1 months ago
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, ...
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 1 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
16 years 1 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
POPL
2003
ACM
16 years 1 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
« Prev « First page 1058 / 1122 Last » Next »