Abstract
The emerging popularity of e-commerce and the advances in automatic data collection methods that are applied in Web sites (e.g., accesslogs), have produced large databases about Web-site users. The stored information is usually in the form of transactions that represent, e.g., purchased products, sessions of visited pages, etc. The availability of such detailed data about users’ movements and choices, can be an invaluable source of information through which analysts can apply data mining techniques to extract patterns about users’ behavior.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, C. Faloutsos, A. Swami. “Efficient Similarity Search in Sequence Databases”. Proceedings International Conference on Foundations of Data Organization and Algorithms (FODO’93), pp.69–84, Chicago, IL, 1993.
R. Agrawal, R. Srikant. “Fast Algorithms for Mining Association Rules in Large Databases”. Proceedings 19th International Conference on Very Large Data Bases (VLDB’94), pp.207–216, Santiago, Chile, 1994.
C. Aggarwal, J. Wolf, P.S. Yu. “A New Method for Similarity Indexing of Market Basket Data”. Proceedings ACM International Conference on Management of Data (SIGMOD’99), Philadelphia, PA, 1999.
R. Baeza-Yates, B. Ribeiro-Neto. “Modern Information Retrieval”. Addison-Wesley, 1999.
S. Berchtold, C. Böhm, H.-P. Kriegel. “The Pyramid Technique: Towards Breaking the Curse of Dimensionality”. Proceedings ACM International Conference on Management of Data (SIGMOD’98), pp.142–153, Seattle, WA, 1998.
M-S. Chen, J. Park, P.S. Yu. “Efficient Data Mining for Path Traversal Patterns”. IEEE Transactions on Knowledge and Data Engineering, Vol.10, No.2, pp.209–221, 1998.
U. Deppish. “S-tree: a Dynamic Balanced Signature Index for Office Retrieval”. Proceedings 9th ACM International Conference on Information Retrieval (SI-GIR’86), pp.77–87, Pisa, Italy, 1986.
C. Faloutsos, M. Ranganathan, Y. Manolopoulos. “Fast Subsequence Matching in Time-Series Databases”. Proceedings ACM International Conference on Management of Data (SIGMOD’94), pp.419–429, Minneapolis, MN, 1994.
A. Gionis, D. Gunopulos, N. Koudas. “Efficient and Tunable Similar Set Retrieval”. Proceedings ACM International Conference on Management of Data (SIGMOD’2001), Santa Barbara, CA, 2001.
D. Goldberg, D. Nichols, B. Oki, D. Terry. “Using Collaborative Filtering to Weave an Information Tapestry”. Communications of the ACM, Vol.35, No. 12, pp.61–70, 1992.
S. Guha, R. Rastogi, K. Shim. “Cure: an Efficient Clustering Algorithm for Large Databases”. Information Systems, Vol.26, No.1, pp.35–58, 2001.
A. Guttman. “R-trees: a Dynamic Index Structure for Spatial Searching”. Proceedings ACM International Conference on Management of Data (SIGMOD’84), pp.47–57, Boston, MA, 1984.
J. Hellerstein, A. Pfeffer. “The RD-tree: an Index Structure for Sets”. Technical Report No. 1252, University of Wisconsin at Madison, 1994.
S. Helmer, G. Moerkotte. “Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates”. Proceedings 23rd International Conference on Very Large Data Dases (VLDB’97), pp.386–395, Athens, Greece, 1997.
W. Hill, L. Stead, M. Rosenstein, G. Furnas. “Recommending and Evaluating Choices in a Virtual Community of Use”. Proceedings Conference on Human factors in Computing Systems (CHI’95), pp. 194–201, Denver, CO, 1995.
Y. Ishikawa, H. Kitagawa, N. Ohbo. “Evaluation of Signature Files as Set Access Facilities in OODBs”. Proceedings ACM International Conference on Management of Data (SIGMOD’93), pp.247–256, Washington, DC, 1993.
N. Katayama, S. Satoh. “The SR-tree: An Index Structure for High Dimensional Nearest Neighbor Queries”. Proceedings ACM International Conference on Management of Data (SIGMOD’97), pp.369–380, Tucson, AZ, 1997.
J. Konstan, B. Miller, D. Maltz, J. Herlocker, L. Gordon, J. Riedl. “Grou-pLens: Applying Collaborative Filtering to Usenet News”. Communications of the ACM, Vol.40, No.3, pp.77–87, 1997.
A. Nanopoulos, D. Katsaros, Y. Manolopoulos. “A Data Mining Algorithm for Generalized Web Prefetching”. IEEE Transactions on Knowledge and Data Engineering, in print, 2003.
A. Nanopoulos, Y. Manolopoulos. “Efficient Similarity Search for Market Basket Data”. The VLDB Journal, Vol.11, No.2, pp.138–152, 2002.
J. Park, M-S. Chen, P. Yu. “Using a Hash-Based Method with Transaction Trimming for Mining Association Rules”. Transactions on Knowledge and Data Engineering, Vol.9, No.5, pp.813–825, 1997.
N. Roussopoulos, S. Kelley, F. Vincent. “Nearest Neighbor Queries”. Proceedings ACM International Conference on Management of Data (SIGMOD’95), pp.71–79, San Jose, CA, 1995.
R. Sacks-Davis, K. Ramamohanarao. “A Two Level Superimposed Coding Scheme for Partial Match Retrieval”. Information Systems, Vol.8, No.4, pp.273–289, 1983.
B. Sarwar, G. Karypis, J. Konstan, J. Riedl. “Application of Dimensionality Reduction in Recommender Systems”. WebKDD Workshop, Boston, MA, 2000.
B. Sarwar, G. Karypis, J. Konstan, J. Riedl. “Analysis of Recommendation Algorithms for E-commerce”. Proceedings ACM Conference on Electronic Commerce 2000 (EC’2000), pp. 158–167, Minneapolis, MN, 2000.
E. Tousidou, A. Nanopoulos, Y. Manolopoulos. “Improved Methods for Signature Tree Construction”. The Computer Journal, Vol.43, No.4, pp.301–314, 2000.
K. Wang, C. Xu, B. Liu. “Clustering Transactions Using Large Items”. Proceedings 8th International Conference on Information and Knowledge Management (CIKM’99), pp.483–490, Kansas City, Missouri, 1999.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Manolopoulos, Y., Nanopoulos, A., Tousidou, E. (2003). Retrieving Similar Web-User Behaviors. In: Advanced Signature Indexing for Multimedia and Web Applications. Advances in Database Systems, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8636-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8636-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4654-8
Online ISBN: 978-1-4419-8636-8
eBook Packages: Springer Book Archive