Discovery of interesting usage patterns from Web data

Robert Cooley, Pang Ning Tan, Jaideep Srivastava

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

70 Citations (Scopus)

Abstract

Web Usage Mining is the application of data mining techniques to large Web data repositories in order to extract usage patterns. As with many data mining application domains, the identification of patterns that are considered interesting is a problem that must be solved in addition to simply generating them. A necessary step in identifying interesting results is quantifying what is considered uninteresting in order to form a basis for comparison. Several research efforts have relied on manually generated sets of uninteresting rules. However, manual generation of a comprehensive set of evidence about beliefs for a particular domain is impractical in many cases. Generally, domain knowledge can be used to automatically create evidence for or against a set of beliefs. This paper develops a quantitative model based on support logic for determining the interestingness of discovered patterns. For Web Usage Mining, there are three types of domain information available; usage, content, and structure. This paper also describes algorithms for using these three types of information to automatically identify interesting knowledge. These algorithms have been incorporated into the Web Site Information Filter (WebSIFT) system and examples of interesting frequent itemsets automatically discovered from real Web data are presented.

Original languageEnglish
Title of host publicationLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
PublisherSpringer Verlag
Pages163-182
Number of pages20
Volume1836
ISBN (Print)9783540678182
Publication statusPublished - 2000
Externally publishedYes
EventInternational Workshop on Web Usage Analysis and User Profiling, WEBKDD 1999 - San Diego, United States
Duration: 15 Aug 199915 Aug 1999

Other

OtherInternational Workshop on Web Usage Analysis and User Profiling, WEBKDD 1999
CountryUnited States
CitySan Diego
Period15/8/9915/8/99

Fingerprint

Web Usage Mining
Data mining
Data Mining
Websites
Frequent Itemsets
Domain Knowledge
Repository
Logic
Model-based
Filter
Necessary
Evidence
Beliefs
Knowledge

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Cooley, R., Tan, P. N., & Srivastava, J. (2000). Discovery of interesting usage patterns from Web data. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1836, pp. 163-182). Springer Verlag.

Discovery of interesting usage patterns from Web data. / Cooley, Robert; Tan, Pang Ning; Srivastava, Jaideep.

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). Vol. 1836 Springer Verlag, 2000. p. 163-182.

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

Cooley, R, Tan, PN & Srivastava, J 2000, Discovery of interesting usage patterns from Web data. in Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). vol. 1836, Springer Verlag, pp. 163-182, International Workshop on Web Usage Analysis and User Profiling, WEBKDD 1999, San Diego, United States, 15/8/99.
Cooley R, Tan PN, Srivastava J. Discovery of interesting usage patterns from Web data. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). Vol. 1836. Springer Verlag. 2000. p. 163-182
Cooley, Robert ; Tan, Pang Ning ; Srivastava, Jaideep. / Discovery of interesting usage patterns from Web data. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). Vol. 1836 Springer Verlag, 2000. pp. 163-182
@inproceedings{d01df3e9bd7647f8a319fb9136c103e3,
title = "Discovery of interesting usage patterns from Web data",
abstract = "Web Usage Mining is the application of data mining techniques to large Web data repositories in order to extract usage patterns. As with many data mining application domains, the identification of patterns that are considered interesting is a problem that must be solved in addition to simply generating them. A necessary step in identifying interesting results is quantifying what is considered uninteresting in order to form a basis for comparison. Several research efforts have relied on manually generated sets of uninteresting rules. However, manual generation of a comprehensive set of evidence about beliefs for a particular domain is impractical in many cases. Generally, domain knowledge can be used to automatically create evidence for or against a set of beliefs. This paper develops a quantitative model based on support logic for determining the interestingness of discovered patterns. For Web Usage Mining, there are three types of domain information available; usage, content, and structure. This paper also describes algorithms for using these three types of information to automatically identify interesting knowledge. These algorithms have been incorporated into the Web Site Information Filter (WebSIFT) system and examples of interesting frequent itemsets automatically discovered from real Web data are presented.",
author = "Robert Cooley and Tan, {Pang Ning} and Jaideep Srivastava",
year = "2000",
language = "English",
isbn = "9783540678182",
volume = "1836",
pages = "163--182",
booktitle = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",
publisher = "Springer Verlag",

}

TY - GEN

T1 - Discovery of interesting usage patterns from Web data

AU - Cooley, Robert

AU - Tan, Pang Ning

AU - Srivastava, Jaideep

PY - 2000

Y1 - 2000

N2 - Web Usage Mining is the application of data mining techniques to large Web data repositories in order to extract usage patterns. As with many data mining application domains, the identification of patterns that are considered interesting is a problem that must be solved in addition to simply generating them. A necessary step in identifying interesting results is quantifying what is considered uninteresting in order to form a basis for comparison. Several research efforts have relied on manually generated sets of uninteresting rules. However, manual generation of a comprehensive set of evidence about beliefs for a particular domain is impractical in many cases. Generally, domain knowledge can be used to automatically create evidence for or against a set of beliefs. This paper develops a quantitative model based on support logic for determining the interestingness of discovered patterns. For Web Usage Mining, there are three types of domain information available; usage, content, and structure. This paper also describes algorithms for using these three types of information to automatically identify interesting knowledge. These algorithms have been incorporated into the Web Site Information Filter (WebSIFT) system and examples of interesting frequent itemsets automatically discovered from real Web data are presented.

AB - Web Usage Mining is the application of data mining techniques to large Web data repositories in order to extract usage patterns. As with many data mining application domains, the identification of patterns that are considered interesting is a problem that must be solved in addition to simply generating them. A necessary step in identifying interesting results is quantifying what is considered uninteresting in order to form a basis for comparison. Several research efforts have relied on manually generated sets of uninteresting rules. However, manual generation of a comprehensive set of evidence about beliefs for a particular domain is impractical in many cases. Generally, domain knowledge can be used to automatically create evidence for or against a set of beliefs. This paper develops a quantitative model based on support logic for determining the interestingness of discovered patterns. For Web Usage Mining, there are three types of domain information available; usage, content, and structure. This paper also describes algorithms for using these three types of information to automatically identify interesting knowledge. These algorithms have been incorporated into the Web Site Information Filter (WebSIFT) system and examples of interesting frequent itemsets automatically discovered from real Web data are presented.

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

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

M3 - Conference contribution

AN - SCOPUS:84937580790

SN - 9783540678182

VL - 1836

SP - 163

EP - 182

BT - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

PB - Springer Verlag

ER -