Rapid developments in science and engineering are producing a profound effect on the way information is represented. A new problem in pattern recognition has emerged: new data forms such as trees representing XML documents and images cannot been treated efficiently by classical storing and searching methods. In this paper we improve trie-based data structures by adding data mining techniques to speed up range search process. Improvements over the search process are expressed in terms of a lower number of distance calculations. Experiments on real sets of hierarchically represented images and XML documents show the good behavior of our patter recognition method.
Titolo: | Trie Structures for Approximate Search in Hierarchical Objects Collections |
Autori: | |
Data di pubblicazione: | 2005 |
Rivista: | |
Abstract: | Rapid developments in science and engineering are producing a profound effect on the way information is represented. A new problem in pattern recognition has emerged: new data forms such as trees representing XML documents and images cannot been treated efficiently by classical storing and searching methods. In this paper we improve trie-based data structures by adding data mining techniques to speed up range search process. Improvements over the search process are expressed in terms of a lower number of distance calculations. Experiments on real sets of hierarchically represented images and XML documents show the good behavior of our patter recognition method. |
Handle: | http://hdl.handle.net/11562/940486 |
Appare nelle tipologie: | 04.01 Contributo in atti di convegno |