%0 Journal Article %1 1751918 %A Du, YaJun %A Li, HaiMing %C Amsterdam, The Netherlands, The Netherlands %D 2010 %I Elsevier Science Publishers B. V. %J Appl. Soft Comput. %K association fca mining rules web %N 3 %P 772--783 %R 10.1016/j.asoc.2009.09.007 %T Strategy for mining association rules for web pages based on formal concept analysis %U http://portal.acm.org/citation.cfm?id=1751675.1751918 %V 10 %X To avoid returning irrelevant web pages for search engine results, technologies that match user queries to web pages have been widely developed. In this study, web pages for search engine results are classified as low-adjacence (each web page includes all query keywords) or high-adjacence (each web page includes some of the query keywords) sets. To match user queries with web pages using formal concept analysis (FCA), a concept lattice of the low-adjacence set is defined and the non-redundancy association rules defined by Zaki for the concept lattice are extended. OR- and AND-RULEs between non-query and query keywords are proposed and an algorithm and mining method for these rules are proposed for the concept lattice. The time complexity of the algorithm is polynomial. An example illustrates the basic steps of the algorithm. Experimental and real application results demonstrate that the algorithm is effective.

@article{1751918, abstract = {To avoid returning irrelevant web pages for search engine results, technologies that match user queries to web pages have been widely developed. In this study, web pages for search engine results are classified as low-adjacence (each web page includes all query keywords) or high-adjacence (each web page includes some of the query keywords) sets. To match user queries with web pages using formal concept analysis (FCA), a concept lattice of the low-adjacence set is defined and the non-redundancy association rules defined by Zaki for the concept lattice are extended. OR- and AND-RULEs between non-query and query keywords are proposed and an algorithm and mining method for these rules are proposed for the concept lattice. The time complexity of the algorithm is polynomial. An example illustrates the basic steps of the algorithm. Experimental and real application results demonstrate that the algorithm is effective.}, added-at = {2010-04-13T09:23:44.000+0200}, address = {Amsterdam, The Netherlands, The Netherlands}, author = {Du, YaJun and Li, HaiMing}, biburl = {https://www.bibsonomy.org/bibtex/20215d19a36c44a9b78ac16774549a2b9/obj}, description = {Strategy for mining association rules for web pages based on formal concept analysis}, doi = {10.1016/j.asoc.2009.09.007}, interhash = {825a1a90a944f18adf6395c6ac180ddb}, intrahash = {0215d19a36c44a9b78ac16774549a2b9}, issn = {1568-4946}, journal = {Appl. Soft Comput.}, keywords = {association fca mining rules web}, number = 3, pages = {772--783}, publisher = {Elsevier Science Publishers B. V.}, timestamp = {2010-04-13T09:23:44.000+0200}, title = {Strategy for mining association rules for web pages based on formal concept analysis}, url = {http://portal.acm.org/citation.cfm?id=1751675.1751918}, volume = 10, year = 2010 }