Sciweavers

136 search results - page 27 / 28
» On Learning Monotone Boolean Functions
Sort
View
KDD
2010
ACM
279views Data Mining» more  KDD 2010»
13 years 10 months ago
Unifying dependent clustering and disparate clustering for non-homogeneous data
Modern data mining settings involve a combination of attributevalued descriptors over entities as well as specified relationships between these entities. We present an approach t...
M. Shahriar Hossain, Satish Tadepalli, Layne T. Wa...
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
13 years 5 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
FOCS
2010
IEEE
13 years 4 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
13 years 7 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
13 years 10 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux