Sciweavers

12519 search results - page 2276 / 2504
» Approximation Problems Categories
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 5 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
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 5 months ago
A hit-miss model for duplicate detection in the WHO drug safety database
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
Andrew Bate, G. Niklas Norén, Roland Orre
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 5 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 5 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
KDD
2004
ACM
108views Data Mining» more  KDD 2004»
16 years 5 months ago
Sleeved coclustering
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...
Avraham A. Melkman, Eran Shaham
« Prev « First page 2276 / 2504 Last » Next »