Sciweavers

1913 search results - page 256 / 383
» Using Data Mining in MURA Graphic Problems
Sort
View
WWW
2002
ACM
16 years 4 months ago
Probabilistic query expansion using query logs
Query expansion has long been suggested as an effective way to resolve the short query and word mismatching problems. A number of query expansion methods have been proposed in tra...
Hang Cui, Ji-Rong Wen, Jian-Yun Nie, Wei-Ying Ma
124
Voted
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
16 years 4 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
132
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
118
Voted
ICDM
2007
IEEE
192views Data Mining» more  ICDM 2007»
15 years 10 months ago
Discovering Temporal Communities from Social Network Documents
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
Ding Zhou, Isaac G. Councill, Hongyuan Zha, C. Lee...
137
Voted
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
15 years 1 months ago
Learning an Affine Transformation for Non-linear Dimensionality Reduction
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcomin...
Pooyan Khajehpour Tadavani, Ali Ghodsi