Skip to main content
SpringerLink
Log in

Measuring Influence of an Item in Time-Stamped Databases

  • Chapter
  • First Online:
Advances in Knowledge Discovery in Databases

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 79))

  • 1236 Accesses

Abstract

Influence of items on some other items might not be the same as the association between these sets of items. Many tasks of data analysis are based on expressing influence of items on other items. In this chapter, we introduce the notion of an overall influence of a set of items on another set of items. We also discuss an extension to the notion of overall association between two items in a database. Using this notion, we have designed two algorithms of influence analysis involving specific items in a database. As the number of databases increases on a yearly basis, we have adopted incremental approach to these algorithms. Experimental results are reported on both synthetic and real-world databases.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Frequent itemset mining dataset repository, http://fimi.cs.helsinki.fi/data.

  2. 2.

    UCI ML repository, http://www.ics.uci.edu/~mlearn/MLSummary.html.

References

  • Adhikari A, Ramachandrarao P, Pedrycz W (2011) Study of select items in different data sources by grouping. Knowl Inf Syst 27(1):23–43

    Article  Google Scholar 

  • Adhikari A, Rao PR (2008a) Mining conditional patterns in a database. Pattern Recogn Lett 29(10):1515–1523

    Article  Google Scholar 

  • Adhikari A, Rao PR (2008b) Synthesizing heavy association rules in different real data sources. Pattern Recogn Lett 29(1):59–71

    Article  Google Scholar 

  • Adhikari A, Rao PR (2007) A framework for mining arbitrary Boolean expressions induced by frequent itemsets. In: Proceedings of the international conference on artificial intelligence, pp 5–23

    Google Scholar 

  • Adhikari J, Rao PR (2010) Measuring influence of an item in a database over time. Pattern Recogn Lett 31(3):179–187

    Article  Google Scholar 

  • Adhikari J, Rao PR, Adhikari A (2009) Clustering items in different data sources induced by stability. Int Arab J Inf Technol 6(4):66–74

    Google Scholar 

  • Aggarwal C, Yu P (1998) A new framework for itemset generation. In: Proceedings of PODS, pp 18–24

    Google Scholar 

  • Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD conference management of data, pp 207–216

    Google Scholar 

  • Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the international conference on very large databases, pp 487–499

    Google Scholar 

  • Brin S, Motwani R, Ullman JD, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 255–264

    Google Scholar 

  • Greenwood PE, Nikulin MS (1996) A Guide to Chi-Squared testing. Wiley-Interscience

    Google Scholar 

  • Han J, Pei J, Yiwen Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the ACM-SIGMOD international conference management of data, pp 1–12

    Google Scholar 

  • Knuth DE (1998) The art of computer programming, sorting and searching. Vol 3, Addison-Wesley

    Google Scholar 

  • Savasere A, Omiecinski E, Navathe S (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of the international conference on very large data bases, pp 432–443

    Google Scholar 

  • Shapiro P (1991) Discovery, analysis, and presentation of strong rules. In: Proceedings of knowledge discovery in databases, pp 229–248

    Google Scholar 

  • Tan PN, Kumar V, Srivastava J (2003) Selecting the right interestingness measure for association patterns. In: Proceedings of SIGKDD conference, pp 32–41

    Google Scholar 

  • Wu X, Zhang C, Zhang S (2004) Efficient mining of both positive and negative association rules. ACM Trans Inf Sys 22(3):381–405

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Parvatibai Chowgule College, Margao, Goa, India

    Animesh Adhikari

  2. Department of Computer Science, Narayan Zantye College, Bicholim, Goa, India

    Jhimli Adhikari

Authors
  1. Animesh Adhikari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jhimli Adhikari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Animesh Adhikari .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Adhikari, A., Adhikari, J. (2015). Measuring Influence of an Item in Time-Stamped Databases. In: Advances in Knowledge Discovery in Databases. Intelligent Systems Reference Library, vol 79. Springer, Cham. https://doi.org/10.1007/978-3-319-13212-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13212-9_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13211-2

  • Online ISBN: 978-3-319-13212-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation