Article

Comparison of interestingness functions for learning web usage patterns

Authors:

Xiangji Huang,

Aijun An,

Nick CerconeAuthors Info & Claims

CIKM '02: Proceedings of the eleventh international conference on Information and knowledge management

Pages 617 - 620

https://doi.org/10.1145/584792.584896

Published: 04 November 2002 Publication History

Get Access

Abstract

Livelink is a collaborative intranet, extranet and e-business application that enables employees and business partners of an organization to capture, share and reuse business information and knowledge. The usage of the Livelink software has been recorded by the Livelink Web server in its log files. We present an application of data mining techniques to the Livelink Web usage data. In particular, we focus on how to find interesting association rules and sequential patterns from the Livelink log files. A number of interestingness measures are used in our application to identify interesting rules and patterns. We present a comparison of these measures based on the feedback from domain experts. Some of the interestingness measures are found to be better than others.

References

[1]

Agrawal, R. and Srikant, R. Fast Algorithms for Mining Association Rules, Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile, Sept. 1994.]]

Digital Library

Google Scholar

[2]

Agrawal, R. and Srikant, R., Mining Sequential Patterns. Proceedings of International Conference on Data Engineering, Taipei, Taiwan, March 1995. pp.3--14.]]

Digital Library

Google Scholar

[3]

An, A. and Cercone, N. 2001. "Rule Quality Measures for Rule Induction Systems: Description and Evaluation", Computational Intelligence, Vol. 17 No. 3.]]

Google Scholar

[4]

Brin, S., Motwani, R., Ullman, J. and Tsur, S. 1997. "Dynamic Itemset Counting and Implication Rules for Market Basket Data", Proceedings of 1997 ACM-SIGMOD International Conference on Management of Data, Montreal, Canada. pp.255--264.]]

Digital Library

Google Scholar

[5]

Bruha, I. 1996. "Quality of Decision Rules: Definitions and Classification Schemes for Multiple Rules", in Nakhaeizadeh, G. and Taylor, C. C. (eds.): Machine Learning and Statistics, The Interface. Jone Wiley & Sons Inc.]]

Google Scholar

[6]

Hilderman, R.J. and Hamilton, H.J., Evaluation of Interestingness Measures for Ranking Discovered Knowledge. In Cheung, D., Williams, G.J., and Li, Q. (eds.), Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'01), Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, April, 2001, pp. 247--259.]]

Digital Library

Google Scholar

[7]

Piatetsky-Shapiro, G., "Discovery, Analysis and Presentation of Strong Rules". Knowledge Discovery in Databases, AAAI, 1991, pp.229.]]

Google Scholar

[8]

Shah, D., Lakshmanan, L.V.S., Ramamritham, K. and Sudarshan, S., "Interestingness and Pruning of Mined Patterns". ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, May 1999.]]

Google Scholar

[9]

Silberschatz, A. and Tuzhilin, A. "What makes patterns interesting in knowledge discovery systems". IEEE Transactions on Knowledge and Data Eng., 8(6):970--974, 1996.]]

Digital Library

Google Scholar

[10]

Tan, P. and Kumar, V. "Interestingness Measures for Association Patterns: A Perspective", Technical Report TR00-036, Department of Computer Science, University of Minnestota, 2000.]]

Google Scholar

[11]

Zheng, Z., Kohavi, R. and Mason, L. Real World Performance of Association Rule Algorithms, Proc. of the 7th ACM-SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, New York, NY. 2001.]]

Digital Library

Google Scholar

Cited By

View all

Kavya VReddy P(2016)Coverage Patterns-Based Approach to Allocate Advertisement Slots for Display AdvertisingWeb Engineering10.1007/978-3-319-38791-8_9(152-169)Online publication date: 25-May-2016
https://doi.org/10.1007/978-3-319-38791-8_9
Pathak NShah VAjmeera C(2015)A Memory Efficient Algorithm with Enhance Preprocessing Technique for Web Usage MiningEmerging ICT for Bridging the Future - Proceedings of the 49th Annual Convention of the Computer Society of India CSI Volume 210.1007/978-3-319-13731-5_65(601-608)Online publication date: 2015
https://doi.org/10.1007/978-3-319-13731-5_65
Pathak NShah VAjmeera C(2014)A Memory Efficient Algorithm with Enhance Preprocessing Technique for Web Usage MiningProceedings of the 2014 International Conference on Information and Communication Technology for Competitive Strategies10.1145/2677855.2677902(1-6)Online publication date: 14-Nov-2014
https://dl.acm.org/doi/10.1145/2677855.2677902
Show More Cited By

Index Terms

Comparison of interestingness functions for learning web usage patterns
1. Information systems
  1. Data management systems

Recommendations

Web usage mining: discovery and applications of usage patterns from Web data

Web usage mining is the application of data mining techniques to discover usage patterns from Web data, in order to understand and better serve the needs of Web-based applications. Web usage mining consists of three phases, namely preprocessing, pattern ...
Interestingness measures for association rules: Combination between lattice and hash tables

There are many methods which have been developed for improving the time of mining frequent itemsets. However, the time for generating association rules were not put in deep research. In reality, if a database contains many frequent itemsets (from ...
A New Interestingness Measure of Association Rules
WGEC '08: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing

Discovering association rules is one of the most important tasks in data mining. The classical model of association rules mining is support-confidence, the interestingness measure of which is the confidence measure. The classical Interestingness measure ...

Comments

Information & Contributors

Information

Published In

CIKM '02: Proceedings of the eleventh international conference on Information and knowledge management

November 2002

704 pages

ISBN:1581134924

DOI:10.1145/584792

General Chair:
Charles Nicholas
University of Maryland Baltimore County
,
Program Chairs:
David Grossman
Illinois Institute of Technology
,
Konstantinos Kalpakis
University of Maryland Baltimore County
,
Sajda Qureshi
Erasmus University, Rotterdam
,
Han van Dissel
Erasmus University, Rotterdam
,
Len Seligman
The MITRE Corporation

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 November 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM02

Sponsor:

CIKM02: Eleventh ACM International Conference on Information and Knowledge Management

November 4 - 9, 2002

Virginia, McLean, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
823
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kavya VReddy P(2016)Coverage Patterns-Based Approach to Allocate Advertisement Slots for Display AdvertisingWeb Engineering10.1007/978-3-319-38791-8_9(152-169)Online publication date: 25-May-2016
https://doi.org/10.1007/978-3-319-38791-8_9
Pathak NShah VAjmeera C(2015)A Memory Efficient Algorithm with Enhance Preprocessing Technique for Web Usage MiningEmerging ICT for Bridging the Future - Proceedings of the 49th Annual Convention of the Computer Society of India CSI Volume 210.1007/978-3-319-13731-5_65(601-608)Online publication date: 2015
https://doi.org/10.1007/978-3-319-13731-5_65
Pathak NShah VAjmeera C(2014)A Memory Efficient Algorithm with Enhance Preprocessing Technique for Web Usage MiningProceedings of the 2014 International Conference on Information and Communication Technology for Competitive Strategies10.1145/2677855.2677902(1-6)Online publication date: 14-Nov-2014
https://dl.acm.org/doi/10.1145/2677855.2677902
Railean ILenca PMoga SBorda M(2013)Closeness Preference - A new interestingness measure for sequential rules miningKnowledge-Based Systems10.1016/j.knosys.2013.01.02544(48-56)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1016/j.knosys.2013.01.025
Gwadera R(2013)Pattern-based solution risk model for strategic IT outsourcingProceedings of the 13th international conference on Advances in Data Mining: applications and theoretical aspects10.1007/978-3-642-39736-3_5(55-69)Online publication date: 16-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39736-3_5
Castellano GFanelli ATorsello M(2013)Web Usage Mining: Discovering Usage Patterns for Web ApplicationsAdvanced Techniques in Web Intelligence-210.1007/978-3-642-33326-2_4(75-104)Online publication date: 2013
https://doi.org/10.1007/978-3-642-33326-2_4
Kumar PBapi RKrishna P(2012)Sequence Pattern Mining for Web LogsPattern Discovery Using Sequence Data Mining10.4018/978-1-61350-056-9.ch014(237-243)Online publication date: 2012
https://doi.org/10.4018/978-1-61350-056-9.ch014
Gwadera RAntonini GLabbi A(2011)Mining actionable partial orders in collections of sequencesProceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I10.5555/2034063.2034115(613-528)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.5555/2034063.2034115
Wang YLee A(2011)Mining Web navigation patterns with a path traversal graphExpert Systems with Applications: An International Journal10.1016/j.eswa.2010.12.05838:6(7112-7122)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1016/j.eswa.2010.12.058
Gwadera RAntonini GLabbi A(2011)Mining actionable partial orders in collections of sequencesProceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I10.1007/978-3-642-23780-5_49(613-628)Online publication date: 5-Sep-2011
https://dl.acm.org/doi/10.1007/978-3-642-23780-5_49
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Web usage mining: discovery and applications of usage patterns from Web data

Interestingness measures for association rules: Combination between lattice and hash tables

A New Interestingness Measure of Association Rules