Incorporating usage information into average-clicks algorithm

Kalyan Beemanapalli, Ramya Rangarajan, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A number of methods exists that measure the distance between two web pages. Average-Clicks is a new measure of distance between web pages which fits user's intuition of distance better than the traditional measure of clicks between two pages. Average-Clicks however assumes that the probability of the user following any link on a web page is the same and gives equal weights to each of the out-going links. In our method "Usage Aware Average-Clicks" we have taken the user's browsing behavior into account and assigned different weights to different links on a particular page based on how frequently users follow a particular link. Thus, Usage Aware Average-Clicks is an extension to the Average-Clicks Algorithm where the static web link structure graph is combined with the dynamic Usage Graph (built using the information available from the web logs) to assign different weights to links on a web page and hence capture the user's intuition of distance more accurately. A new distance metric has been designed using this methodology and used to improve the efficiency of a web recommendation engine.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages21-35
Number of pages15
Volume4811 LNAI
Publication statusPublished - 2007
Externally publishedYes
Event8th International Workshop on Knowledge Discovery on the Web, WebKDD 2006 - Philadelphia, PA
Duration: 20 Aug 200620 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4811 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Workshop on Knowledge Discovery on the Web, WebKDD 2006
CityPhiladelphia, PA
Period20/8/0620/8/06

Fingerprint

Websites
Intuition
Weights and Measures
Recommender systems
Distance Metric
Browsing
Graph in graph theory
Assign
Recommendations
Engine
Methodology

Keywords

  • Link analysis
  • Recommendation engines
  • Web mining
  • Web usage analysis

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Beemanapalli, K., Rangarajan, R., & Srivastava, J. (2007). Incorporating usage information into average-clicks algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4811 LNAI, pp. 21-35). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4811 LNAI).

Incorporating usage information into average-clicks algorithm. / Beemanapalli, Kalyan; Rangarajan, Ramya; Srivastava, Jaideep.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4811 LNAI 2007. p. 21-35 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4811 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Beemanapalli, K, Rangarajan, R & Srivastava, J 2007, Incorporating usage information into average-clicks algorithm. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4811 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4811 LNAI, pp. 21-35, 8th International Workshop on Knowledge Discovery on the Web, WebKDD 2006, Philadelphia, PA, 20/8/06.
Beemanapalli K, Rangarajan R, Srivastava J. Incorporating usage information into average-clicks algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4811 LNAI. 2007. p. 21-35. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Beemanapalli, Kalyan ; Rangarajan, Ramya ; Srivastava, Jaideep. / Incorporating usage information into average-clicks algorithm. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4811 LNAI 2007. pp. 21-35 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f17f55f216cd4433aa41ad48efbf3528,
title = "Incorporating usage information into average-clicks algorithm",
abstract = "A number of methods exists that measure the distance between two web pages. Average-Clicks is a new measure of distance between web pages which fits user's intuition of distance better than the traditional measure of clicks between two pages. Average-Clicks however assumes that the probability of the user following any link on a web page is the same and gives equal weights to each of the out-going links. In our method {"}Usage Aware Average-Clicks{"} we have taken the user's browsing behavior into account and assigned different weights to different links on a particular page based on how frequently users follow a particular link. Thus, Usage Aware Average-Clicks is an extension to the Average-Clicks Algorithm where the static web link structure graph is combined with the dynamic Usage Graph (built using the information available from the web logs) to assign different weights to links on a web page and hence capture the user's intuition of distance more accurately. A new distance metric has been designed using this methodology and used to improve the efficiency of a web recommendation engine.",
keywords = "Link analysis, Recommendation engines, Web mining, Web usage analysis",
author = "Kalyan Beemanapalli and Ramya Rangarajan and Jaideep Srivastava",
year = "2007",
language = "English",
isbn = "354077484X",
volume = "4811 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "21--35",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Incorporating usage information into average-clicks algorithm

AU - Beemanapalli, Kalyan

AU - Rangarajan, Ramya

AU - Srivastava, Jaideep

PY - 2007

Y1 - 2007

N2 - A number of methods exists that measure the distance between two web pages. Average-Clicks is a new measure of distance between web pages which fits user's intuition of distance better than the traditional measure of clicks between two pages. Average-Clicks however assumes that the probability of the user following any link on a web page is the same and gives equal weights to each of the out-going links. In our method "Usage Aware Average-Clicks" we have taken the user's browsing behavior into account and assigned different weights to different links on a particular page based on how frequently users follow a particular link. Thus, Usage Aware Average-Clicks is an extension to the Average-Clicks Algorithm where the static web link structure graph is combined with the dynamic Usage Graph (built using the information available from the web logs) to assign different weights to links on a web page and hence capture the user's intuition of distance more accurately. A new distance metric has been designed using this methodology and used to improve the efficiency of a web recommendation engine.

AB - A number of methods exists that measure the distance between two web pages. Average-Clicks is a new measure of distance between web pages which fits user's intuition of distance better than the traditional measure of clicks between two pages. Average-Clicks however assumes that the probability of the user following any link on a web page is the same and gives equal weights to each of the out-going links. In our method "Usage Aware Average-Clicks" we have taken the user's browsing behavior into account and assigned different weights to different links on a particular page based on how frequently users follow a particular link. Thus, Usage Aware Average-Clicks is an extension to the Average-Clicks Algorithm where the static web link structure graph is combined with the dynamic Usage Graph (built using the information available from the web logs) to assign different weights to links on a web page and hence capture the user's intuition of distance more accurately. A new distance metric has been designed using this methodology and used to improve the efficiency of a web recommendation engine.

KW - Link analysis

KW - Recommendation engines

KW - Web mining

KW - Web usage analysis

UR - http://www.scopus.com/inward/record.url?scp=38549167872&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38549167872&partnerID=8YFLogxK

M3 - Conference contribution

SN - 354077484X

SN - 9783540774846

VL - 4811 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 21

EP - 35

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -