Exploring the Relationship between Keywords and Feed Elements in Blog Post Search
- Authors
- Han, Seung-Kyun; Shin, Dongmin; Jung, Jae-Yoon; Park, Jonghun
- Issue Date
- Dec-2009
- Publisher
- SPRINGER
- Keywords
- blog post search; ranking; learning to rank; RSS feed; neural network; web 2.0
- Citation
- WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, v.12, no.4, pp.381 - 398
- Indexed
- SCIE
SCOPUS
- Journal Title
- WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
- Volume
- 12
- Number
- 4
- Start Page
- 381
- End Page
- 398
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40628
- DOI
- 10.1007/s11280-009-0067-3
- ISSN
- 1386-145X
- Abstract
- Blogs are increasingly accepted as a useful means to proliferate a variety of information on the web. As the popularity of blogs grows rapidly, a number of blog search engines have appeared recently to help users access and discover blog posts efficiently. Nevertheless, existing approaches tend to focus on ranking the blog posts according to their recency or popularity only, leaving the problem of retrieving more topic relevant posts to a user's query largely unexplored. In this paper, we present a novel blog ranking framework, called PTRank, that improves search quality by taking account of relevance feedback from users as well as various information available from RSS feeds. A neural network method is employed to learn ranking functions that provide a relevance score between a keyword and a blog post. Extensive experiments on real blog data have been conducted to validate the proposed ranking framework for blog post search, and the results indicate that PTRank performs significantly better than the existing popular approach.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF INDUSTRIAL & MANAGEMENT ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40628)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.