Sciweavers

2070 search results - page 355 / 414
» Regret-Minimizing Representative Databases
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 10 months ago
Extracting shared subspace for multi-label classification
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
Shuiwang Ji, Lei Tang, Shipeng Yu, Jieping Ye
KDD
2008
ACM
206views Data Mining» more  KDD 2008»
14 years 10 months ago
Identifying biologically relevant genes via multiple heterogeneous data sources
Selection of genes that are differentially expressed and critical to a particular biological process has been a major challenge in post-array analysis. Recent development in bioin...
Zheng Zhao, Jiangxin Wang, Huan Liu, Jieping Ye, Y...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
14 years 10 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos