Sciweavers

7123 search results - page 112 / 1425
» The Ordered Set of Rough Sets
Sort
View
ICPP
2000
IEEE
14 years 2 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 10 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
CI
2004
119views more  CI 2004»
13 years 10 months ago
Reasoning with Sets of Defaults in Default Logic
We present a general approach for representing and reasoning with sets of defaults in default logic, focussing on reasoning about preferences among sets of defaults. First, we con...
James P. Delgrande, Torsten Schaub
ICCV
2003
IEEE
15 years 13 hour ago
Appearance Sampling for Obtaining A Set of Basis Images for Variable Illumination
Previous studies have demonstrated that the appearance of an object under varying illumination conditions can be represented by a low-dimensional linear subspace. A set of basis i...
Imari Sato, Takahiro Okabe, Yoichi Sato, Katsushi ...
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 10 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...