Sciweavers

5046 search results - page 896 / 1010
» Non-redundant data clustering
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 8 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
BMCBI
2006
144views more  BMCBI 2006»
13 years 8 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...
BMCBI
2007
166views more  BMCBI 2007»
13 years 8 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
CVIU
2007
174views more  CVIU 2007»
13 years 8 months ago
Laser-based detection and tracking of multiple people in crowds
Laser-based people tracking systems have been developed for mobile robotic, and intelligent surveillance areas. Existing systems rely on laser point clustering method to extract o...
Jinshi Cui, Hongbin Zha, Huijing Zhao, Ryosuke Shi...
IDA
2007
Springer
13 years 8 months ago
Removing biases in unsupervised learning of sequential patterns
Unsupervised sequence learning is important to many applications. A learner is presented with unlabeled sequential data, and must discover sequential patterns that characterize th...
Yoav Horman, Gal A. Kaminka