Jian Pei

Longbing Cao

Guandong Xu

Hiroshi Motoda

Vincent S. Tseng

The two-volume set LNAI 7818 + LNAI 7819 constitutes the refereed proceedings of the 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013, held in Gold Coast, Australia, in April 2013. The total of 98 papers presented in these proceedings was carefully reviewed and selected from 363 submissions. They cover the general fields of data mining and KDD extensively, including pattern mining, classification, graph mining, applications, machine learning, feature selection and dimensionality reduction, multiple information sources mining, social networks, clustering, text mining, text classification, imbalanced data, privacy-preserving data mining, recommendation, multimedia data mining, stream data mining, data preprocessing and representation.

17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part II

Advances in Knowledge Discovery and Data Mining

Wei Wang

Zhaohui Wu

Osmar Zaiane

Min Yao

The two-volume set LNAI 8346 and 8347 constitutes the thoroughly refereed proceedings of the 9th International Conference on Advanced Data Mining and Applications, ADMA 2013, held in Hangzhou, China, in December 2013. The 32 regular papers and 64 short papers presented in these two volumes were carefully reviewed and selected from 222 submissions. The papers included in these two volumes cover the following topics: opinion mining, behavior mining, data stream mining, sequential data mining, web mining, image mining, text mining, social network mining, classification, clustering, association rule mining, pattern mining, regression, predication, feature extraction, identification, privacy preservation, applications, and machine learning.

9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part I

Advanced Data Mining and Applications

Focusing on data mining, this work is a joint effort from researchers in Japan, and includes a report on the forefront of data collection, user-centred mining and user interaction/reaction. It offers an overview of modern solutions with real-world applications, sharing hard-learned experiences.

New Directions of Data Mining

Active Mining

Huan Liu

The ability to analyze and understand massive data sets lags far behind the ability to gather and store the data. To meet this challenge, knowledge discovery and data mining (KDD) is growing rapidly as an emerging field. However, no matter how powerful computers are now or will be in the future, KDD researchers and practitioners must consider how to manage ever-growing data which is, ironically, due to the extensive use of computers and ease of data collection with computers. Many different approaches have been used to address the data explosion issue, such as algorithm scale-up and data reduction. Instance, example, or tuple selection pertains to methods or algorithms that select or search for a representative portion of data that can fulfill a KDD task as if the whole data is used. Instance selection is directly related to data reduction and becomes increasingly important in many KDD applications due to the need for processing efficiency and/or storage efficiency. One of the major means of instance selection is sampling whereby a sample is selected for testing and analysis, and randomness is a key element in the process. Instance selection also covers methods that require search. Examples can be found in density estimation (finding the representative instances - data points - for a cluster); boundary hunting (finding the critical instances to form boundaries to differentiate data points of different classes); and data squashing (producing weighted new data with equivalent sufficient statistics). Other important issues related to instance selection extend to unwanted precision, focusing, concept drifts, noise/outlier removal, data smoothing, etc. Instance Selection and Construction for Data Mining brings researchers and practitioners together to report new developments and applications, to share hard-learned experiences in order to avoid similar pitfalls, and to shed light on the future development of instance selection. This volume serves as a comprehensive reference for graduate students, practitioners and researchers in KDD.

Instance Selection and Construction for Data Mining

9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part II

Tobias Scheffer

Achim Hoffmann

This book constitutes the refereed proceedings of the 8th International Conference on Discovery Science, DS 2005, held in Singapore in October 2005, co-located with the International Conference on Algorithmic Learning Theory (ALT 2005). The 21 revised long papers and the 6 revised regular papers presented together with 9 project reports and 5 invited papers were carefully reviewed and selected from 112 submissions. The papers cover all issues in the area of automating scientific discovery or working on tools for supporting the human process of discovery in science.

8th International Conference, DS 2005, Singapore, October 8-11, 2005, Proceedings

Discovery Science

As computer power grows and data collection technologies advance, a plethora of data is generated in almost every field where computers are used. The com puter generated data should be analyzed by computers; without the aid of computing technologies, it is certain that huge amounts of data collected will not ever be examined, let alone be used to our advantages. Even with today's advanced computer technologies (e. g. , machine learning and data mining sys tems), discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Taking its simplest form, raw data are represented in feature-values. The size of a dataset can be measUJ·ed in two dimensions, number of features (N) and number of instances (P). Both Nand P can be enormously large. This enormity may cause serious problems to many data mining systems. Feature selection is one of the long existing methods that deal with these problems. Its objective is to select a minimal subset of features according to some reasonable criteria so that the original task can be achieved equally well, if not better. By choosing a minimal subset offeatures, irrelevant and redundant features are removed according to the criterion. When N is reduced, the data space shrinks and in a sense, the data set is now a better representative of the whole data population. If necessary, the reduction of N can also give rise to the reduction of P by eliminating duplicates.

Feature Selection for Knowledge Discovery and Data Mining

There is broad interest in feature extraction, construction, and selection among practitioners from statistics, pattern recognition, and data mining to machine learning. Data preprocessing is an essential step in the knowledge discovery process for real-world applications. This book compiles contributions from many leading and active researchers in this growing field and paints a picture of the state-of-art techniques that can boost the capabilities of many existing data mining tools. The objective of this collection is to increase the awareness of the data mining community about the research of feature extraction, construction and selection, which are currently conducted mainly in isolation. This book is part of our endeavor to produce a contemporary overview of modern solutions, to create synergy among these seemingly different branches, and to pave the way for developing meta-systems and novel approaches. Even with today's advanced computer technologies, discovering knowledge from data can still be fiendishly hard due to the characteristics of the computer generated data. Feature extraction, construction and selection are a set of techniques that transform and simplify data so as to make data mining tasks easier. Feature construction and selection can be viewed as two sides of the representation problem.

A Data Mining Perspective

Feature Extraction, Construction and Selection

Philip S. Yu

Wolfgang Nejdl

Jaideep Srivastava

Gang Li

Irwin King

Ee-peng Lim

Ya Zhang

This book constitutes the thoroughly refereed proceedings of the International Workshops on Behavior and Social Informatics and Computing, BSIC 2013, held as collocated event of IJCAI 2013, in Beijing, China in August 2013 and the International Workshop on Behavior and Social Informatics, BSI 2013, held as satellite workshop of PAKDD 2013, in Gold Coast, Australia, in April 2013. The 23 papers presented were carefully reviewed and selected from 58 submissions. The papers study a wide range of techniques and methods for behavior/social-oriented analyses including behavioral and social interaction and network, behavioral/social patterns, behavioral/social impacts, the formation of behavioral/social-oriented groups and collective intelligence and behavioral/social intelligence emergence.

International Workshop on Behavior and Social Informatics, BSI 2013, Gold Coast, Australia, April 14-17, and International Workshop on Behavior and Social Informatics and Computing, BSIC 2013, Beijing, China, August 3-9, 2013, Revised Selected Papers

Behavior and Social Computing

David Cheung

Zhi-Hua Zhou

Tru Cao

Ee-Peng Lim

Tu-Bao Ho

This two-volume set, LNAI 9077 + 9078, constitutes the refereed proceedings of the 19th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2015, held in Ho Chi Minh City, Vietnam, in May 2015. The proceedings contain 117 paper carefully reviewed and selected from 405 submissions. They have been organized in topical sections named: social networks and social media; classification; machine learning; applications; novel methods and algorithms; opinion mining and sentiment analysis; clustering; outlier and anomaly detection; mining uncertain and imprecise data; mining temporal and spatial data; feature extraction and selection; mining heterogeneous, high-dimensional and sequential data; entity resolution and topic-modeling; itemset and high-performance data mining; and recommendations.

19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings

Due to increasing demands for dimensionality reduction, research on feature selection has deeply and widely expanded into many fields, including computational statistics, pattern recognition, machine learning, data mining, and knowledge discovery. Highlighting current research issues, Computational Methods of Feature Selection introduces the basic concepts and principles, state-of-the-art algorithms, and novel applications of this tool. The book begins by exploring unsupervised, randomized, and causal feature selection. It then reports on some recent results of empowering feature selection, including active feature selection, decision-border estimate, the use of ensembles with independent probes, and incremental feature selection. This is followed by discussions of weighting and local methods, such as the ReliefF family, k-means clustering, local feature relevance, and a new interpretation of Relief. The book subsequently covers text classification, a new feature selection score, and both constraint-guided and aggressive feature selection. The final section examines applications of feature selection in bioinformatics, including feature construction as well as redundancy-, ensemble-, and penalty-based feature selection. Through a clear, concise, and coherent presentation of topics, this volume systematically covers the key concepts, underlying principles, and inventive applications of feature selection, illustrating how this powerful tool can efficiently harness massive, high-dimensional data and turn it into valuable, reliable information.

Computational Methods of Feature Selection

17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings

Hiroshi Motoda

Books

Your next favorite book is out there