|
|
|
|
| LEADER |
04153nmm a2200313 u 4500 |
| 001 |
EB000362240 |
| 003 |
EBX01000000000000000215292 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9781441965158
|
| 100 |
1 |
|
|a Yu, Philip S.
|e [editor]
|
| 245 |
0 |
0 |
|a Link Mining: Models, Algorithms, and Applications
|h Elektronische Ressource
|c edited by Philip S. Yu, Jiawei Han, Christos Faloutsos
|
| 250 |
|
|
|a 1st ed. 2010
|
| 260 |
|
|
|a New York, NY
|b Springer New York
|c 2010, 2010
|
| 300 |
|
|
|a XIII, 586 p
|b online resource
|
| 505 |
0 |
|
|a Link-Based Clustering -- Machine Learning Approaches to Link-Based Clustering -- Scalable Link-Based Similarity Computation and Clustering -- Community Evolution and Change Point Detection in Time-Evolving Graphs -- Graph Mining and Community Analysis -- A Survey of Link Mining Tasks for Analyzing Noisy and Incomplete Networks -- Markov Logic: A Language and Algorithms for Link Mining -- Understanding Group Structures and Properties in Social Media -- Time Sensitive Ranking with Application to Publication Search -- Proximity Tracking on Dynamic Bipartite Graphs: Problem Definitions and Fast Solutions -- Discriminative Frequent Pattern-Based Graph Classification -- Link Analysis for Data Cleaning and Information Integration -- Information Integration for Graph Databases -- Veracity Analysis and Object Distinction -- Social Network Analysis -- Dynamic Community Identification -- Structure and Evolution of Online Social Networks -- Toward Identity Anonymization in Social Networks -- Summarization and OLAP of Information Networks -- Interactive Graph Summarization -- InfoNetOLAP: OLAP and Mining of Information Networks -- Integrating Clustering with Ranking in Heterogeneous Information Networks Analysis -- Mining Large Information Networks by Graph Summarization -- Analysis of Biological Information Networks -- Finding High-Order Correlations in High-Dimensional Biological Data -- Functional Influence-Based Approach to Identify Overlapping Modules in Biological Networks -- Gene Reachability Using Page Ranking on Gene Co-expression Networks
|
| 653 |
|
|
|a Bioinformatics
|
| 653 |
|
|
|a Computational and Systems Biology
|
| 653 |
|
|
|a Data mining
|
| 653 |
|
|
|a Data Mining and Knowledge Discovery
|
| 700 |
1 |
|
|a Han, Jiawei
|e [editor]
|
| 700 |
1 |
|
|a Faloutsos, Christos
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4419-6515-8
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4419-6515-8?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 570.285
|
| 520 |
|
|
|a With the recent flourishing research activities on Web search and mining, social network analysis, information network analysis, information retrieval, link analysis, and structural data mining, research on link mining has been rapidly growing, forming a new field of data mining. Traditional data mining focuses on "flat" or “isolated” data in which each data object is represented as an independent attribute vector. However, many real-world data sets are inter-connected, much richer in structure, involving objects of heterogeneous types and complex links. Hence, the study of link mining will have a high impact in various important applications such as Web and text mining, social network analysis, collaborative filtering, and bioinformatics. Link Mining: Models, Algorithms and Applications focuses on the theory and techniques as well as the related applications for link mining, especially from an interdisciplinary point of view. Due to the high popularity of linkage data, extensive applications ranging from governmental organizations to commercial businesses to people's daily life call for exploring the techniques of mining linkage data. This book provides a comprehensive coverage of the link mining models, techniques and applications. Each chapter is contributed from some well known researchers in the field. Link Mining: Models, Algorithms and Applications is designed for researchers, teachers, and advanced-level students in computer science. This book is also suitable for practitioners in industry
|