Advances in hardware technology have increased the capability to store and record personal data about consumers and individuals. This has caused concerns that personal data may be used for a variety of intrusive or malicious purposes. Privacy Preserving Data Mining: Models and Algorithms proposes a number of techniques to perform the data mining tasks in a privacy-preserving way. These techniques generally fall into the following categories: data modification techniques, cryptographic methods and protocols for data sharing, statistical techniques for disclosure and inference control, query auditing methods, randomization and perturbation-based techniques. This edited volume contains surveys by distinguished researchers in the privacy field. Each survey includes the key research content as well as future research directions of a particular topic in privacy. Privacy Preserving Data Mining: Models and Algorithms is designed for researchers, professors, and advanced-level students in computer science. This book is also suitable for practitioners in industry.

'Behavior' is an increasingly important concept in the scientific, societal, economic, cultural, political, military, living and virtual worlds. Behavior computing, or behavior informatics, consists of methodologies, techniques and practical tools for examining and interpreting behaviours in these various worlds. Behavior computing contributes to the in-depth understanding, discovery, applications and management of behavior intelligence. With contributions from leading researchers in this emerging field Behavior Computing: Modeling, Analysis, Mining and Decision includes chapters on: representation and modeling behaviors; behavior ontology; behaviour analysis; behaviour pattern mining; clustering complex behaviors; classification of complex behaviors; behaviour impact analysis; social behaviour analysis; organizational behaviour analysis; and behaviour computing applications. Behavior Computing: Modeling, Analysis, Mining and Decision provides a dedicated source of reference for the theory and applications of behavior informatics and behavior computing. Researchers, research students and practitioners in behavior studies, including computer science, behavioral science, and social science communities will find this state of the art volume invaluable.

Data mining has emerged as one of the most active areas in information and c- munication technologies(ICT). With the boomingof the global economy, and ub- uitouscomputingandnetworkingacrosseverysectorand business, data andits deep analysis becomes a particularly important issue for enhancing the soft power of an organization, its production systems, decision-making and performance. The last ten years have seen ever-increasingapplications of data mining in business, gove- ment, social networks and the like. However, a crucial problem that prevents data mining from playing a strategic decision-support role in ICT is its usually limited decision-support power in the real world. Typical concerns include its actionability, workability, transferability, and the trustworthy, dependable, repeatable, operable and explainable capabilities of data mining algorithms, tools and outputs. This monograph, Domain Driven Data Mining, is motivated by the real-world challenges to and complexities of the current KDD methodologies and techniques, which are critical issues faced by data mining, as well as the ?ndings, thoughts and lessons learned in conducting several large-scale real-world data mining bu- ness applications. The aim and objective of domain driven data mining is to study effective and ef?cient methodologies, techniques, tools, and applications that can discover and deliver actionable knowledge that can be passed on to business people for direct decision-making and action-takin

This book offers researchers an understanding of the fundamental issues and a good starting point to work on this rapidly expanding field. It provides a comprehensive survey of current developments of heterogeneous information network. It also presents the newest research in applications of heterogeneous information networks to similarity search, ranking, clustering, recommendation. This information will help researchers to understand how to analyze networked data with heterogeneous information networks. Common data mining tasks are explored, including similarity search, ranking, and recommendation. The book illustrates some prototypes which analyze networked data. Professionals and academics working in data analytics, networks, machine learning, and data mining will find this content valuable. It is also suitable for advanced-level students in computer science who are interested in networking or pattern recognition.

Data Mining for Business Applications presents the state-of-the-art research and development outcomes on methodologies, techniques, approaches and successful applications in the area. The contributions mark a paradigm shift from data-centered pattern mining to domain driven actionable knowledge discovery for next-generation KDD research and applications. The contents identify how KDD techniques can better contribute to critical domain problems in theory and practice, and strengthen business intelligence in complex enterprise applications. The volume also explores challenges and directions for future research and development in the dialogue between academia and business."

Representation learning in heterogeneous graphs (HG) is intended to provide a meaningful vector representation for each node so as to facilitate downstream applications such as link prediction, personalized recommendation, node classification, etc. This task, however, is challenging not only because of the need to incorporate heterogeneous structural (graph) information consisting of multiple types of node and edge, but also the need to consider heterogeneous attributes or types of content (e.g. text or image) associated with each node. Although considerable advances have been made in homogeneous (and heterogeneous) graph embedding, attributed graph embedding and graph neural networks, few are capable of simultaneously and effectively taking into account heterogeneous structural (graph) information as well as the heterogeneous content information of each node. In this book, we provide a comprehensive survey of current developments in HG representation learning. More importantly, we present the state-of-the-art in this field, including theoretical models and real applications that have been showcased at the top conferences and journals, such as TKDE, KDD, WWW, IJCAI and AAAI. The book has two major objectives: (1) to provide researchers with an understanding of the fundamental issues and a good point of departure for working in this rapidly expanding field, and (2) to present the latest research on applying heterogeneous graphs to model real systems and learning structural features of interaction systems. To the best of our knowledge, it is the first book to summarize the latest developments and present cutting-edge research on heterogeneous graph representation learning. To gain the most from it, readers should have a basic grasp of computer science, data mining and machine learning.

This book focuses on differential privacy and its application with an emphasis on technical and application aspects. This book also presents the most recent research on differential privacy with a theory perspective. It provides an approachable strategy for researchers and engineers to implement differential privacy in real world applications. Early chapters are focused on two major directions, differentially private data publishing and differentially private data analysis. Data publishing focuses on how to modify the original dataset or the queries with the guarantee of differential privacy. Privacy data analysis concentrates on how to modify the data analysis algorithm to satisfy differential privacy, while retaining a high mining accuracy. The authors also introduce several applications in real world applications, including recommender systems and location privacy Advanced level students in computer science and engineering, as well as researchers and professionals working in privacy preserving, data mining, machine learning and data analysis will find this book useful as a reference. Engineers in database, network security, social networks and web services will also find this book useful.

This book offers a clear and comprehensive introduction to broad learning, one of the novel learning problems studied in data mining and machine learning. Broad learning aims at fusing multiple large-scale information sources of diverse varieties together, and carrying out synergistic data mining tasks across these fused sources in one unified analytic. This book takes online social networks as an application example to introduce the latest alignment and knowledge discovery algorithms. Besides the overview of broad learning, machine learning and social network basics, specific topics covered in this book include network alignment, link prediction, community detection, information diffusion, viral marketing, and network embedding.

Gaining access to high-quality data is a vital necessity in knowledge-based decision making. But data in its raw form often contains sensitive information about individuals. Providing solutions to this problem, the methods and tools of privacy-preserving data publishing enable the publication of useful information while protecting data privacy. Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques presents state-of-the-art information sharing and data integration methods that take into account privacy and data mining requirements.

The first part of the book discusses the fundamentals of the field. In the second part, the authors present anonymization methods for preserving information utility for specific data mining tasks. The third part examines the privacy issues, privacy models, and anonymization methods for realistic and challenging data publishing scenarios. While the first three parts focus on anonymizing relational data, the last part studies the privacy threats, privacy models, and anonymization methods for complex data, including transaction, trajectory, social network, and textual data.

This book not only explores privacy and information utility issues but also efficiency and scalability challenges. In many chapters, the authors highlight efficient and scalable methods and provide an analytical discussion to compare the strengths and weaknesses of different solutions.

Drawn from the US National Science Foundation's Symposium on Next Generation of Data Mining and Cyber-Enabled Discovery for Innovation (NGDM 07), Next Generation of Data Mining explores emerging technologies and applications in data mining as well as potential challenges faced by the field.

Gathering perspectives from top experts across different disciplines, the book debates upcoming challenges and outlines computational methods. The contributors look at how ecology, astronomy, social science, medicine, finance, and more can benefit from the next generation of data mining techniques. They examine the algorithms, middleware, infrastructure, and privacy policies associated with ubiquitous, distributed, and high performance data mining. They also discuss the impact of new technologies, such as the semantic web, on data mining and provide recommendations for privacy-preserving mechanisms.

The dramatic increase in the availability of massive, complex data from various sources is creating computing, storage, communication, and human-computer interaction challenges for data mining. Providing a framework to better understand these fundamental issues, this volume surveys promising approaches to data mining problems that span an array of disciplines.

This book offers researchers an understanding of the fundamental issues and a good starting point to work on this rapidly expanding field. It provides a comprehensive survey of current developments of heterogeneous information network. It also presents the newest research in applications of heterogeneous information networks to similarity search, ranking, clustering, recommendation. This information will help researchers to understand how to analyze networked data with heterogeneous information networks. Common data mining tasks are explored, including similarity search, ranking, and recommendation. The book illustrates some prototypes which analyze networked data. Professionals and academics working in data analytics, networks, machine learning, and data mining will find this content valuable. It is also suitable for advanced-level students in computer science who are interested in networking or pattern recognition.

Data mining has emerged as one of the most active areas in information and c- munication technologies(ICT). With the boomingof the global economy,and ub- uitouscomputingandnetworkingacrosseverysectorand business,data andits deep analysis becomes a particularly important issue for enhancing the soft power of an organization, its production systems, decision-making and performance. The last ten years have seen ever-increasingapplications of data mining in business, gove- ment, social networks and the like. However, a crucial problem that prevents data mining from playing a strategic decision-support role in ICT is its usually limited decision-support power in the real world. Typical concerns include its actionability, workability, transferability, and the trustworthy, dependable, repeatable, operable and explainable capabilities of data mining algorithms, tools and outputs. This monograph, Domain Driven Data Mining, is motivated by the real-world challenges to and complexities of the current KDD methodologies and techniques, which are critical issues faced by data mining, as well as the ?ndings, thoughts and lessons learned in conducting several large-scale real-world data mining bu- ness applications. The aim and objective of domain driven data mining is to study effective and ef?cient methodologies, techniques, tools, and applications that can discover and deliver actionable knowledge that can be passed on to business people for direct decision-making and action-taking.

This book constitutes the thoroughly refereed and revised selected papers from the 9th International Workshop on Agents and Data Mining Interaction, ADMI 2013, held in Saint Paul, MN, USA in May 2013. The 10 papers presented in this volume were carefully selected for inclusion in the book and are organized in topical sections named agent mining and data mining.

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.

This book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on Agents and Data Mining Interaction, ADMI 2012, held in Valencia, Spain, in June 2012. The 16 revised full papers were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on agents for data mining, data mining for agents, and agent mining applications.

This book constitutes the thoroughly refereed post-workshop proceedings of the 7th International Workshop on Agents and Data Mining Interaction, ADMI 2011, held in Taipei, Taiwan, in May 2011 in conjunction with AAMAS 2011, the 10th International Joint Conference on Autonomous Agents and Multiagent Systems.
The 11 revised full papers presented were carefully reviewed and selected from 24 submissions. The papers are organized in topical sections on agents for data mining; data mining for agents; and agent mining applications.

Gaining access to high-quality data is a vital necessity in knowledge-based decision making. But data in its raw form often contains sensitive information about individuals. Providing solutions to this problem, the methods and tools of privacy-preserving data publishing enable the publication of useful information while protecting data privacy. Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques presents state-of-the-art information sharing and data integration methods that take into account privacy and data mining requirements. The first part of the book discusses the fundamentals of the field. In the second part, the authors present anonymization methods for preserving information utility for specific data mining tasks. The third part examines the privacy issues, privacy models, and anonymization methods for realistic and challenging data publishing scenarios. While the first three parts focus on anonymizing relational data, the last part studies the privacy threats, privacy models, and anonymization methods for complex data, including transaction, trajectory, social network, and textual data. This book not only explores privacy and information utility issues but also efficiency and scalability challenges. In many chapters, the authors highlight efficient and scalable methods and provide an analytical discussion to compare the strengths and weaknesses of different solutions.

A culmination of the authors' years of extensive research on this topic, Relational Data Clustering: Models, Algorithms, and Applications addresses the fundamentals and applications of relational data clustering. It describes theoretic models and algorithms and, through examples, shows how to apply these models and algorithms to solve real-world problems. After defining the field, the book introduces different types of model formulations for relational data clustering, presents various algorithms for the corresponding models, and demonstrates applications of the models and algorithms through extensive experimental results. The authors cover six topics of relational data clustering: Clustering on bi-type heterogeneous relational data Multi-type heterogeneous relational data Homogeneous relational data clustering Clustering on the most general case of relational data Individual relational clustering framework Recent research on evolutionary clustering This book focuses on both practical algorithm derivation and theoretical framework construction for relational data clustering. It provides a complete, self-contained introduction to advances in the field.

Advances in hardware technology have increased the capability to store and record personal data. This has caused concerns that personal data may be abused. This book proposes a number of techniques to perform the data mining tasks in a privacy-preserving way. This edited volume contains surveys by distinguished researchers in the privacy field. Each survey includes the key research content as well as future research directions of a particular topic in privacy. The book is designed for researchers, professors, and advanced-level students in computer science, but is also suitable for practitioners in industry.

Data Mining for Business Applications presents the state-of-the-art research and development outcomes on methodologies, techniques, approaches and successful applications in the area. The contributions mark a paradigm shift from "data-centered pattern mining" to "domain driven actionable knowledge discovery" for next-generation KDD research and applications. The contents identify how KDD techniques can better contribute to critical domain problems in theory and practice, and strengthen business intelligence in complex enterprise applications. The volume also explores challenges and directions for future research and development in the dialogue between academia and business.

Many networked computer systems are far too vulnerable to cyber attacks that can inhibit their functioning, corrupt important data, or expose private information. Not surprisingly, the field of cyber-based systems is a fertile ground where many tasks can be formulated as learning problems and approached in terms of machine learning algorithms.

This book contains original materials by leading researchers in the area and covers applications of different machine learning methods in the reliability, security, performance, and privacy issues of cyber space. It enables readers to discover what types of learning methods are at their disposal, summarizing the state-of-the-practice in this significant area, and giving a classification of existing work.

Those working in the field of cyber-based systems, including industrial managers, researchers, engineers, and graduate and senior undergraduate students will find this an indispensable guide in creating systems resistant to and tolerant of cyber attacks.

A culmination of the authors? years of extensive research on this topic, Relational Data Clustering Models, Algorithms, and Applications addresses the fundamentals and applications of relational data clustering. It describes theoretic models and algorithms and, through examples, shows how to apply these models and algorithms to solve real-world problems.

After defining the field, the book introduces different types of model formulations for relational data clustering, presents various algorithms for the corresponding models, and demonstrates applications of the models and algorithms through extensive experimental results. The authors cover six topics of relational data clustering:

1. Clustering on bi-type heterogeneous relational data
2. Multi-type heterogeneous relational data
3. Homogeneous relational data clustering
4. Clustering on the most general case of relational data
5. Individual relational clustering framework
6. Recent research on evolutionary clustering

This book focuses on both practical algorithm derivation and theoretical framework construction for relational data clustering. It provides a complete, self-contained introduction to advances in the field.

The2009InternationalWorkshoponAgentsandDataMiningInteraction(ADMI 2009) was a joint event with AAMAS2009. In recentyears,agents and data mining interaction (ADMI), or agent mining forshort,hasemergedasaverypromisingresearch?eld. Followingthesuccessof ADMI 2006 in Hong Kong, ADMI 2007 in San Jose, and ADMI 2008 in Sydney, the ADMI 2009 workshop in Budapest provided a premier forum for sharing research and engineering results, as well as potential challenges and prospects encountered in the synergy between agents and data mining. As usual, the ADMI workshop encouraged and promoted theoretical and applied research and development, which aims at: - Exploitingagent-drivendatamininganddemonstratinghowintelligentagent technology can contribute to critical data mining problems in theory and practice - Improving data mining-driven agents and showing how data mining can strengthen agent intelligence in research and practical applications - Exploring the integration of agents and data mining toward a super-intelligent information processing and systems - Identifying challenges and directions for future research on the synergy between agents and data mining ADMI 2009 featured two invited talks and twelve selected papers. The ?rst invited talk was on "Agents and Data Mining in Bioinformatics," with the s- ond focusing on "Knowledge-Based Reinforcement Learning. " The ten accepted papers are from seven countries. A majority of submissions came from Eu- pean countries, indicating the boom of ADMI research in Europe. In addition the two invited papers, addressed fundamental issues related to agent-driven data mining, data mining-driven agents, and agent mining applications. The proceedings of the ADMI workshops will be published as part of the LNAIseriesbySpringer. WeappreciatethesupportofSpringer,andinparticular Alfred Hofmann.

This book constitutes the refereed proceedings of the 6th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2002, held in Taipei, Taiwan, in May 2002.The 32 revised full papers and 20 short papers presented together with 4 invited contributions were carefully reviewed and selected from a total of 128 submissions. The papers are organized in topical sections on association rules; classification; interestingness; sequence mining; clustering; Web mining; semi-structure and concept mining; data warehouse and data cube; bio-data mining; temporal mining; and outliers, missing data, and causation.

Drawn from the US National Science Foundation's Symposium on Next Generation of Data Mining and Cyber-Enabled Discovery for Innovation (NGDM 07), Next Generation of Data Mining explores emerging technologies and applications in data mining as well as potential challenges faced by the field. Gathering perspectives from top experts across different disciplines, the book debates upcoming challenges and outlines computational methods. The contributors look at how ecology, astronomy, social science, medicine, finance, and more can benefit from the next generation of data mining techniques. They examine the algorithms, middleware, infrastructure, and privacy policies associated with ubiquitous, distributed, and high performance data mining. They also discuss the impact of new technologies, such as the semantic web, on data mining and provide recommendations for privacy-preserving mechanisms. The dramatic increase in the availability of massive, complex data from various sources is creating computing, storage, communication, and human-computer interaction challenges for data mining. Providing a framework to better understand these fundamental issues, this volume surveys promising approaches to data mining problems that span an array of disciplines.