265 search results - page 37 / 53 » Fisher Kernels for Relational Data |
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
COORDINATION
2007
Springer
15 years 6 months ago
2007
Springer
Our aim is to define the kernel of a simple and uniform programming model—the reactor model—suitable for building and evolving internet-scale programs. A reactor consists of t...
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
100
click to vote
PAKDD
2005
ACM
15 years 5 months ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
162
click to vote
ICDE
1998
IEEE
16 years 1 months ago
1998
IEEE
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...