Advanced search

Relevance criteria for data mining using error-tolerant graph matching

Sidharta Gautama (UGent) , Rik Bellens (UGent) , Guy De Tré (UGent) and Johannes D'Haeyer (UGent)
Author
Organization

Citation

Please use this url to cite or link to this publication:

Chicago
Gautama, Sidharta, Rik Bellens, Guy De Tré, and Johannes D’Haeyer. 2006. “Relevance Criteria for Data Mining Using Error-tolerant Graph Matching.” Combinatorial Image Analysis, Proceedings 4040: 277–290.
APA
Gautama, S., Bellens, R., De Tré, G., & D’Haeyer, J. (2006). Relevance criteria for data mining using error-tolerant graph matching. COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 4040, 277–290.
Vancouver
1.
Gautama S, Bellens R, De Tré G, D’Haeyer J. Relevance criteria for data mining using error-tolerant graph matching. COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS. SPRINGER-VERLAG BERLIN; 2006;4040:277–90.
MLA
Gautama, Sidharta, Rik Bellens, Guy De Tré, et al. “Relevance Criteria for Data Mining Using Error-tolerant Graph Matching.” COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS 4040 (2006): 277–290. Print.
@article{351651,
  author       = {Gautama, Sidharta and Bellens, Rik and De Tr{\'e}, Guy and D'Haeyer, Johannes},
  issn         = {0302-9743},
  journal      = {COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS},
  language     = {eng},
  pages        = {277--290},
  publisher    = {SPRINGER-VERLAG BERLIN},
  title        = {Relevance criteria for data mining using error-tolerant graph matching},
  volume       = {4040},
  year         = {2006},
}

Web of Science
Times cited: