Efficient Frequent Pattern Mining

نویسنده

  • BART GOETHALS
چکیده

Proefschrift voorgelegd tot het behalen van de graad van Doctor in de Wetenschappen, richting Informatica te verdedigen door Acknowledgements Many people have contributed to the realization of this thesis. First an foremost, I am grateful to my advisor Jan Van den Bussche for his guidance throughout my doctoral studies and all the time and effort he put in the development of me and my work. The amount of decibels we produced during our vivid discussions, are directly related to the amount of knowledge he passed on to me. I am much in debt to my office-mate Floris Geerts. His help, encouragement and interest in my research resulted in the work presented in Chapter 4. I also thank the other members of our research group, the department and the administrative staff for creating a stimulating environment. This thesis further benefitted from pleasant discussions with, among others , Also many thanks to my parents, sister, other family members and friends for the support and encouragement they have given me during my long career as a student. Finally, I am very much in debt for the unconditional support, endless patience and constant encouragement I have received from my companion in life, Eva. Thank you. You are all part of the " we " used throughout this thesis.

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

ثبت نام

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

منابع مشابه

Preference-Based Frequent Pattern Mining

Frequent pattern mining is an important data mining problem with broad applications. Although there are many in-depth studies on efficient frequent pattern mining algorithms and constraint pushing techniques, the effectiveness of frequent pattern mining remains a serious concern: it is non-trivial and often tricky to specify appropriate support thresholds and proper constraints. In this paper, ...

متن کامل

ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns

Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequency values of items in transactions. Therefore, recently share-frequent pattern mining problem becomes a very important research issue in data mining and knowledge discovery. Existing algorithms of share-frequent patter...

متن کامل

Approximate Frequent Pattern Mining

Frequent pattern mining has been a focused theme in data mining research and an important first step in the analysis of data arising in a broad range of applications. The traditional exact model for frequent pattern requires that every item occurs in each supporting transaction. However, real application data is usually subject to random noise or measurement error, which poses new challenges fo...

متن کامل

An Approach for Finding Frequent Item Set Done By Comparison Based Technique

Frequent pattern mining has been a focused theme in data mining research for over a decade. Abundant literature has been dedicated to this research and tremendous progress has been made, ranging from efficient and scalable algorithms for frequent itemsets mining in transaction databases to numerous research frontiers, such as sequential pattern mining, structured pattern mining, correlation min...

متن کامل

Efficient Analysis of Pattern and Association Rule Mining Approaches

The process of data mining produces various patterns from a given data source. The most recognized data mining tasks are the process of discovering frequent itemsets, frequent sequential patterns, frequent sequential rules and frequent association rules. Numerous efficient algorithms have been proposed to do the above processes. Frequent pattern mining has been a focused topic in data mining re...

متن کامل

Pattern-growth Methods for Frequent Pattern Mining

Mining frequent patterns from large databases plays an essential role in many data mining tasks and has broad applications. Most of the previously proposed methods adopt apriorilike candidate-generation-and-test approaches. However, those methods may encounter serious challenges when mining datasets with prolific patterns and/or long patterns. In this work, we develop a class of novel and effic...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2002