NDLI: Reducing human interactions in Web directory searches

Content Provider	ACM Digital Library
Author	Gerstel, Ori Matichin, Rachel Laber, Eduardo Sany Kutten, Shay Peleg, David Pessoa, Artur Alves Souza, Criston
Copyright Year	2007
Abstract	Consider a website containing a collection of webpages with data such as in Yahoo or the Open Directory project. Each page is associated with a weight representing the frequency with which that page is accessed by users. In the tree hierarchy representation, accessing each page requires the user to travel along the path leading to it from the root. By enhancing the index tree with additional edges (hotlinks) one may reduce the access cost of the system. In other words, the hotlinks reduce the expected number of steps needed to reach a leaf page from the tree root, assuming that the user knows which hotlinks to take. The hotlink enhancement problem involves finding a set of hotlinks minimizing this cost. This article proposes the first exact algorithm for the hotlink enhancement problem. This algorithm runs in polynomial time for trees with logarithmic depth. Experiments conducted with real data show that significant improvement in the expected number of accesses per search can be achieved in websites using this algorithm. These experiments also suggest that the simple and much faster heuristic proposed previously by Czyzowicz et al. [2003] creates hotlinks that are nearly optimal in the time savings they provide to the user. The version of the hotlink enhancement problem in which the weight distribution on the leaves is unknown is discussed as well. We present a polynomial-time algorithm that is optimal for any tree for any depth.
File Format	PDF
ISSN	10468188
e-ISSN	15582868
DOI	10.1145/1281485.1281491
Volume Number	25
Issue Number	4
Journal	ACM Transactions on Information Systems (TOIS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-10-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Hotlink Algorithms Directory tree Hotlist Hyperlink
Content Type	Text
Resource Type	Article
Subject	Computer Science Applications Information Systems Business, Management and Accounting

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Interest-based personalized search

On the Complexity of Optimal Hotlink Assignment

Introduction to recommender systems: Algorithms and Evaluation

Object management in distributed information systems

An experimental study of recent hotlink assignment algorithms

Item-based $top-\textit{N}$ recommendation algorithms

Understanding and Supporting Cross-Device Web Search for Exploratory Tasks with Mobile Touch Interactions

Near-Entropy Hotlink Assignments

TOIS reviewers

Reducing human interactions in Web directory searches

Similar Documents

Interest-based personalized search

On the Complexity of Optimal Hotlink Assignment

Introduction to recommender systems: Algorithms and Evaluation

Object management in distributed information systems

An experimental study of recent hotlink assignment algorithms

Item-based $top-\textit{N}$ recommendation algorithms

Understanding and Supporting Cross-Device Web Search for Exploratory Tasks with Mobile Touch Interactions

Near-Entropy Hotlink Assignments

TOIS reviewers

Reducing human interactions in Web directory searches