High Utility Pattern Mining Book in PDF, ePub and Kindle version is available to download in english. Read online anytime anywhere directly from your device. Click on the download button below to get a free pdf file of High Utility Pattern Mining book. This book definitely worth reading, it is an incredibly well-written.
This book presents an overview of techniques for discovering high-utility patterns (patterns with a high importance) in data. It introduces the main types of high-utility patterns, as well as the theory and core algorithms for high-utility pattern mining, and describes recent advances, applications, open-source software, and research opportunities. It also discusses several types of discrete data, including customer transaction data and sequential data. The book consists of twelve chapters, seven of which are surveys presenting the main subfields of high-utility pattern mining, including itemset mining, sequential pattern mining, big data pattern mining, metaheuristic-based approaches, privacy-preserving pattern mining, and pattern visualization. The remaining five chapters describe key techniques and applications, such as discovering concise representations and regular patterns.
This book provides an introduction to the field of periodic pattern mining, reviews state-of-the-art techniques, discusses recent advances, and reviews open-source software. Periodic pattern mining is a popular and emerging research area in the field of data mining. It involves discovering all regularly occurring patterns in temporal databases. One of the major applications of periodic pattern mining is the analysis of customer transaction databases to discover sets of items that have been regularly purchased by customers. Discovering such patterns has several implications for understanding the behavior of customers. Since the first work on periodic pattern mining, numerous studies have been published and great advances have been made in this field. The book consists of three main parts: introduction, algorithms, and applications. The first chapter is an introduction to pattern mining and periodic pattern mining. The concepts of periodicity, periodic support, search space exploration techniques, and pruning strategies are discussed. The main types of algorithms are also presented such as periodic-frequent pattern growth, partial periodic pattern-growth, and periodic high-utility itemset mining algorithm. Challenges and research opportunities are reviewed. The chapters that follow present state-of-the-art techniques for discovering periodic patterns in (1) transactional databases, (2) temporal databases, (3) quantitative temporal databases, and (4) big data. Then, the theory on concise representations of periodic patterns is presented, as well as hiding sensitive information using privacy-preserving data mining techniques. The book concludes with several applications of periodic pattern mining, including applications in air pollution data analytics, accident data analytics, and traffic congestion analytics.
Mining useful patterns from sequential data is a challenging topic in data mining. An important task for mining sequential data is sequential pattern mining, which discovers sequences of itemsets that frequently appear in a sequence database. In sequential pattern mining, the selection of sequences is generally based on the frequency/support framework. However, most of the patterns returned by sequential pattern mining may not be informative enough to business people and are not particularly related to a business objective. In view of this, high utility sequential pattern (HUSP) mining has emerged as a novel research topic in data mining recently. The main objective of HUSP mining is to extract valuable and useful sequential patterns from data by considering the utility of a pattern that captures a business objective (e.g., profit, users interest). In HUSP mining, the goal is to find sequences whose utility in the database is no less than a user-specified minimum utility threshold. Nowadays, many applications generate a huge volume of data in the form of data streams. A number of studies have been conducted on mining HUSPs, but they are mainly intended for non-streaming data and thus do not take data stream characteristics into consideration. Mining HUSP from such data poses many challenges. First, it is infeasible to keep all streaming data in the memory due to the high volume of data accumulated over time. Second, mining algorithms need to process the arriving data in real time with one scan of data. Third, depending on the minimum utility threshold value, the number of patterns returned by a HUSP mining algorithm can be large and overwhelms the user. In general, it is hard for the user to determine the value for the threshold. Thus, algorithms that can find the most valuable patterns (i.e., top-k high utility patterns) are more desirable. Mining the most valuable patterns is interesting in both static data and data streams. To address these research limitations and challenges, this dissertation proposes techniques and algorithms for mining high utility sequential patterns over data streams. We work on mining HUSPs over both a long portion of a data stream and a short period of time. We also work on how to efficiently identify the most significant high utility patterns (namely, the top-k high utility patterns) over data streams. In the first part, we explore a fundamental problem that is how the limited memory space can be well utilized to produce high quality HUSPs over the entire data stream. An approximation algorithm, called MAHUSP, is designed which employs memory adaptive mechanisms to use a bounded portion of memory, to efficiently discover HUSPs over the entire data streams. The second part of the dissertation presents a new sliding window-based algorithm to discover recent high utility sequential patterns over data streams. A novel data structure named HUSP-Tree is proposed to maintain the essential information for mining recenT HUSPs. An efficient and single-pass algorithm named HUSP-Stream is proposed to generate recent HUSPs from HUSP-Tree. The third part addresses the problem of top-k high utility pattern mining over data streams. Two novel methods, named T-HUDS and T-HUSP, for finding top-k high utility patterns over a data stream are proposed. T-HUDS discovers top-k high utility itemsets and T-HUSP discovers top-k high utility sequential patterns over a data stream. T-HUDS is based on a compressed tree structure, called HUDS-Tree, that can be used to efficiently find potential top-k high utility itemsets over data streams. T-HUSP incrementally maintains the content of top-k HUSPs in a data stream in a summary data structure, named TKList, and discovers top-k HUSPs efficiently. All of the algorithms are evaluated using both synthetic and real datasets. The performances, including the running time, memory consumption, precision, recall and Fmeasure, are compared. In order to show the effectiveness and efficiency of the proposed methods in reallife applications, the fourth part of this dissertation presents applications of one of the proposed methods (i.e., MAHUSP) to extract meaningful patterns from a real web clickstream dataset and a real biosequence dataset. The utility-based sequential patterns are compared with the patterns in the frequency/support framework. The results show that high utility sequential pattern mining provides meaningful patterns in real-life applications.
This book gathers papers presented at the 13th International Conference on Genetic and Evolutionary Computing (ICGEC 2019), which was held in Qingdao, China, from 1st to 3rd, November 2019. Since it was established, in 2006, the ICGEC conference series has been devoted to new approaches with a focus on evolutionary computing. Today, it is a forum for the researchers and professionals in all areas of computational intelligence including evolutionary computing, machine learning, soft computing, data mining, multimedia and signal processing, swarm intelligence and security. The book appeals to policymakers, academics, educators, researchers in pedagogy and learning theory, school teachers, and other professionals in the learning industry, and further and continuing education.
This comprehensive reference consists of 18 chapters from prominent researchers in the field. Each chapter is self-contained, and synthesizes one aspect of frequent pattern mining. An emphasis is placed on simplifying the content, so that students and practitioners can benefit from the book. Each chapter contains a survey describing key research on the topic, a case study and future directions. Key topics include: Pattern Growth Methods, Frequent Pattern Mining in Data Streams, Mining Graph Patterns, Big Data Frequent Pattern Mining, Algorithms for Data Clustering and more. Advanced-level students in computer science, researchers and practitioners from industry will find this book an invaluable reference.
This book constitutes the thoroughly refereed proceedings of the 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2020, held in Kitakyushu, Japan, in September 2020. The 62 full papers and 17 short papers presented were carefully reviewed and selected from 119 submissions. The IEA/AIE 2020 conference will continue the tradition of emphasizing on applications of applied intelligent systems to solve real-life problems in all areas. These areas include are language processing; robotics and drones; knowledge based systems; innovative applications of intelligent systems; industrial applications; networking applications; social network analysis; financial applications and blockchain; medical and health-related applications; anomaly detection and automated diagnosis; decision-support and agent-based systems; multimedia applications; machine learning; data management and data clustering; pattern mining; system control, classification, and fault diagnosis.
This book presents a selection of revised and extended versions of the best papers from the First International Conference on Social Networking and Computational Intelligence (SCI-2018), held in Bhopal, India, from October 5 to 6, 2018. It discusses recent advances in scientific developments and applications in these areas.
The two volume set LNAI 9413 + LNAI 9414 constitutes the proceedings of the 14th Mexican International Conference on Artificial Intelligence, MICAI 2015, held in Cuernavaca, Morelos, Mexico, in October 2015. The total of 98 papers presented in these proceedings was carefully reviewed and selected from 297 submissions. They were organized in topical sections named: natural language processing; logic and multi-agent systems; bioinspired algorithms; neural networks; evolutionary algorithms; fuzzy logic; machine learning and data mining; natural language processing applications; educational applications; biomedical applications; image processing and computer vision; search and optimization; forecasting; and intelligent applications.
This book presents new communication and networking technologies, an area that has gained significant research attention from both academia and industry in recent years. It also discusses the development of more intelligent and efficient communication technologies, which are an essential part of current day-to-day life, and reports on recent innovations in technologies, architectures, and standards relating to these technologies. The book includes research that spans a wide range of communication and networking technologies, including wireless sensor networks, big data, Internet of Things, optical and telecommunication networks, artificial intelligence, cryptography, next-generation networks, cloud computing, and natural language processing. Moreover, it focuses on novel solutions in the context of communication and networking challenges, such as optimization algorithms, network interoperability, scalable network clustering, multicasting and fault-tolerant techniques, network authentication mechanisms, and predictive analytics .