Sciweavers

815 search results - page 55 / 163
» Approximate Entropy Reducts
Sort
View
INFORMATICASI
2007
89views more  INFORMATICASI 2007»
14 years 11 months ago
Approximate Representation of Textual Documents in the Concept Space
In this paper we deal with the problem of addition of new documents in collection when documents are represented in lower dimensional space by concept indexing. Concept indexing i...
Jasminka Dobsa, Bojana Dalbelo Basic
MICAI
2004
Springer
15 years 5 months ago
MultiGrid-Based Fuzzy Systems for Function Approximation
In this paper we make use of a modified Grid Based Fuzzy System architecture, which may provide an exponential reduction in the number of rules needed. We also introduce an algori...
Luis Javier Herrera, Héctor Pomares, Ignaci...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 9 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 5 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
NIPS
2008
15 years 1 months ago
Supervised Exponential Family Principal Component Analysis via Convex Optimization
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
Yuhong Guo