Multipath querying of hierarchically tree structured document databases in vector spaces Vektör Uzayinda Siradüzensel Aǧaç Yapisi ile Düzenlenmiş Metin Veri Tabanlarinin Çoklu Yollar Üzerinden Sorgulanmasi
Proceedings of the IEEE 12th Signal Processing and Communications Applications Conference, SIU 2004, Kusadasi, Türkiye, 28 - 30 Nisan 2004, ss.619-622, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Basıldığı Şehir: Kusadasi
- Basıldığı Ülke: Türkiye
- Sayfa Sayıları: ss.619-622
- Boğaziçi Üniversitesi Adresli: Evet
Özet
Representation of large document databases consisting of web pages, articles, book and magazine titles in terms of matrices for the purpose of text querying and retrieval simplifies and expedites the querying process. In the literature, dimensionality reduction techniques based on singular value decomposition and principal component analysis have been proposed to reduce the high computational complexity resulting from the use of high dimensional matrices and vectors. In [12], organization of the text database in the form of a hierarchical tree structure, and single path and multi path querying over this structure, was proposed as a technique to reduce the computational complexity in addition to dimensionality reduction. In this paper, we analyze and compare the tradeoff between the computational complexity and the performance of the static and adaptive multipath querying methods by varying the number of paths. ©2004 IEEE.