Skip to main content

Evaluation the Objectivity Measurement of Frequent Patterns

  • Chapter
  • First Online:
Intelligent Automation and Systems Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 103))

  • 987 Accesses

Abstract

Frequent pattern mining is a basic problem in data mining and knowledge discovery. The discovered patterns can be used as the input for analyzing association rules, mining sequential patterns, recognizing clusters, and so on. However, there is a posed question that how is objectivity measurement of frequent patterns? Specifically, in market basket analysis problem to find out association rules, whether or not the frequent patterns discovered represent exactly the needs of all customers. Or, these frequent patterns were only created by a few customers with too many purchases. In this paper, a mathematical space will be introduced with some new related concepts and propositions to design a new algorithm answering the above questions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

References

  • Adamo JM (2006) Data mining for association rules and sequential patterns. Springer, New York

    Google Scholar 

  • Agrawal R, Shafer JC (1996) Parallel mining of association rules. IEEE Trans Knowledge Data Eng 8:962–969

    Article  Google Scholar 

  • Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, Santiago, Chile

    Google Scholar 

  • Han J, Kamber M (2006) Data mining: concepts and techniques, 2nd edn. Morgan Kaufmann, San Francisco

    Google Scholar 

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

    Google Scholar 

  • Kosala R, Blockeel H (2000) Web mining research: a survey. SIGKKD Explorations 2(1):1–15

    Article  Google Scholar 

  • Nguyen PK, Nguyen TT (2010) The objectivity measurement of frequent patterns. In: Proceedings of the world congress on engineering and computer science, WCECS 2010, Lecture notes in engineering and computer science, San Francisco, 20–22 Oct 2010, pp 439–444

    Google Scholar 

  • Ye N (2003) The handbook of data mining. Lawrence Erlbaum, Mahwah

    Google Scholar 

  • Zaki MJ, Ogihara M, Parthasarathy S, Li W (1996) Parallel data mining for association rules on shared-memory multiprocessors. Technical Report TR618

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Phi-Khu Nguyen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Nguyen, PK., Nguyen, TT. (2011). Evaluation the Objectivity Measurement of Frequent Patterns. In: Ao, SI., Amouzegar, M., Rieger, B. (eds) Intelligent Automation and Systems Engineering. Lecture Notes in Electrical Engineering, vol 103. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0373-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-0373-9_21

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-0372-2

  • Online ISBN: 978-1-4614-0373-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics