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...

Full description

Saved in:
Bibliographic Details
Published inFifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings pp. 479 - 482
Main Authors Mingjun Lan, Shui Yu, Bacher, R., Wanlei Zhou
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Clustering algorithms
Content based retrieval
Database languages
History
Information retrieval
Navigation
Search engines
Uniform resource locators
Web pages
World Wide Web
Online AccessGet full text

Cover

Abstract 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.
AbstractList 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.
Author Wanlei Zhou
Mingjun Lan
Shui Yu
Bacher, R.
Author_xml – sequence: 1
  surname: Mingjun Lan
  fullname: Mingjun Lan
  organization: Sch. of Comput. & Math., Deakin Univ., Burwood, Vic., Australia
– sequence: 2
  surname: Shui Yu
  fullname: Shui Yu
  organization: Sch. of Comput. & Math., Deakin Univ., Burwood, Vic., Australia
– sequence: 3
  givenname: R.
  surname: Bacher
  fullname: Bacher, R.
  organization: Sch. of Comput. & Math., Deakin Univ., Burwood, Vic., Australia
– sequence: 4
  surname: Wanlei Zhou
  fullname: Wanlei Zhou
  organization: Sch. of Comput. & Math., Deakin Univ., Burwood, Vic., Australia
BookMark eNotj8tKAzEYhQMqaC8voJt5gWmTP81tOQxqhYJFLC5LJvnTRjqJZGbj2ztgz-bwbc7HmZHblBMS8sjoijFq1m9ts9-vgFKYWHEJ7IbMqJJGMMFA3pPlMHzTKUIow_UDWTdVm-sPdLnvMXk7xpyq5nLKJY7nvgq5VF_YVQPa4s4xnRbkLtjLgMtrz8nh5fmz3da799dJvqsjMDPWzhmHFIU1FlRQmhrptfbac9_ZTQioBGjqmXaGSpQKwKkOGLBOGIkbw-fk6X83IuLxp8Telt_j9RP_Aw8HQsM
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICAPP.2002.1173621
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 482
ExternalDocumentID 1173621
Genre orig-research
GroupedDBID 6IE
6IK
6IL
AAJGR
AAVQY
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i219t-cc9ce0e5a9a27f78096d88d8d3dba4ffe75280d18c906e6722c7b2121b596e493
IEDL.DBID RIE
ISBN 0769515126
9780769515120
IngestDate Wed Jun 26 19:27:24 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i219t-cc9ce0e5a9a27f78096d88d8d3dba4ffe75280d18c906e6722c7b2121b596e493
OpenAccessLink http://dro.deakin.edu.au/eserv/DU%3A30004866/zhou-co-recommendation-2002.pdf
PageCount 4
ParticipantIDs ieee_primary_1173621
PublicationCentury 2000
PublicationDate 20020000
PublicationDateYYYYMMDD 2002-01-01
PublicationDate_xml – year: 2002
  text: 20020000
PublicationDecade 2000
PublicationTitle Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings
PublicationTitleAbbrev ICAPP
PublicationYear 2002
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000557938
Score 1.3223168
Snippet This paper presents an approach called the Co-Recommendation Algorithm, which consists of the features of the recommendation rule and the co-citation...
SourceID ieee
SourceType Publisher
StartPage 479
SubjectTerms Clustering algorithms
Content based retrieval
Database languages
History
Information retrieval
Navigation
Search engines
Uniform resource locators
Web pages
World Wide Web
Title A Co-Recommendation Algorithm for Web searching
URI https://ieeexplore.ieee.org/document/1173621
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZKJ6YCLeItD4w4zdOxx6qiKkhFHajoVvlxLhU0QVWy8OtxnKQIxMCWZLDsOLnvu_PdfQjdCks5eKIMkUYLEkMsiLRWkChuPy9LH0zgxCZmT3S6iB-XybKD7va1MADgks_Aqy7dWb7OVVmFyoZBkFp7a32dA-aHda3WPp5S9ZLiEas9c0sbLJDRpsFOe--3RTM-Hz6MR_O5y1DwmlF_yKs4dJn00KydV51U8uaVhfTU56-Wjf-d-BEafNfx4fkeoY5RB7IT1GuFHHDzX_fRcITHOak80a0dqFZZwqP3db7bFK9bbHktfgGJm2OHbD1Ai8n983hKGiUFsrEWqSBKcQU-JIKLMDX2lXCqGdNMR1qK2BhIk5D5OmCK-xRoGoYqlRbUAplwCjGPTlE3yzM4Q1gGLIVEay4MjaVkQoaR4dRQy9wEA_8c9av1rz7qZhmrZukXfz--RIdOXsXFNK5Qt9iVcG1RvpA3bnu_ABF2obo
link.rule.ids 310,311,786,790,795,796,802,4069,4070,27956,55107
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwFG4IHvSECsbf7uDRjm1sXXskRAIKhANEbqQ_XpEomyHj4l9v120YjQdv2w5Nu27v-97re-9D6J4bysEiqbHQiuMQQo6FsYJYMvN5GfqgfSs2MZ6QwTx8WkSLGnrY18IAgE0-Aze_tGf5KpW7PFTW9v3Y2Fvj6xwYnPfiolprH1HJu0mxDi18c0McDJSRssVOde9VZTMeaw973enU5ii45bg_BFYsvvQbaFzNrEgreXN3mXDl56-mjf-d-jFqfVfyOdM9Rp2gGiSnqFFJOTjln91E7a7TS3Hui27MQIXOktN9X6Xbdfa6cQyzdV5AOOXBQ7JqoXn_cdYb4FJLAa-NTcqwlEyCBxFnPIi1eSWMKEoVVR0leKg1xFFAPeVTyTwCJA4CGQsDa76IGIGQdc5QPUkTOEeO8GkMkVKMaxIKQbkIOpoRTQx34xS8C9TM17_8KNplLMulX_79-A4dDmbj0XI0nDxfoSMrtmIjHNeonm13cGMwPxO3dqu_AM9xpQ4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Fifth+International+Conference+on+Algorithms+and+Architectures+for+Parallel+Processing%2C+2002.+Proceedings&rft.atitle=A+Co-Recommendation+Algorithm+for+Web+searching&rft.au=Mingjun+Lan&rft.au=Shui+Yu&rft.au=Bacher%2C+R.&rft.au=Wanlei+Zhou&rft.date=2002-01-01&rft.pub=IEEE&rft.isbn=9780769515120&rft.spage=479&rft.epage=482&rft_id=info:doi/10.1109%2FICAPP.2002.1173621&rft.externalDocID=1173621
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769515120/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769515120/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769515120/sc.gif&client=summon&freeimage=true