]> BibSonomy publications for /author/Silvestri http://www.bibsonomy.org/burst/author/Silvestri BibSonomy BuRST Feed for /author/Silvestri 2008-07-27T02:55:05+02:00 An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/2522c68b8bb5e28f1bf9f1e11e612f542/jaeschke jaeschke 2008-07-14T15:41:59+02:00 algorithm fca frequent itemset mining parallel set
An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets
Salvatore Orlando and Paolo Palmerini and Raffaele Perego and Fabrizio Silvestri High Performance Computing for Computational Science — VECPAR 2002 3--29 (2003)
to algorithm fca frequent itemset mining parallel set by jaeschke on 2008-07-14 15:41:59 ]]> High Performance Computing for Computational Science — VECPAR 20023--29An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets2003algorithm fca frequent itemset mining parallel set 2008-07-14 15:41:59.0Due to the huge increase in the number and dimension of available databases, efficient solutions for counting frequent sets are nowadays very important within the Data Mining community. Several sequential and parallel algorithms were proposed, whichin many cases exhibit excellent scalability. In this paper we present ParDCI, a distributed and multithreaded algorithm forcounting the occurrences of frequent sets within transactional databases. ParDCI is a parallel version of DCI (Direct Count& Intersect), a multi-strategy algorithm which is able to adapt its behavior not only to the features of the specific computingplatform (e.g. available memory), but also to the features of the dataset being processed (e.g. sparse or dense datasets).ParDCI enhances previous proposals by exploiting the highly optimized counting and intersection techniques of DCI, and byrelying on a multi-level parallelization approachwh ichex plicitly targets clusters of SMPs, an emerging computing platform.We focused our work on the efficient exploitation of the underlying architecture. Intra-Node multithreading effectively exploitsthe memory hierarchies of each SMP node, while Inter-Node parallelism exploits smart partitioning techniques aimed at reducingcommunication overheads. In depth experimental evaluations demonstrate that ParDCI reaches nearly optimal performances undera variety of conditions. An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/2522c68b8bb5e28f1bf9f1e11e612f542/hpclabisti hpclabisti 2008-07-14T14:31:07+02:00 data-mining
An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets
Salvatore Orlando and Paolo Palmerini and Raffaele Perego and Fabrizio Silvestri High Performance Computing for Computational Science — VECPAR 2002 3--29 (2003)
to data-mining by hpclabisti on 2008-07-14 14:31:07 ]]> High Performance Computing for Computational Science — VECPAR 20023--29An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets2003data-mining 2008-07-14 14:31:07.0Due to the huge increase in the number and dimension of available databases, efficient solutions for counting frequent sets are nowadays very important within the Data Mining community. Several sequential and parallel algorithms were proposed, whichin many cases exhibit excellent scalability. In this paper we present ParDCI, a distributed and multithreaded algorithm forcounting the occurrences of frequent sets within transactional databases. ParDCI is a parallel version of DCI (Direct Count& Intersect), a multi-strategy algorithm which is able to adapt its behavior not only to the features of the specific computingplatform (e.g. available memory), but also to the features of the dataset being processed (e.g. sparse or dense datasets).ParDCI enhances previous proposals by exploiting the highly optimized counting and intersection techniques of DCI, and byrelying on a multi-level parallelization approachwh ichex plicitly targets clusters of SMPs, an emerging computing platform.We focused our work on the efficient exploitation of the underlying architecture. Intra-Node multithreading effectively exploitsthe memory hierarchies of each SMP node, while Inter-Node parallelism exploits smart partitioning techniques aimed at reducingcommunication overheads. In depth experimental evaluations demonstrate that ParDCI reaches nearly optimal performances undera variety of conditions. Scheduling High Performance Data Mining Tasks on a Data Grid Environment SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/2526c451ff13964bffee88655df5e75da/hpclabisti hpclabisti 2008-07-14T14:30:33+02:00 grid
Scheduling High Performance Data Mining Tasks on a Data Grid Environment
S. Orlando and P. Palmerini and R. Perego and F. Silvestri Euro-Par 2002 Parallel Processing 121--137 (2002)
to grid by hpclabisti on 2008-07-14 14:30:33 ]]> Euro-Par 2002 Parallel Processing121--137Scheduling High Performance Data Mining Tasks on a Data Grid Environment2002grid 2008-07-14 14:30:33.0Increasingly the datasets used for data mining are becoming huge and physically distributed. Since the distributed knowledge discovery process is both data and computational intensive, the Grid is a natural platform for deploying a high performance data mining service. The focus of this paper is on the core servicesof such a Grid infrastructure. In particular we concentrate our attention on the design and implementation of specializedbroker aware of data source locations and resource needs of data mining tasks. Allocation and scheduling decisions are takenon the basis of performance cost metrics and models that exploit knowledge about previous executions, and use sampling toacquire estimate about execution behavior. A Hybrid Strategy for Caching Web Search Engine Results http://www.bibsonomy.org/bibtex/2857796949f71f3a5438a2aba74c930c1/hpclabisti hpclabisti 2008-07-14T14:29:56+02:00 ir
A Hybrid Strategy for Caching Web Search Engine Results
Fabrizio Silvestri and Tiziano Fagni and Salvatore Orlando and Paolo Palmerini and Raffaele Perego WWW2003 (2003)
to ir by hpclabisti on 2008-07-14 14:29:56 ]]> WWW2003A Hybrid Strategy for Caching Web Search Engine Results2003ir 2008-07-14 14:29:56.0 A Search Architecture for Grid Software Components A Search Architecture for Grid Software Componentshttp://www.bibsonomy.org/bibtex/2c1719e70925ce37296bf2406770b549b/hpclabisti hpclabisti 2008-07-14T14:28:17+02:00 grid
A Search Architecture for Grid Software Components
Fabrizio Silvestri and Diego Puppin and Domenico Laforenza and Salvatore Orlando WI '04: Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence 495-498 (2004)
to grid by hpclabisti on 2008-07-14 14:28:17 ]]> Los Alamitos, CA, USAWI '04: Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence495-498A Search Architecture for Grid Software Components02004grid 2008-07-14 14:28:17.0 An Online Recommender System for Large Web Sites An Online Recommender System for Large Web Siteshttp://www.bibsonomy.org/bibtex/22ea0b01542582dfce6513ddf6c4b17cc/hpclabisti hpclabisti 2008-07-14T14:27:40+02:00 data-mining ir
An Online Recommender System for Large Web Sites
Ranieri Baraglia and Fabrizio Silvestri WI '04: Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence 199-205 (2004)
to data-mining ir by hpclabisti on 2008-07-14 14:27:40 ]]> Los Alamitos, CA, USAWI '04: Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence199-205An Online Recommender System for Large Web Sites02004data-mining ir 2008-07-14 14:27:40.0 WINGS: A Parallel Indexer for Web Contents http://www.bibsonomy.org/bibtex/217be2eddbca695bab71baffb599edfff/hpclabisti hpclabisti 2008-07-14T14:26:53+02:00 ir
WINGS: A Parallel Indexer for Web Contents
Fabrizio Silvestri and Salvatore Orlando and Raffaele Perego Computational Science - ICCS 2004 263--270 (2004)
to ir by hpclabisti on 2008-07-14 14:26:53 ]]> Computational Science - ICCS 2004263--270WINGS: A Parallel Indexer for Web Contents2004ir 2008-07-14 14:26:53.0 On-line Generation of Suggestions for Web Users On-line Generation of Suggestions for Web Usershttp://www.bibsonomy.org/bibtex/271649f053ece0932809fbf8844043b4e/hpclabisti hpclabisti 2008-07-14T14:24:59+02:00 data-mining ir
On-line Generation of Suggestions for Web Users
Fabrizio Silvestri and Ranieri Baraglia and Paolo Palmerini and Massimo Serranò itcc 392 (2004)
to data-mining ir by hpclabisti on 2008-07-14 14:24:59 ]]> Los Alamitos, CA, USAitcc392On-line Generation of Suggestions for Web Users12004data-mining ir 2008-07-14 14:24:59.0 A Highly Scalable Parallel Caching System for Web Search Engine Results http://www.bibsonomy.org/bibtex/2c6c8b4908c84d1076b59777f15918036/hpclabisti hpclabisti 2008-07-14T14:24:28+02:00 ir
A Highly Scalable Parallel Caching System for Web Search Engine Results
T. Fagni and R. Perego and F. Silvestri Euro-Par 2004 Parallel Processing 347--354 (2004)
to ir by hpclabisti on 2008-07-14 14:24:28 ]]> Euro-Par 2004 Parallel Processing347--354A Highly Scalable Parallel Caching System for Web Search Engine Results2004ir 2008-07-14 14:24:28.0 An evaluation of component-based software design approaches An evaluation of component-based software design approacheshttp://www.bibsonomy.org/bibtex/2ca7ff2f41fccebef7490ae98259b21df/hpclabisti hpclabisti 2008-07-14T14:21:44+02:00 grid
An evaluation of component-based software design approaches
D. Puppin and F. Silvestri and D. Laforenza ccgrid 744-753 (2004)
to grid by hpclabisti on 2008-07-14 14:21:44 ]]> Los Alamitos, CA, USAccgrid744-753An evaluation of component-based software design approaches002004grid 2008-07-14 14:21:44.0