<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>Classical association rules, here called "direct", reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, "third" pages, called transitive, with which they appear relatively frequently. Two types of indirect associations rules are described in the paper: partial indirect associations and complete ones. The former respect single transitive pages, while the latter cover all existing transitive pages. The presented IDARM* Algorithm extracts complete indirect association rules with their important measure—confidence—using pre-calculated direct rules. Both direct and indirect rules are joined into one set of complex association rules, which may be used for the recommendation of web pages. Performed experiments revealed the usefulness of indirect rules for the extension of a typical recommendation list. They also deliver new knowledge not available to direct ones. The relation between ranking lists created on the basis of direct association rules as well as hyperlinks existing on web pages is also examined.</p></abstract>

Classical association rules, here called "direct", reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, "third" pages, called transitive, with which they appear relatively frequently. Two types of indirect associations rules are described in the paper: partial indirect associations and complete ones. The former respect single transitive pages, while the latter cover all existing transitive pages. The presented IDARM* Algorithm extracts complete indirect association rules with their important measure—confidence—using pre-calculated direct rules. Both direct and indirect rules are joined into one set of complex association rules, which may be used for the recommendation of web pages. Performed experiments revealed the usefulness of indirect rules for the extension of a typical recommendation list. They also deliver new knowledge not available to direct ones. The relation between ranking lists created on the basis of direct association rules as well as hyperlinks existing on web pages is also examined.

Mining Indirect Association Rules for Web Recommendation

Institute of Informatics, Wrocław University of Technology, ul. Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland

International Journal of Applied Mathematics and Computer Science

{"article-title":"Mining Indirect Association Rules for Web Recommendation"}

Classical association rules, here called "direct", reflect relationships existing between items that relatively often co-occur in common transactions. In the...

Mining Indirect Association Rules for Web Recommendation

Data publikacji: 02 kwi 2009

Zakres stron: 165 - 186

DOI: https://doi.org/10.2478/v10006-009-0015-5

Słowa kluczowe
association rules, indirect association rules, recommender system, web mining, web usage mining

This content is open access.

Mining Indirect Association Rules for Web Recommendation

Data publikacji: 02 kwi 2009

Zakres stron: 165 - 186

DOI: https://doi.org/10.2478/v10006-009-0015-5

Słowa kluczoweassociation rules, indirect association rules, recommender system, web mining, web usage mining

This content is open access.

Słowa kluczowe
association rules, indirect association rules, recommender system, web mining, web usage mining