Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

The book Knowledge Discovery in Databases, edited by Piatetsky-Shapiro and Frawley [PSF91], is an early collection of research papers on knowledge discovery from data. The book Advances in Knowledge Discovery and Data Mining, edited by Fayyad, Piatetsky-Shapiro, Smyth, and Uthurusamy [FPSSe96], is a collection of later research results on knowledge discovery and data mining. There have been many data mining books published in recent years, including Predictive Data Mining by Weiss and Indurkhya [WI98], Data Mining Solutions: Methods and Tools for Solving Real-World Problems by Westphal and Blaxton [WB98], Mastering Data Mining: The Art and Science of Customer Relationship Management by Berry and Linofi [BL99], Building Data Mining Applications for CRM by Berson, Smith, and Thearling [BST99], Data Mining: Practical Machine Learning Tools and Techniques by Witten and Frank [WF05], Principles of Data Mining (Adaptive Computation and Machine Learning) by Hand, Mannila, and Smyth [HMS01], The Elements of Statistical Learning by Hastie, Tibshirani, and Friedman [HTF01], Data Mining: Introductory and Advanced Topics by Dunham, and Data Mining: Multimedia, Soft Computing, and Bioinformatics by Mitra and Acharya [MA03]. There are also books containing collections of papers on particular aspects of knowledge discovery, such as Machine Learning and Data Mining: Methods and Applications edited by Michalski, Brakto, and Kubat [MBK98], and Relational Data Mining edited by Dzeroski and Lavrac [De01], as well as many tutorial notes on data mining in major database, data mining and machine learning conferences.

/pdf/data-mining-concepts-and-techniques-2nd-edition-zx1xx1f5e3.pdf

Data Mining: Concepts and Techniques (2nd edition)

The increasing availability of GPS-enabled devices is changing the way people interact with the Web, and brings us a large amount of GPS trajectories representing people's location histories. In this paper, based on multiple users' GPS trajectories, we aim to mine interesting locations and classical travel sequences in a given geospatial region. Here, interesting locations mean the culturally important places, such as Tiananmen Square in Beijing, and frequented public areas, like shopping malls and restaurants, etc. Such information can help users understand surrounding locations, and would enable travel recommendation. In this work, we first model multiple individuals' location histories with a tree-based hierarchical graph (TBHG). Second, based on the TBHG, we propose a HITS (Hypertext Induced Topic Search)-based inference model, which regards an individual's access on a location as a directed link from the user to that location. This model infers the interest of a location by taking into account the following three factors. 1) The interest of a location depends on not only the number of users visiting this location but also these users' travel experiences. 2) Users' travel experiences and location interests have a mutual reinforcement relationship. 3) The interest of a location and the travel experience of a user are relative values and are region-related. Third, we mine the classical travel sequences among locations considering the interests of these locations and users' travel experiences. We evaluated our system using a large GPS dataset collected by 107 users over a period of one year in the real world. As a result, our HITS-based inference model outperformed baseline approaches like rank-by-count and rank-by-frequency. Meanwhile, when considering the users' travel experiences and location interests, we achieved a better performance beyond baselines, such as rank-by-count and rank-by-interest, etc.

/pdf/mining-interesting-locations-and-travel-sequences-from-gps-33g2tbk5p5.pdf

Mining interesting locations and travel sequences from GPS trajectories

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 itemset mining in transaction databases to numerous research frontiers, such as sequential pattern mining, structured pattern mining, correlation mining, associative classification, and frequent pattern-based clustering, as well as their broad applications. In this article, we provide a brief overview of the current status of frequent pattern mining and discuss a few promising research directions. We believe that frequent pattern mining research has substantially broadened the scope of data analysis and will have deep impact on data mining methodologies and applications in the long run. However, there are still some challenging research issues that need to be solved before frequent pattern mining can claim a cornerstone approach in data mining applications.

/pdf/frequent-pattern-mining-current-status-and-future-directions-31jxo4xdkd.pdf

Frequent pattern mining: current status and future directions

The advances in location-acquisition and mobile computing techniques have generated massive spatial trajectory data, which represent the mobility of a diversity of moving objects, such as people, vehicles, and animals. Many techniques have been proposed for processing, managing, and mining trajectory data in the past decade, fostering a broad range of applications. In this article, we conduct a systematic survey on the major research into trajectory data mining, providing a panorama of the field as well as the scope of its research topics. Following a road map from the derivation of trajectory data, to trajectory data preprocessing, to trajectory data management, and to a variety of mining tasks (such as trajectory pattern mining, outlier detection, and trajectory classification), the survey explores the connections, correlations, and differences among these existing techniques. This survey also introduces the methods that transform trajectories into other data formats, such as graphs, matrices, and tensors, to which more data mining and machine learning techniques can be applied. Finally, some public trajectory datasets are presented. This survey can help shape the field of trajectory data mining, providing a quick understanding of this field to the community.

/pdf/trajectory-data-mining-an-overview-3192m0wjto.pdf

Trajectory Data Mining: An Overview

This paper presents a new framework for supervisory protection and situational awareness to enhance grid operations and protection using modern wide-area monitoring systems. In contrast to earlier approaches dealing with the combined processing of data from multiple phasor measurement units (PMUs), the proposed approach analyzes only the PMU data with the strongest or the most prominent disturbance signature. The specific contributions of this paper are: a) new criteria for identification of PMU with the strongest signature, b) simplified approach for quick detection of faults, c) early classification of eight other disturbances suitable for near real-time response, d) time-frequency transform-based feature extraction techniques for speedy and reliable classifiers, and e) a promising approach to locate disturbances within narrow geographical constraints. The contributions are verified with exhaustive simulation data from the Western Electricity Coordination Council system model and limited real PMU data.

Supervisory Protection and Automated Event Diagnosis Using PMU Data

Identifying disturbance events recorded by phasor measurement units (PMUs) has drawn researchers' attention in recent times. Some approaches to identify typical disturbance events frequently occurring in power systems have been documented. However, in order to comprehensively identify all disturbance events recorded by PMUs, it is required to know how many types of events are detected and recorded by PMUs monitoring a certain power system. In other words, for classification purposes, one must know the number of classes to begin with. This paper uses actual disturbance files stored in the database of a North American utility from 2007 through 2010 to determine how many classes (types of disturbances) the disturbance files contain. After analyzing various clustering techniques, a suitable unsupervised learning technique has been chosen and successfully implemented for this purpose. The results show that this process should be underpinned to any comprehensive event detection tool for PMU data.

Comprehensive Clustering of Disturbance Events Recorded by Phasor Measurement Units

Widespread placement and high data sampling rate of current generation of phasor measurement units (PMUs) in wide area monitoring systems result in huge amount of data to be analyzed and stored, making efficient storage of such data a priority. This paper presents a generalized compression technique that utilizes the inherent correlation within PMU data by exploiting both spatial and temporal redundancies. A two stage compression algorithm is proposed using principal component analysis in the first stage and discrete cosine transform in the second. Since compression parameters need to be adjusted to compress critical disturbance information with high fidelity, an automated but simple statistical change detection technique is proposed to identify disturbance data. Extensive verifications are performed using field data, as well as simulated data to establish generality and superior performance of the method.

Efficient Compression of PMU Data in WAMS

Given a collection of trajectories of moving objects with different types (e.g., pumas, deers, vultures, etc.), we introduce the problem of discovering collocation episodes in them (e.g., if a puma is moving near a deer, then a vulture is also going to move close to the same deer with high probability within the next 3 minutes). Collocation episodes catch the inter-movement regularities among different types of objects. We formally define the problem of mining collocation episodes and propose two scaleable algorithms for its efficient solution. We empirically evaluate the performance of the proposed methods using synthetically generated data that emulate real-world object movements.

/pdf/discovery-of-collocation-episodes-in-spatiotemporal-data-1j6ucdv5jj.pdf

Discovery of Collocation Episodes in Spatiotemporal Data

The problem of partial periodic pattern mining in a discrete data sequence is to find subsequences that appear periodically and frequently in the data sequence. Two essential subproblems are the efficient mining of frequent patterns and the automatic discovery of periods that correspond to these patterns. Previous methods for this problem in event sequence databases assume that the periods are given in advance or require additional database scans to compute periods that define candidate patterns. In this work, we propose a new structure, the abbreviated list table (ALT), and several efficient algorithms to compute the periods and the patterns, that require only a small number of passes. A performance study is presented to demonstrate the effectiveness and efficiency of our method.

/pdf/discovering-partial-periodic-patterns-in-discrete-data-22yg7bbttx.pdf

Huiping Cao

Papers

Supervisory Protection and Automated Event Diagnosis Using PMU Data

Comprehensive Clustering of Disturbance Events Recorded by Phasor Measurement Units

Efficient Compression of PMU Data in WAMS

Discovery of Collocation Episodes in Spatiotemporal Data

Discovering Partial Periodic Patterns in Discrete Data Sequences