Sciweavers

1083 search results - page 61 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
AIIA
2005
Springer
15 years 11 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
NAR
2000
103views more  NAR 2000»
15 years 6 months ago
The Homeodomain Resource: a prototype database for a large protein family
The Homeodomain Resource is an annotated collection of non-redundant protein sequences, three-dimensional structures and genomic information for the homeodomain protein family. Re...
Sharmila Banerjee-Basu, Joseph F. Ryan, Andreas D....
PVLDB
2010
195views more  PVLDB 2010»
15 years 28 days ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
ISMB
2000
15 years 7 months ago
Analysis of Gene Expression Microarrays for Phenotype Classification
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
Andrea Califano, Gustavo Stolovitzky, Yuhai Tu
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 6 months ago
Efficient incremental constrained clustering
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
Ian Davidson, S. S. Ravi, Martin Ester