Sciweavers

145 search results - page 7 / 29
» Structure feature selection for graph classification
Sort
View
JMLR
2008
94views more  JMLR 2008»
13 years 8 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
MLMI
2005
Springer
14 years 2 months ago
Improving the Performance of Acoustic Event Classification by Selecting and Combining Information Sources Using the Fuzzy Integr
Acoustic events produced in meeting-room-like environments may carry information useful for perceptually aware interfaces. In this paper, we focus on the problem of combining diffe...
Andrey Temko, Dusan Macho, Climent Nadeu
CVPR
2007
IEEE
14 years 10 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui
ICPR
2004
IEEE
14 years 9 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
NIPS
2004
13 years 10 months ago
An Application of Boosting to Graph Classification
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
Taku Kudo, Eisaku Maeda, Yuji Matsumoto