Graph Retrieval with the Suffix Tree Model (bibtex)
@InProceedings{Lux2006a, author = {Lux, Mathias and Meyer zu Eissen, Sven and Granitzer, Michael}, booktitle = {Proceedings of the Workshop on Text-Based Information Retrieval TIR 06}, title = {Graph Retrieval with the Suffix Tree Model}, year = {2006}, address = {Riva del Garda}, editor = {Stein, Benno and Kao, Odej}, month = aug, pages = {30-34}, publisher = {Università di Trento, Italy}, abstract = {The paper in hand presents an adoption of the suffix tree model for the retrieval of labeled graphs. The suffix tree model encodes path information of graphs in an efficient way and so reduces the size of the data structures compared to path index based approaches, while offering a better runtime performance than subgraph isomorphism based methods. Within a specific use case we evaluate the correlation of the developed method to human judgement and compare the correlation values to other methods. We show that in our use case, which is the retrieval of digital photos annotated with MPEG-7 using the MPEG-7 Semantic Description Scheme, the presented algorithm performs better than other methods.}, issn = {1613-0073}, language = {EN}, talktype = {none}, url = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS//Vol-205/} }
Powered by bibtexbrowser (with ITEC extensions)