Search
Skip to Search Results- 3Database Systems
- 2Data Mining
- 1Computer Games
- 1Computer checkers
- 1Computer chess
- 1Endgame databases
-
2001
Lu, Paul, El-Hajj, Mohammad, Zaiane, Osmar
Technical report TR01-12. Searching for frequent patterns in transactional databases is considered one of the most important data mining problems. Most current association mining algorithms, whether sequential or parallel, adopt an apriori-like algorithm that requires full multiple I/O scans of...
-
Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining
Download2003
El-Hajj, Mohammad, Zaiane, Osmar
Technical report TR03-08. Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. One major problem is the high memory dependency: either the gigantic data structure built is assumed to fit in main memory, or the recursive mining process...
-
1993
Lake, Robert, Schaeffer, Jonathan, Lu, Paul
Technical report TR93-13. Chess endgame databases, while of important theoretical interest, have yet to make a significant impact in tournament chess. In the game of checkers, however, endgame databases have played a pivotal role in the success of our World Championship challenger program...