Open Access Open Access  Restricted Access Subscription or Fee Access

Karnaugh Map Model for Mining Association Relationships in Web Content Data: Hypertext

Vikrant Sabnis, Neelu Khare, R.S. Thakur, K.R. Pardasani

Abstract


Web content mining refers to description and discovery of useful information from the web contents/data /documents.
Hypertext is one of the most common web content data that has hyperlinks in addition to text. These are modeled with multiple levels of details depending on the application. In this paper Karnaugh map model for multilevel association rule mining has been developed to investigate association relationships among hypertexts of a web site. Karnaugh map model needs single scan of data and stores the information in the form of frequency. Model adopts progressively deepening approach for finding large text sets by utilizing karnaugh map logic for finding frequent text sets at each level of abstraction. Frequent texts sets are generated by the karnaugh map model are used to discover strong association relationships among hypertexts at different levels of abstraction. Further the rules are categorized under three categories and their behavior is studied across the level of abstractions.


Keywords


Karnaugh Map Model, Multilevel Association Rules, Association Relationships, Frequent Text Set

Full Text:

PDF

References


Margaret H. Dunham, “Data Mining Introductory & Advanced Topics”, Pearson Education,2006.

Qingyu Zhang and Richard S. Segall, “Web mining: a survey of current research,Techniques, and software”, International Journal of Information Technology & Decision Making Vol. 7, No. 4 683–720 (2008).

Tao Jiang, Ah-Hwee Tan, “Mining Generalized Associations of Semantic Relations from Textual Web Content” IEEE transactions on knowledge and data engineering, vol. 19, no. 2, February (2007).

Kshitija Pol, Nita Patil, “A Survey on Web Content Mining and extraction of Structured and Semistructured data” First International Conference on Emerging Trends in Engineering and Technology (2008)

Cheng Wang, Ying Liu, “A Utility-based Web Content Sensitivity Mining Approach IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (2008).

Swe Swe Nyein, “Mining Contents in Web Page Using Cosine Similarity” 978-1-61284-840-2/11, IEEE (2011).

Tarique Anwar, Muhammad Abulaish, “Web Content Mining for Alias Identification: a first step towards suspect tracking”

-1-61284-4577-0085-9, IEEE, 2011.

Jing Li and C.I. Ezeife, “Cleaning Web Pages for Effective Web Content Mining” 2006.

Neelu Khare, Neeru Adlakha, K. R. Pardasani,"An Algorithm for Mining Multidimensional Fuzzy Association Rules," International Journal of Computer Science and Information Security, Vol.5, pp.72-76, 2009.

J. Han, M. Kamber, "Data Mining: Concepts and Techniques," The Morgan Kaufmann Series, 2001.

C. J. Kaufman, Rocky Mountain Research Lab., Boulder, CO, private communication, May 1995.

Neelu Khare, Neeru Adlakha and K. R. Pardasani, “Karnaugh Map Model for Mining Association Rules in Large Databases”, (IJCNS) International Journal of Computer and Network Security, Vol. 1, No. 1, pp:16-21,October 2009.

R.S. Thakur, R.C. Jain, K.R.Pardasani, "Fast Algorithm for Mining Multilevel Association Rule Mining," Journal of Computer Science, Vol. 1, pp: 76-81, 2007.

Mehmet Kaya, Reda Alhajj, "Mining Multi-Cross-Level Fuzzy Weighted Association Rules," Second IEEE International Conference on Intelligent Systems, vol., pp.225- 230, 2004..

Ha and Y. Fu, “Mining Multiple-Level Association Rules in Large Databases, “IEEE TKDE, Vol. 01, pp-798-805, 1999.

Cooley, R, Mobasher, B & Srivastava, WebMining: Information and Pattern Discovery on the WorldWideWeb,htto://wwwusers.cs.umn.edu/ mohaher/webminer/surve vsurve~.html. (1999).

R. Agrawal and R. Srikant. Fast algorithms for mining association rules. 487-499, Santiago, Chile VLDB94,1994.

Zheng, Zijian, Kohavi, Ron, and Mason, Llew, “Real World Performance of Association Rule Algorithms”. In proceedings of the Seventh ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, Califomia, August 2001.

J. Do¨ rre, P. Gerstl, and R. Seiffert, “Text Mining: Finding nuggets in Mountains of Textual Data,” Proc. Int’l Conf. Knowledge Discovery and Data Mining, pp. 398-401, 1999.

A. H. Tan, “Text Mining: The State of the Art and the Challenges,” Proc. Pacific Asia Conference on Knowledge Discovery and Data Mining Workshop Knowledge Discovery from Advanced Databases, pp.-65-70, 1999.

Pratima Gautam, K. R. Pardasani ”A Fast Algorithm for Mining Multilevel Association Rule Based on Boolean Matrix”, (IJCSE) International Journal on Computer Science and Engineering,Vol. 02, No. 03, pp- 746-752,2010.

Pratima Gautam, Neelu Khare, K. R Pardasani,”A Model For Mining Multilevel Fuzzy Association Rule In Database”, Journal Of Computing, Volume 2, Issue 1, pp- 2151-9617 , January 2010.

Yeong-Chyi Lee, Tzung-Pei Hong, Tien-Chin Wang, “Multi-level fuzzy mining with multiple minimum supports” Expert Systems with Applications 34, pp-459–468 (2008).

www.wikipedia.org.

Przemysław Kazienko,” Mining Indirect Association Rules For WebRecommendation”, Int. J. Appl. Math. Comput. Sci., Vol. 19, No. 1, pp-165–186, 2009.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.