Sciweavers

105 search results - page 10 / 21
» Additive and Multiplicative Structure in Matrix Spaces
Sort
View
101
Voted
ECAI
2010
Springer
14 years 7 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
94
Voted
ATAL
2010
Springer
14 years 4 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
DAGSTUHL
1990
14 years 10 months ago
Parallel Rule-Firing Production Systems
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
Daniel Neimann
ICA
2010
Springer
14 years 10 months ago
Common SpatioTemporal Pattern Analysis
In this work we present a method for the estimation of a rank-one pattern living in two heterogeneous spaces, when observed through a mixture in multiple observation sets. Using a ...
Ronald Phlypo, Nisrine Jrad, Bertrand Rivet, Marco...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
15 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...