Sciweavers

612 search results - page 43 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
ENTCS
2008
116views more  ENTCS 2008»
15 years 3 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
DMIN
2006
132views Data Mining» more  DMIN 2006»
15 years 4 months ago
Discovering Accurate and Interesting Classification Rules Using Genetic Algorithm
Discovering accurate and interesting classification rules is a significant task in the post-processing stage of a data mining (DM) process. Therefore, an optimization problem exis...
Janaki Gopalan, Reda Alhajj, Ken Barker
SIGIR
1999
ACM
15 years 7 months ago
Comparing the Performance of Database Selection Algorithms
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
James C. French, Allison L. Powell, James P. Calla...
MMM
2007
Springer
114views Multimedia» more  MMM 2007»
15 years 9 months ago
Mining Multiple Visual Appearances of Semantics for Image Annotation
This paper investigates the problem of learning the visual semantics of keyword categories for automatic image annotation. Supervised learning algorithms which learn only a single ...
Hung-Khoon Tan, Chong-Wah Ngo
126
Voted
ICPR
2008
IEEE
15 years 9 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel