Skip to main content

The Categorical Distinction Annexations to Maximal Associations Discovered from Web Database by Rough Set Theory to Increase the Quality

  • Chapter
Advances in Communication Systems and Electrical Engineering

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

  • 975 Accesses

Most of the sectors transferred their information to the internet environment once the technology used became widespread and cheap. Print media organizations, which have a vital role in informing public opinion, and the data that are the services of these organizations are also shared over internet media. The fact that the continuously increasing amount of data includes the rich data it causes interesting and important data to be overlooked. Having large numbers of responses returned from queries about a specific event, person or place brings query owners face to face with unwanted or unrelated query results. Therefore, it is necessary to access textual data in press-publication sources that are reachable over internet in a fast and effective way and to introduce studies about producing meaningful and important information from these resources.

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 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
Hardcover Book
USD 219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal R, Imielinski T, Swami A (1993) Mining Association Rules between Sets of Items in Large Databases. In: Proc. of ACM SIGMOD Conf. on Management of Data. Washington, D.C., United States, pp. 207–216

    Google Scholar 

  2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc. 20th Very Large Databases Conference in Santiego Chile, pp. 487–499

    Google Scholar 

  3. Bi Y, Anderson T, McClean S (2003) A rough set model with ontologies for discovering maximal association rules in document collections. J Knowledge-Based Systems 16:243–251

    Article  Google Scholar 

  4. Chen WC, Tseng SS, Wang CY (2005) A novel manufacturing defect detection method using association rule mining techniques. J Expert Systems with Applications 29:807–815

    Article  Google Scholar 

  5. Clare A, Williams HE, Lester N (2004) Scalable multi-relational association mining. In: Proc. of the Fourth IEEE Int. Conf. on Data Mining (ICDM’04). Brighton, UK, pp. 355–358

    Google Scholar 

  6. Coenen F, Leng P, Ahmed S (2004) Data structure for association rule mining: t-trees and p-trees. IEEE Transactions on Knowledge and Data Engineering 16(6):774–778

    Article  Google Scholar 

  7. Do TD, Hui SC, Fong AC (2005) Mining class association rules with artificial immune system. Lecture Notes in Computer Science 3684:94–100

    Google Scholar 

  8. Doddi S, Marathe A, Ravi SS, Torney DC (2001) Discovery of association rules in medical data. Medical Informatics and the Internet in Medicine 26:25–33

    Article  Google Scholar 

  9. Feldman R, Aumann Y, Amir A, Zilberstein A, Kloesgen W (1997) Maximal association rules: a new tool for mining for keywords cooccurrences in document collections. In: Proc. of the Third Int. Conf. on Knowledge Discovery (KDD’1997). Newport Beach, CA, pp. 167–170

    Google Scholar 

  10. Feldman R, Fresko M, Kinar Y, Lindell Y, Liphostat O, Rajman M, Schler Y, Zamir O (1998) Text mining at the term level. In: Proc. of the 2nd European Symposium on Knowledge Discovery in Databases. Lecture Notes in Computer Science 1510:65–73

    Article  Google Scholar 

  11. Guan JW, Bell DA, Liu DY (2003) The rough set approach to Association Rule Mining. In: Proc. of the Third IEEE International Conference on Data Mining (ICDM’03). Melbourne, Florida, USA, pp. 529–532

    Google Scholar 

  12. Guo JY (2003) Rough set-based approach to data mining. Ph.D. thesis, Case Western Reserve University

    Google Scholar 

  13. Han J, Kamber M (2001) Data Mining Concepts and Techniques. Academic Press, San Diego, USA

    Google Scholar 

  14. Hong TP, Lin KY, Wang SL (2003) Fuzzy data mining for interesting generalized association rules. J Fuzzy Sets and Systems 138:255–269

    Article  MathSciNet  Google Scholar 

  15. Huang Z, Hu YQ (2003) Applying AI technology and Rough Set Theory to mine association rules for supporting knowledge management. In: Proc. Of Second Int. Conf. on Machine Learning and Cybernetics. 3:1820–1825

    Google Scholar 

  16. Hu XG, Wang DX, Liu XP, Guo J, Wang H (2004) The analysis on model of association rules mining based on concept lattice and apriori algorithm. In: Proc. of the Third International Conference on Machine Learning and Cybernetics in Shangai, pp. 1620–1624

    Google Scholar 

  17. Iváncsy R, Juhász S, Kovács F (2004) Performance prediction for association rule mining algorithms. In: Proc. of the IEEE International Conference on Cybernetics, Vienna, Austria, pp. 265–271

    Google Scholar 

  18. Ivkovic S, Yearwood J, Stranieri A (2002) Discovering interesting association rules from legal databases. Information and Communications Technology Law 11:35–47

    Article  Google Scholar 

  19. Le SC, Huang MJ (2002) Applying AI technology and rough set theory for mining association rules to support crime management and fire-fighting resources allocation. J Information, Technology and Society. 2002(2):65–78

    Google Scholar 

  20. Lee HS (2005) Incremental association mining based on maximal itemsets. Lecture Notes in Computer Science 3681:365–371

    Google Scholar 

  21. Li C, Yang M (2004) Association rules data mining in manufacturing information System based on Genetic Algorithms. In: Third Int. Conf. On Computational Electromagnetics and Its Applications Proceedings. Beijing, China, pp. 153–156

    Google Scholar 

  22. Liu XW, He PL (2004) The research of improved association rules mining apriori algorithm. In: Proc. of the Third International Conference on Machine Learning and Cybernetics in Shangai, pp. 1577–1579

    Google Scholar 

  23. Loo KK, Lap YC, Kao B, Cheung D (2000) Exploiting the duality of maximal frequent itemsets and minimal infrequent itemsets for i/o efficient association rule mining. Lecture Notes in Computer Science 1873:710–719

    Article  Google Scholar 

  24. Ma X, Ma J (2004) Rough set model for discovering single-dimensional and multidimensional association rules. IEEE International conference on Systems, Man and Cybernetics 4:3531–3536

    Google Scholar 

  25. Pawlak Z (1982) Rough sets. International J Cooperative Information Systems 1:335–376

    Google Scholar 

  26. Polkowski L, Skowron A (1998) Rough Sets in Knowledge Discovery Part I. Physica-Verlag, New York, USA

    Google Scholar 

  27. Saggar M, Agrawal AK, Lad A (2004) Optimization of association rule mining using improved genetic algorithms. IEEE Int. Conf. On Systems, Man and Cybernetics 4:3725–3729

    Google Scholar 

  28. Sartipi K, Kontogiannis K (2001) Component clustering based on maximal association. In: Proc. Working Conf. on Reverse Engineering (WCRE’01). Suttgart, Germany, pp. 103–114

    Google Scholar 

  29. Satoh K, Uno T (2003) Enumerating maximal frequent sets using irredundant dualization. Lecture Notes in Computer Science 2843:256–268

    Article  Google Scholar 

  30. Techapichetvanich K, Datta A (2004) Visual mining of market basket association rules. Lecture Notes In Computer Science 3046:479–488

    Google Scholar 

  31. Ülker E, Sıramkaya E, çomak E, Uğuz H, Arslan A (2005) Finding Regular Association Rules by applying the apriori algorithm. In: Proc. Of 4th International Advanced Technologies Symposium (IATS). Konya, Turkey, pp. 59–62

    Google Scholar 

  32. Vincenti G, Hammell RJ, Trajkovski G (2005) Data mining for imprecise temporal associations. In: Proc. Of sixth Int. Conf. On Software Engineering, AI, Networking and Parallel/Distributed Computing (SNPD/SAWN’05). Maryland, USA, pp. 76–81

    Google Scholar 

  33. Wang QD, Wang XJ, Wang XP (2002) Variable precision rough set model based dataset partition and association rule mining. In: Proc. Of First Int. Conf. On Machine learning and Cybernetics. Beijing, China, pp. 2175–2179

    Google Scholar 

  34. http://www.isikun.edu.tr/isam/teror/Graph_Teror.htm

  35. Yan X, Zhang C, Zhang S (2005) ARMGA: Identifying interesting association rules with genetic algorithms. J Applied Artificial Intelligence 19:677–689

    Article  Google Scholar 

  36. Zhang S, Lu J, Zhang C (2004) A fuzzy logic based method to acquire user threshold of minimum-support for mining association rules. J Information Sciences 164:1–16

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Ülker, E., Siramkaya, E., Arslan, A. (2008). The Categorical Distinction Annexations to Maximal Associations Discovered from Web Database by Rough Set Theory to Increase the Quality. In: Huang, X., Chen, YS., Ao, SI. (eds) Advances in Communication Systems and Electrical Engineering. Lecture Notes in Electrical Engineering, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74938-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-74938-9_18

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-74937-2

  • Online ISBN: 978-0-387-74938-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics