Skip to main content
SpringerLink
Log in

Promoting where, when and what? An analysis of web logs by integrating data mining and social network techniques to guide ecommerce business promotions

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

A Notice to this article was published on 12 September 2016

Abstract

The rapid development of the internet introduced new trend of electronic transactions that is gradually dominating all aspects of our daily life. The amount of data maintained by websites to keep track of the visitors is growing exponentially. Benefitting from such data is the target of the study described in this paper. We investigate and explore the process of analyzing log data of website visitor traffic in order to assist the owner of a website in understanding the behavior of the website visitors. We developed an integrated approach that involves statistical analysis, association rules mining, and social network construction and analysis. First, we analyze the statistical data on the types of visitors that come to the website, as well as the steps they take to reach and satisfy the goal of their visit. Second, we derive association rules in order to identify the correlations between the web pages. Third, we study the links between the web pages by constructing a social network based on the frequency of access to the web pages such that two web pages get linked in the social network if they are identified as frequently accessed together. The value added from the overall analysis of the website and its related data should be considered valuable for ecommerce and commercial website owners; the owners will get the information needed to display targeted advertisements or messages to their customers. Such an automated approach gives advantage to its users in the current competitive cyberspace. In the long run, this is expected to allow for the increase in sales and overall customer loyalty.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. http://machines.hyperreal.org/.

  2. http://www.cs.washington.edu/ai/adaptive-data/.

References

  • Abiteboul S, Preda M, Cobena G (2003) Adaptive on-line page importance computation. In: Proceedings of the international Conference on World Wide Web, pp 280–290

  • Adnan M, Alhajj R, Rokne JG (2009) Identifying social communities by frequent pattern mining, IV, pp 413–418

  • Ardissono L, Torasso P (2000) Dynamic user modeling in a web store shell. In: Proceedings of the conference European conference on artificial intelligence, Berlin, Germany, pp 621–625

  • Batagelj V (2003) Analysis of large networks—islands presented at Dagstuhl seminar 03361: algorithmic aspects of large and complex networks Dagstuhl

  • Batagelj V, Mrvar A (1998) Pajek—program for large network analysis. http://vlado.fmf.uni-lj.si/pub/networks/pajek/

  • Borodin A, Roberts GO, Rosenthal JS, Tsaparas P (2005) Link analysis ranking: algorithms, theory, and experiments. ACM Trans Internet Technol 5(1):231–297

    Article  Google Scholar 

  • Borges J, Levene M (1999) Data mining of user navigation patterns. In: Proceedings of workshop on web usage analysis and user profiling (WEBKDD), in conjunction with ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, CA, pp 31–36

  • Brin S, Motwani R, Page L, Winograd T (1998) What can you do with a web in your pocket. Bull IEEE Comput Soc Tech Comm Data Eng 21:37–47

    Google Scholar 

  • Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the seventh international World Wide Web conference

  • Catledge LD, Pitkow JE (1995) Characterizing browsing strategies in the World-Wide Web. Comput Netw ISDN Syst 27(6):1065–1073

    Article  Google Scholar 

  • Chen Z, Fu AW-C, Tong FC-H (2004) Optimal algorithms for finding user access sessions from very large web logs. J World Wide Web 6:259–279

    Google Scholar 

  • Chakrabarti S, Dom B, Gibson D, Kleinberg J, Raghavan P, Rajagopalan S (1998) Automatic resource compilation by analyzing hyperlink structure and associated text. In: Proceedings of the international conference on World Wide Web

  • Cho J, Roy S, Adams RE (2005) Page quality: in search of an unbiased web ranking. In: Proceedings of ACM SIGMOD, pp 551–562

  • Cooley R, Mobasher B, Srivastavaa J (1999) Data preparation for mining World Wide Web browsing patterns. J Knowl Inform Syst 1(1):32–55

    Google Scholar 

  • Dean J, Henzinger M (1999) Finding related pages in the World Wide Web. In: Proceedings of the international conference on World Wide Web

  • da Costa LF, Rodrigues FA, Travieso G, Villas Boas PR (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56:167–242

    Article  Google Scholar 

  • Freeman LC, Borgatti SP, White DR (1991) Centrality in valued graphs: a measure of betweenness based on network flow. Soc Netw 13(2):141–154

    Article  MathSciNet  Google Scholar 

  • Fu Y, Sandhu K, Shih MY (1999) Clustering of webusers based on access patterns. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

  • Han EH, Karypis G, Kumar V, Mobasher B (1997) Clustering based on association rule hypergraphs. In: Proceedings of the workshop on research issues on data mining and knowledge discovery, Tucson, Arizona, pp 9–13

  • Hsu WH, King A, Paradesi MS, Pydimarri T, Weninger T (2006) Collaborative and structural recommendation of friends using weblog-based social network analysis. In: AAAI spring symposium on computational approaches to analyzing weblogs (CAAW), vol SS-06-03, Menlo Park, CA, pp 55–60

  • Hou J, Zhang Y (2003) Effectively finding relevant web pages from linkage information. IEEE Trans Knowl Data Eng 15(4):940–951

    Article  Google Scholar 

  • Karypis G, Aggarwal R, Kumar V, Shekhar S (1997) Multilevel hypergraph partitioning: applications in VLSI domain. In: Proceedings ACM/IEEE design automation conference

  • Kleinberg J (1998) Authoritative sources in a hyperlinked environment. In: Proceedings of the ninth annual ACM-SIAM symposium on discrete algorithms, pp 668–677

  • Kobsa A, Koenemann J, Pohl W (2001) Personalized hypermedia presentation techniques for improving online customer relationships. Knowl Eng Rev 16(2):111–155

    Article  MATH  Google Scholar 

  • Le TV, Kulikowski CA, Muchnik IB (2008) Coring method for clustering a graph. ICPR 2008, pp 1–4

  • Lee S, Yong HS (2005) Web personalization: my own web based on open content platform. Web Information Systems Engineering, WISE 2005, 3806, pp 731–739

  • Li CH, Chui CK (2005) Web structure mining for usability analysis. In: Proceedings of IEEE/WIC/ACM international conference on web intelligence, pp 309–312

  • Massa P, Hayes C (2005) Page-rerank: using trusted links to re-rank authority. In: Proceedings of IEEE/WIC/ACM international conference on web intelligence, pp 614–617

  • Pirolli P, Pitkow J, Rao R (1996) Silk from a sow’s ear: extracting usable structures from the Web. In: CHI ’96: Proceedings of the SIGCHI conference on human factors in computing systems, pp 118–125

  • R Development Core Team (2009) R: a language and environment for statistical computing, reference index version 2.10.1. R Foundation for Statistical Computing

  • Schafer B, Konstan JA, Riedl J (2001) E-commerce recommendation applications, data mining and knowledge discovery, vol 5(1–2). Kluwer Academic Publishers, Boston, pp 115–152

  • Shahabi C, Zarkesh AM, Abidi J, Shah V (1997) Knowledge discovery fromuser’s Webpage navigation. In: Proceedings of the IEEE international workshop on research issues in data engineering (RIDE), pp 20–29

  • Yan X, Han J, Afshar R (2003) CloSpan: mining closed sequential patterns in large datasets. In: Proceedings of 2003 SIAM international conference on data mining, SDM’ 03

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Muhaimenul Adnan, Keivan Kianmehr & Jon Rokne

  2. Department of Computing, School of Computing Informatics and Media, University of Bradford, Bradford, UK

    Mohamad Nagi & Mick Ridley

  3. Department of Electrical and Computer Engineering, Palestine Polytechnic University, Hebron, Palestinian Authority

    Radwan Tahboub

Authors
  1. Muhaimenul Adnan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamad Nagi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Keivan Kianmehr
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Radwan Tahboub
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mick Ridley
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jon Rokne
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamad Nagi.

Additional information

A comment to this article is available at http://dx.doi.org/10.1007/s13278-016-0375-4.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adnan, M., Nagi, M., Kianmehr, K. et al. Promoting where, when and what? An analysis of web logs by integrating data mining and social network techniques to guide ecommerce business promotions. Soc. Netw. Anal. Min. 1, 173–185 (2011). https://doi.org/10.1007/s13278-010-0015-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13278-010-0015-3

Keywords

Search

Navigation