More formally, let / = (ih i'2 im) be a set of literals, called items. Let D be a set of transactions, where each transaction T is a set of items such that T c /• Each item is a binary variable representing whether an item was bought. Data Mining, Southeast Asia Edition - Page 230by Jiawei Han, Jian Pei, Micheline Kamber - 2006 - 800 pagesLimited preview - About this book
| Takushi Tanaka, Moonis Ali, Setsuo Ohsuga - 1997 - 808 pages
...formalism presented in [AS94]. Let / = {i,./2,...,(m} be a set of literals, called items. Let/) be a set of **transactions, where each transaction T is a set of items such that** re/. Associated with each transaction is a unique identifier, called its TID. We say that a transaction... | |
| Rodney Topor, Katsumi Tanaka - 1997 - 542 pages
...association rules Let / = {ii,»z, ... 1 tm} be a set of literals, called items. Let D be a database of **transactions, where each transaction T is a set of items such that TCI.** For a given itemset XC / and a given transaction T, we say that T contains X if and only if XC T. The... | |
| Xindong Wu, Ramamohanarao Kotagiri, Kevin B. Korb - 1998 - 424 pages
...distinct literals, called items. In general, any set of items is called an itemset. Let 2> be a set of **transactions, where each transaction T is a set of items such that** T c /. An association rule is an expression of the form X => Y, where 0 * X,Y c / and X n Y = 0. X... | |
| Pavol Návrat, Haruki Ueno - 1998 - 321 pages
...= {i t , i2, .... i m \ be a set of literals, called items. Let D = {TV, T 2 , .... TV} be a set of **transactions, where each transaction T, is a set of items such that** T, e /. Associated with each transaction is a unique identifier, called its TID. A set of items X c... | |
| Roland T. Rust, P. K. Kannan - 2002 - 336 pages
...al. 1993; Agrawal and Srikant 1994). Let / {i„ J 2 ,... ,i m ) be a set of items. Let D be a set of **transactions, where each transaction T is a set of items such that** T c/. In the recommendation context, each transaction corresponds to a user and contains a set of items... | |
| Michael R. Berthold, David J Hand - 2007 - 515 pages
...transactions in which the items co-occur. Let / = {ii, ...in} be a set of items and let D be a set of **transactions, where each transaction T is a set of items such that TCI.** An association rule is an implication of the form X =^ Y, where XCI, Y 6 /, X, Y ^ 0. The confidence... | |
| Olivier Camp, Joaquim Filipe, Slimane Hammoudi, Mario G. Piattini - 2004 - 332 pages
...the relativity. 2.2 Association Mining Let I=)il. i2 im}bea set of items. Let D, the task relevant **data, be a set of database transactions where each transaction T is a set of items such that** TC I. Each transaction is associated with an identifier, called TID. Let A be a set of items. A transaction... | |
| Charles D. Hansen, Chris R. Johnson - 2005 - 962 pages
...transactions in which the items co-occur. Let / = {z'i, .../„} be a set of items and let D be a set of **transactions, where each transaction T is a set of items such that TCI.** An association rule is an implication of the form X => Y, where X e /, Y e /, and X, 7^0. The confidence... | |
| AJOY KUMAR RAY, TINKU ACHARYA - 2004 - 628 pages
...association rules. Let 7 = {ilt i%, ..., im] be a set of literals, called items. Let D be a set of **transactions, where each transaction T is a set of items such that** T c 7. Note that the quantities of items bought in a transaction are not considered, meaning that each... | |
| Petra Perner - 2004 - 176 pages
...Rules Let 7 be the finite set of items, and D be the set of customer transactions, called database, **where each transaction T is a set of items such that TCI.** We denote items of 7 by a, 6, c, . . . and subsets of 7, called item-sets, by X, Y, M and so on. In... | |
| |