1913 search results - page 210 / 383 » Using Data Mining in MURA Graphic Problems |
141
click to vote
PAKDD
2007
ACM
15 years 10 months ago
2007
ACM
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
125
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
The paradigm of “human computation” seeks to harness human abilities to solve computational problems or otherwise perform distributed work that is beyond the scope of current ...
151
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
The problem of overlapping clustering, where a point is allowed to belong to multiple clusters, is becoming increasingly important in a variety of applications. In this paper, we ...
158
click to vote
PAKDD
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
145
click to vote
PAKDD
2007
ACM
15 years 10 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...