Abstract
Many association rule algorithms operate in a parallel environment where the database is divided up among a number of processors, a procedure which is usually carried out indiscriminately. The nature of the database partitioning can affect both the number of candidate sets produced and the workload at each processor. This paper demonstrates that Principal Component Analysis can be used successfully to help arrange the records of a database among processors so that efficient load balancing is enabled and candidate set duplication minimised. © Springer-Verlag Berlin Heidelberg 1999.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
Publisher | Springer Nature |
Pages | 1460-1463 |
Number of pages | 3 |
Volume | 1685 |
ISBN (Print) | 3540664432, 9783540664437 |
Publication status | Published - 1999 |
Event | 5th International Conference on Parallel Processing, Euro-Par 1999 - Toulouse Duration: 1 Jul 1999 → … http://dblp.uni-trier.de/db/conf/europar/europar99.html#FotisKS99http://dblp.uni-trier.de/rec/bibtex/conf/europar/FotisKS99.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/europar/FotisKS99 |
Publication series
Name | Lecture Notes in Computer Science |
---|
Conference
Conference | 5th International Conference on Parallel Processing, Euro-Par 1999 |
---|---|
City | Toulouse |
Period | 1/07/99 → … |
Internet address |