Read more
The concepts of centrality and diversity are highly important in search algorithms, and play central roles in applications of artificial intelligence (AI), machine learning (ML), social networks, and pattern recognition. This work examines the significance of centrality and diversity in representation, regression, ranking, clustering, optimization, and classification.
The text is designed to be accessible to a broad readership. Requiring only a basic background in undergraduate-level mathematics, the work is suitable for senior undergraduate and graduate students, as well as researchers working in machine learning, data mining, social networks, and pattern recognition.
List of contents
Introduction.- Searching.- Representation.- Clustering and Classification.- Ranking.- Centrality and Diversity in Social and Information Networks.- Conclusion.
About the author
Dr. M.N. Murty is a Professor in the Department of Computer Science and Automation at the Indian Institute of Science, Bangalore, India. Anirban Biswas is a Teaching Assistant at the same institution.
Prof. Murty’s other publications include the Springer titles
Support Vector Machines and Perceptrons,
Compression Schemes for Mining Large Datasets, and
Pattern Recognition: An Algorithmic Approach.
Summary
The concepts of centrality and diversity are highly important in search algorithms, and play central roles in applications of artificial intelligence (AI), machine learning (ML), social networks, and pattern recognition. This work examines the significance of centrality and diversity in representation, regression, ranking, clustering, optimization, and classification.
The text is designed to be accessible to a broad readership. Requiring only a basic background in undergraduate-level mathematics, the work is suitable for senior undergraduate and graduate students, as well as researchers working in machine learning, data mining, social networks, and pattern recognition.
