Sciweavers

2383 search results - page 61 / 477
» Finding Representative Set from Massive Data
Sort
View
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
15 years 2 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
NAR
2006
88views more  NAR 2006»
14 years 10 months ago
PupaSuite: finding functional single nucleotide polymorphisms for large-scale genotyping purposes
We have developed a web tool, PupaSuite, for the selection of single nucleotide polymorphisms (SNPs) with potential phenotypic effect, specifically oriented to help in the design ...
Lucía Conde, Juan M. Vaquerizas, Hern&aacut...
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
15 years 4 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
ICAIL
2009
ACM
15 years 4 months ago
Integrating induction and deduction for finding evidence of discrimination
Automatic Decision Support Systems (DSS) are widely adopted for screening purposes in socially sensitive tasks, including access to credit, mortgage, insurance, labor market and o...
Dino Pedreschi, Salvatore Ruggieri, Franco Turini
APBC
2008
231views Bioinformatics» more  APBC 2008»
14 years 11 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...