848 search results - page 153 / 170 » Feature selection in a kernel space |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
TVCG
2008
13 years 7 months ago
2008
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— In connectionist learning, one relevant problem is “catastrophic forgetting” that may occur when a network, trained with a large set of patterns, has to learn new input pat...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose a novel mode of feedback for image search, where a user describes which properties of exemplar images should be adjusted in order to more closely match his/her mental m...