Preference-based Spatial Co-location Pattern Mining


Book Description

The development of information technology has made it possible to collect large amounts of spatial data on a daily basis. It is of enormous significance when it comes to discovering implicit, non-trivial and potentially valuable information from this spatial data. Spatial co-location patterns reveal the distribution rules of spatial features, which can be valuable for application users. This book provides commercial software developers with proven and effective algorithms for detecting and filtering these implicit patterns, and includes easily implemented pseudocode for all the algorithms. Furthermore, it offers a basis for further research in this promising field. Preference-based co-location pattern mining refers to mining constrained or condensed co-location patterns instead of mining all prevalent co-location patterns. Based on the authors’ recent research, the book highlights techniques for solving a range of problems in this context, including maximal co-location pattern mining, closed co-location pattern mining, top-k co-location pattern mining, non-redundant co-location pattern mining, dominant co-location pattern mining, high utility co-location pattern mining, user-preferred co-location pattern mining, and similarity measures between spatial co-location patterns. Presenting a systematic, mathematical study of preference-based spatial co-location pattern mining, this book can be used both as a textbook for those new to the topic and as a reference resource for experienced professionals.




Data Mining for Co-location Patterns


Book Description

Co-location pattern mining detects sets of features frequently located in close proximity to each other. This book focuses on data mining for co-location pattern, a valid method for identifying patterns from all types of data and applying them in business intelligence and analytics. It explains the fundamentals of co-location pattern mining, co-location decision tree, and maximal instance co-location pattern mining along with an in-depth overview of data mining, machine learning, and statistics. This arrangement of chapters helps readers understand the methods of co-location pattern mining step-by-step and their applications in pavement management, image classification, geospatial buffer analysis, etc.




Preference-based Spatial Co-location Pattern Mining


Book Description

The development of information technology has made it possible to collect large amounts of spatial data on a daily basis. It is of enormous significance when it comes to discovering implicit, non-trivial and potentially valuable information from this spatial data. Spatial co-location patterns reveal the distribution rules of spatial features, which can be valuable for application users. This book provides commercial software developers with proven and effective algorithms for detecting and filtering these implicit patterns, and includes easily implemented pseudocode for all the algorithms. Furthermore, it offers a basis for further research in this promising field. Preference-based co-location pattern mining refers to mining constrained or condensed co-location patterns instead of mining all prevalent co-location patterns. Based on the authors’ recent research, the book highlights techniques for solving a range of problems in this context, including maximal co-location pattern mining, closed co-location pattern mining, top-k co-location pattern mining, non-redundant co-location pattern mining, dominant co-location pattern mining, high utility co-location pattern mining, user-preferred co-location pattern mining, and similarity measures between spatial co-location patterns. Presenting a systematic, mathematical study of preference-based spatial co-location pattern mining, this book can be used both as a textbook for those new to the topic and as a reference resource for experienced professionals.




Frequent Pattern Mining


Book Description

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.




Advances in Knowledge Discovery and Data Mining


Book Description

This book constitutes the refereed proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2005, held in Hanoi, Vietnam, in May 2005. The 48 revised full papers and 49 revised short papers presented together with abstracts or extended abstracts of 3 invited talks were carefully reviewed and selected from 327 submissions. The papers are organized in topical sections on theoretical foundations, association rules, biomedical domains, classification and ranking, clustering, dynamic data mining, graphical model discovery, high dimensional data, integration of data warehousing, knowledge management, machine learning, novel algorithms, spatial data, temporal data, and text and Web data mining.










Data Mining: Concepts and Techniques


Book Description

Data Mining: Concepts and Techniques provides the concepts and techniques in processing gathered data or information, which will be used in various applications. Specifically, it explains data mining and the tools used in discovering knowledge from the collected data. This book is referred as the knowledge discovery from data (KDD). It focuses on the feasibility, usefulness, effectiveness, and scalability of techniques of large data sets. After describing data mining, this edition explains the methods of knowing, preprocessing, processing, and warehousing data. It then presents information about data warehouses, online analytical processing (OLAP), and data cube technology. Then, the methods involved in mining frequent patterns, associations, and correlations for large data sets are described. The book details the methods for data classification and introduces the concepts and methods for data clustering. The remaining chapters discuss the outlier detection and the trends, applications, and research frontiers in data mining. This book is intended for Computer Science students, application developers, business professionals, and researchers who seek information on data mining. - Presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects - Addresses advanced topics such as mining object-relational databases, spatial databases, multimedia databases, time-series databases, text databases, the World Wide Web, and applications in several fields - Provides a comprehensive, practical look at the concepts and techniques you need to get the most out of your data




Seeing the Forest for the Trees


Book Description

Many frequent pattern mining algorithms operate on precise data, where each data point is an exact accounting of a phenomena (e.g., I have exactly two sisters). Alas, reasoning this way is a simplification for many real world observations. Measurements, predictions, environmental factors, human error, &ct. all introduce a degree of uncertainty into the mix. Tree-based frequent pattern mining algorithms such as FP-growth are particularly efficient due to their compact in-memory representations of the input database, but their uncertain extensions can require many more tree nodes. I propose new algorithms with tightened upper bounds to expected support, Tube-S and Tube-P, which mine frequent patterns from uncertain data. Extensive experimentation and analysis on datasets with different probability distributions are undertaken that show the tightness of my bounds in different situations.