Substructure similarity measurement in chinese recipes
- 21 April 2008
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceeding of the 17th international conference on World Wide Web - WWW '08
- p. 979-988
- https://doi.org/10.1145/1367497.1367629
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Novel approaches for small biomolecule classification and structural similarity searchACM SIGKDD Explorations Newsletter, 2007
- RecipeCrawler: Collecting Recipe Data from WWW IncrementallyLecture Notes in Computer Science, 2006
- Graph indexing based on discriminative frequent structure analysisACM Transactions on Database Systems, 2005
- Substructure similarity search in graph databasesPublished by Association for Computing Machinery (ACM) ,2005
- A new algorithm for error-tolerant subgraph isomorphism detectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- An empirical study of domain knowledge and its benefits to substructure discoveryIEEE Transactions on Knowledge and Data Engineering, 1997
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- A vector space model for automatic indexingCommunications of the ACM, 1975