Sciweavers

1509 search results - page 147 / 302
» Identifying Objects Using Cluster and Concept Analysis
Sort
View
144
Voted
EDBT
2008
ACM
178views Database» more  EDBT 2008»
16 years 3 months ago
An inductive database and query language in the relational model
In the demonstration, we will present the concepts and an implementation of an inductive database ? as proposed by Imielinski and Mannila ? in the relational model. The goal is to...
Lothar Richter, Jörg Wicker, Kristina Kessler...
ICCV
2005
IEEE
16 years 5 months ago
Creating Efficient Codebooks for Visual Recognition
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and...
Bill Triggs, Frédéric Jurie
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
16 years 3 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
BMCBI
2006
213views more  BMCBI 2006»
15 years 3 months ago
CoXpress: differential co-expression in gene expression data
Background: Traditional methods of analysing gene expression data often include a statistical test to find differentially expressed genes, or use of a clustering algorithm to find...
Michael Watson
137
Voted
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
15 years 6 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...