Skip to main content

Heuristic for Context Detection in Time Varying Domains

  • Conference paper
  • 3663 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 327))

Abstract

The primary goal is to find information of co-existing commodities called itemsets in transactional databases. Especially in business to make a proper decision, the knowledge of high support itemset is very important. For example: A business can avoid giving discounts on an item which is more in demand though it is one of the commodities of the same itemset. This phenomenal product’s information must be known to data analyst. As we see the change becomes mandatory as the season changes. So it has a great effect on buying habits of customers, not only on the season but also newly introduced merchandise [2, 5, 6]. The primary duty of data analyst is to detect these changes i,e which high-support itemsets withstand the change and which itemset among itself vanishes and which new itemsets emerge. To take this challenge we use a window of the latest market-basket which shows variation in its size time to time. The window grows in the periods of stability, producing an information of the current context. The window reduces in size, once the change is detected. The main objective of this paper is to introduce a new operator for controlling the window size.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rozyspal, A., Kubat, M.: Association Mining in Time-varying Domain (2003)

    Google Scholar 

  2. Raghavan, V.V., Hafez, A.: Dynamic Data Mining. In: Proc. 13th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE, New Orleans, Louisiana, pp. 220–229 (June 2000)

    Google Scholar 

  3. Aumann, Y., Lindell, Y.: A Statistical Theory for Quantitative Association Rules. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, August 15–18, pp. 261–270 (1999)

    Google Scholar 

  4. Bayardo, R.J., Agrawal, R.: Mining the Most Interesting Rules. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, California, pp. 145–154 (1999)

    Google Scholar 

  5. Pitkow, P.: Proceedings of the 6th International WWW Conference Search of Reliable Usage of Data on the WWW, Santa Clara, California (1997)

    Google Scholar 

  6. Cheung, D.W., Han, J.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisiana (1996)

    Google Scholar 

  7. Agrawal, R., Shafer, J.C.: Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering 8, 962–969 (1996)

    Article  Google Scholar 

  8. Cheung, D.W., J., H.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisiana (1996)

    Google Scholar 

  9. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307–328 (1996)

    Google Scholar 

  10. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the 20th International Conference on Very Large Databases, pp. 478–499 (1994)

    Google Scholar 

  11. Jain, A.K., Dubes, R.C.: Algorithms for clustering Data. Prentice Hall, Englewood Cliffs (1988)

    Google Scholar 

  12. Jobson, J.D.: Applied Multivariate Data Analysis. Categorical and Multivariate Methods, vol. II. Springer Verlag,

    Google Scholar 

  13. IBM Generated fimi datasets, http://fimi.ua.ac.be/data/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sujatha Dandu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dandu, S., Deekshatulu, B.L. (2015). Heuristic for Context Detection in Time Varying Domains. In: Satapathy, S., Biswal, B., Udgata, S., Mandal, J. (eds) Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014. Advances in Intelligent Systems and Computing, vol 327. Springer, Cham. https://doi.org/10.1007/978-3-319-11933-5_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11933-5_61

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11932-8

  • Online ISBN: 978-3-319-11933-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics