Skip to Main Content
Building an Intelligent Web: Theory and Practice
book

Building an Intelligent Web: Theory and Practice

by Pawan Lingras, Rajendra Akerkar
March 2010
Intermediate to advanced content levelIntermediate to advanced
326 pages
12h 25m
English
Jones & Bartlett Learning
Content preview from Building an Intelligent Web: Theory and Practice
“4137X˙CH04˙Akerkar” 2007/9/17 11:02 page 163 #45
4.4 Association 163
ation rules in which the user is interested. The user can state the constraint to specify which
grouping of items is of his interest.
In this section, we will introduce the reader to the association rules and the a priori
algorithm that can be used to discover such rules.
4.4.1 a priori Algorithm
Suppose that A = {l
1
,l
2
, ...l
m
} is a set of items and T is a set of transactions, where each
transaction t is a set of items. Thus, t is a subset of A.
A transaction t is said to support an item l
i
,ifl
i
is present in t. t is said to support a
subset of items X A,ift supports ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Reinventing the Organization for GenAI and LLMs

Reinventing the Organization for GenAI and LLMs

Ethan Mollick

Publisher Resources

ISBN: 9780763741372