Efficient Parallel Mining of Gradual Patterns on Multicore Processors

نویسندگان

  • Anne Laurent
  • Benjamin Négrevergne
  • Nicolas Sicard
  • Alexandre Termier
چکیده

Mining gradual patterns plays a crucial role in many real world applications where huge volumes of complex numerical data must be handled, e.g., biological databases, survey databases, data streams or sensor readings. Gradual patterns highlight complex order correlations of the form “The more/less X, the more/less Y”. Only recently algorithms have appeared to mine efficiently gradual rules. However, due to the complexity of mining gradual rules, these algorithms cannot yet scale on huge real world datasets. In this paper, we thus propose to exploit parallelism in order to enhance the performances of the fastest existing one (GRITE) on multicore processors. Through a detailed experimental study, we show that our parallel algorithm scales very well with the number of cores available.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PGP-mc: Towards a Multicore Parallel Approach for Mining Gradual Patterns

Gradual patterns highlight complex order correlations of the form “The more/less X, the more/less Y”. Only recently algorithms have appeared to mine efficiently gradual rules. However, due to the complexity of mining gradual rules, these algorithms cannot yet scale on huge real world datasets. In this paper, we propose to exploit parallelism in order to enhance the performances of the fastest e...

متن کامل

High Performance Canny Edge Detector using Parallel Patterns for Scalability on Modern Multicore Processors

Canny Edge Detector (CED) is an edge detection operator commonly used by most Image Feature Extraction (IFE) Algorithms and Image Processing Applications. This operator involves the use of a multi-stage algorithm to detect edges in a wide range of images. Edge detection is at the forefront of image processing and hence, it is crucial to have at an up to scale level. Multicore Processors have em...

متن کامل

LITERATURE REVIEW: Parallel Computational Geometry on Multicore Processors A Review of Basic Algorithms

Parallel Computing has been one of the most important problems in computer science as well as a solution to satisfy the growing need of computation speed. Although in the past decades, parallel computing has been an interested area, it is going to be more popular and useful among simple users. In the past years, the area was strange for home users due to the high cost of installing a parallel c...

متن کامل

Oblivious algorithms for multicores and networks of processors

We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hierarchical multi-level caching, and we introduce a multicore-oblivious approach to algorithms and schedulers for HM. A multicore-oblivious algorithm is specified with no mention of any machine parameters, such as the ...

متن کامل

Extracting Correlated Patterns on Multicore Architectures

In this paper, we present a new approach relevant to the discovery of correlated patterns, based on the use of multicore architectures. Our work rests on a full KDD system and allows one to extract Decision Correlation Rules based on the Chi-squared criterion that include a target column from any database. To achieve this objective, we use a levelwise algorithm as well as contingency vectors, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010