A Co-Recommendation Algorithm for Web searching
This paper presents an approach called the Co-Recommendation Algorithm, which consists of the features of the recommendation rule and the co-citation algorithm. The algorithm addresses some challenges that are essential for further searching and recommendation algorithms. It does not require users t...
Saved in:
Published in | Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings pp. 479 - 482 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
2002
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper presents an approach called the Co-Recommendation Algorithm, which consists of the features of the recommendation rule and the co-citation algorithm. The algorithm addresses some challenges that are essential for further searching and recommendation algorithms. It does not require users to provide a lot of interactive communication. Furthermore, it supports other queries, such as keyword, URL and document investigations. When the structure is compared to other algorithms, the scalability is noticeably easier. The high online performance can be obtained as well as the repository computation, which can achieve a high group-forming accuracy using only a fraction of Web pages from a cluster. |
---|---|
ISBN: | 0769515126 9780769515120 |
DOI: | 10.1109/ICAPP.2002.1173621 |