Sciweavers

555 search results - page 61 / 111
» An Empirical Study on Web Mining of Parallel Data
Sort
View
IPPS
2009
IEEE
16 years 23 days ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
NIPS
2007
15 years 7 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
BMCBI
2008
85views more  BMCBI 2008»
15 years 6 months ago
SPSmart: adapting population based SNP genotype databases for fast and comprehensive web access
Background: In the last five years large online resources of human variability have appeared, notably HapMap, Perlegen and the CEPH foundation. These databases of genotypes with p...
Jorge Amigo, Antonio Salas, Christopher Phillips, ...
204
Voted
BMCBI
2008
141views more  BMCBI 2008»
15 years 6 months ago
Ontology-guided data preparation for discovering genotype-phenotype relationships
Complexity of post-genomic data and multiplicity of mining strategies are two limits to Knowledge Discovery in Databases (KDD) in life sciences. Because they provide a semantic fr...
Adrien Coulet, Malika Smaïl-Tabbone, Pascale ...
ADMA
2009
Springer
145views Data Mining» more  ADMA 2009»
16 years 22 days ago
A Framework for Multi-Objective Clustering and Its Application to Co-Location Mining
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Ricar...