INPUT DATA STRUCTURE FOR DATA MINING
First Claim
1. A computer data structure for compressing data comprised in a set of transactions, each transaction having at least one item, the computer data structure comprising:
- a list of identifiers of different items in the set of transactions,information indicating number of identifiers in the list, andbit field information indicating presence of the different items in the set of transactions, said bit field information being organized in accordance with the list for facilitating evaluation of patterns with respect to the set of transactions.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods and apparatus, including computer program products, implementing and using techniques for compressing data included in several transactions. Each transaction has at least one item. A unique identifier is assigned to each different item and, if taxonomy is defined, to each different taxonomy parent. Sets of transactions are formed from the several transactions. The sets of transactions are stored using a computer data structure including: a list of identifiers of different items in the set of transactions, information indicating number of identifiers in the list, and bit field information indicating presence of the different items in the set of transactions, said bit field information being organized in accordance with the list for facilitating evaluation of patterns with respect to the set of transactions. A data structure for compressing data included in a set of transactions is also provided.
-
Citations
35 Claims
-
1. A computer data structure for compressing data comprised in a set of transactions, each transaction having at least one item, the computer data structure comprising:
-
a list of identifiers of different items in the set of transactions, information indicating number of identifiers in the list, and bit field information indicating presence of the different items in the set of transactions, said bit field information being organized in accordance with the list for facilitating evaluation of patterns with respect to the set of transactions. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-implemented method for compressing data included in a plurality of transactions, each transaction having at least one item, said method comprising:
-
assigning a unique identifier to each different item and, if taxonomy is defined, to each different taxonomy parent, forming sets of transactions from the plurality of transactions, and storing said sets of transactions using a computer data structure including; a list of identifiers of different items in the set of transactions, information indicating number of identifiers in the list, and bit field information indicating presence of the different items in the set of transactions, said bit field information being organized in accordance with the list for facilitating evaluation of patterns with respect to the set of transactions. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer-implemented method for detecting patterns in input data containing a plurality of transactions, each transaction having at least one item and items possibly having taxonomy parents, the method comprising:
-
providing input data in computer data structures having a list of identifiers of different items in the set of transactions, information indicating number of identifiers in the list, and bit field information indicating presence of the different items in the set of transactions, said bit field information being organized in accordance with the list for facilitating evaluation of patterns with respect to the set of transactions; and evaluating a candidate pattern using bit map operations on the bit field information of the computer data structures. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
-
25. A computer program product comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:
-
assign a unique identifier to each different item and, if taxonomy is defined, to each different taxonomy parent, form sets of transactions from the plurality of transactions, and store said sets of transactions using a computer data structure including; a list of identifiers of different items in the set of transactions, information indicating number of identifiers in the list, and bit field information indicating presence of the different items in the set of transactions, said bit field information being organized in accordance with the list for facilitating evaluation of patterns with respect to the set of transactions. - View Dependent Claims (26, 27, 28, 29)
-
-
30. A computer program product comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:
-
provide input data in computer data structures having a list of identifiers of different items in the set of transactions, information indicating number of identifiers in the list, and bit field information indicating presence of the different items in the set of transactions, said bit field information being organized in accordance with the list for facilitating evaluation of patterns with respect to the set of transactions; and evaluate a candidate pattern using bit map operations on the bit field information of the computer data structures. - View Dependent Claims (31, 32, 33, 34, 35)
-
Specification