Sciweavers

484 search results - page 48 / 97
» Measuring the Quality of Approximated Clusterings
Sort
View
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
16 years 2 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
ICCV
2005
IEEE
16 years 3 months ago
Local Features for Object Class Recognition
In this paper we compare the performance of local detectors and descriptors in the context of object class recognition. Recently, many detectors / descriptors have been evaluated ...
Krystian Mikolajczyk, Bastian Leibe, Bernt Schiele
EWCBR
2006
Springer
15 years 5 months ago
Unsupervised Feature Selection for Text Data
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
Nirmalie Wiratunga, Robert Lothian, Stewart Massie
AI
2011
Springer
14 years 9 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
ACL
2006
15 years 3 months ago
Unsupervised Induction of Modern Standard Arabic Verb Classes Using Syntactic Frames and LSA
We exploit the resources in the Arabic Treebank (ATB) and Arabic Gigaword (AG) to determine the best features for the novel task of automatically creating lexical semantic verb cl...
Neal Snider, Mona T. Diab