Wszystkie pola: "Wyszukiwanie informacji" - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A method of constructing the frame of a directed graph
Autorzy:: Hofuku, I.
Oshima, K.
Powiązania:: https://bibliotekanauki.pl/articles/331224.pdf
Data publikacji:: 2013
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: directed graph
node clustering
Perron-Frobenius theorem
information retrieval
graf skierowany
węzeł grafu
twierdzenie Perrona-Frobeniusa
wyszukiwanie informacji
Opis:: In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 823-837
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Latent semantic indexing using eigenvalue analysis for efficient information retrieval
Autorzy:: Aswani Kumar, Ch.
Srinivas, S.
Powiązania:: https://bibliotekanauki.pl/articles/908375.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: wyszukiwanie informacji
indeksowanie semantyczne
wartość własna
wektor przestrzenny
information retrieval
latent semantic indexing
eigenvalues
rank reduction
singular value decomdecomposition
vector space method
Opis:: Text retrieval using Latent Semantic Indexing (LSI) with truncated Singular Value Decomposition (SVD) has been intensively studied in recent years. However, the expensive complexity involved in computing truncated SVD constitutes a major drawback of the LSI method. In this paper, we demonstrate how matrix rank approximation can influence the effectiveness of information retrieval systems. Besides, we present an implementation of the LSI method based on an eigenvalue analysis for rank approximation without computing truncated SVD, along with its computational details. Significant improvements in computational time while maintaining retrieval accuracy are observed over the tested document collections.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2006, 16, 4; 551-558
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja