1512 search results - page 159 / 303 » Towards the Personalization of Algorithms Evaluation in Data... |
206
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
197
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
171
click to vote
ICDM
2008
IEEE
16 years 29 days ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
172
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
184
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...