Sciweavers

1314 search results - page 189 / 263
» Approximate data mining in very large relational data
Sort
View
BMCBI
2005
106views more  BMCBI 2005»
15 years 4 months ago
Thesaurus-based disambiguation of gene symbols
Background: Massive text mining of the biological literature holds great promise of relating disparate information and discovering new knowledge. However, disambiguation of gene s...
Bob J. A. Schijvenaars, Barend Mons, Marc Weeber, ...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 4 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
13 years 7 months ago
Cross-domain collaboration recommendation
Interdisciplinary collaborations have generated huge impact to society. However, it is often hard for researchers to establish such cross-domain collaborations. What are the patte...
Jie Tang, Sen Wu, Jimeng Sun, Hang Su
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
15 years 8 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
IJAIT
2002
122views more  IJAIT 2002»
15 years 4 months ago
Comparing Keyword Extraction Techniques for WEBSOM Text Archives
The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative fre...
Arnulfo P. Azcarraga, Teddy N. Yap Jr., Tat-Seng C...