58 search results - page 9 / 12 » Empirical comparison of graph classification algorithms |
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
The goal of feature induction is to automatically create nonlinear combinations of existing features as additional input features to improve classification accuracy. Typically, no...
IJCAI
1997
13 years 10 months ago
1997
In teaching case-based argumentation skills, the CATO program, an intelligent learning environment, guides students' assessments of partial matches between problems and cases...
HICSS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
AAAI
1998
13 years 10 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...