This book covers the state of the art in learning algorithms with an inclusion of semi-supervised methods to provide a broad scope of clustering and classification solutions for big data applications. Case studies and best practices are included along with theoretical models of learning for a comprehensive reference to the field. The book is organized into eight chapters that cover the following topics: discretization, feature extraction and selection, classification, clustering, topic modeling, graph analysis and applications. Practitioners and graduate students can use the volume as an important reference for their current and future research and faculty will find the volume useful for assignments in presenting current approaches to unsupervised and semi-supervised learning in graduate-level seminar courses. The book is based on selected, expanded papers from the Fourth International Conference on Soft Computing in Data Science (2018). Includes new advances in clustering and classification using semi-supervised and unsupervised learning; Address new challenges arising in feature extraction and selection using semi-supervised and unsupervised learning; Features applications from healthcare, engineering, and text/social media mining that exploit techniques from semi-supervised and unsupervised learning.

This book constitutes the refereed proceedings of the International Conference on Soft Computing in Data Science, SCDS 2017, held in Yogyakarta, Indonesia, November 27-28, 2017. The 26 revised full papers presented were carefully reviewed and selected from 68 submissions. The papers are organized in topical sections on deep learning and real-time classification; image feature classification and extraction; classification, clustering, visualization; applications of machine learning; data visualization; fuzzy logic; prediction models and e-learning; text and sentiment analytics.

This book constitutes the refereed proceedings of the International Conference on Soft Computing in Data Science, SCDS 2016, held in Putrajaya, Malaysia, in September 2016. The 27 revised full papers presented were carefully reviewed and selected from 66 submissions. The papers are organized in topical sections on artificial neural networks; classification, clustering, visualization; fuzzy logic; information and sentiment analytics.

This book constitutes the refereed proceedings of the International Conference on Soft Computing in Data Science, SCDS 2015, held in Putrajaya, Malaysia, in September 2015. The 25 revised full papers presented were carefully reviewed and selected from 69 submissions. The papers are organized in topical sections on data mining; fuzzy computing; evolutionary computing and optimization; pattern recognition; human machine interface; hybrid methods.

This book presents the state of the art in parallel numerical algorithms, applications, architectures, and system software. The book examines various solutions for issues of concurrency, scale, energy efficiency, and programmability, which are discussed in the context of a diverse range of applications. Features: includes contributions from an international selection of world-class authorities; examines parallel algorithm-architecture interaction through issues of computational capacity-based codesign and automatic restructuring of programs using compilation techniques; reviews emerging applications of numerical methods in information retrieval and data mining; discusses the latest issues in dense and sparse matrix computations for modern high-performance systems, multicores, manycores and GPUs, and several perspectives on the Spike family of algorithms for solving linear systems; presents outstanding challenges and developing technologies, and puts these in their historical context.

This book presents the state of the art in parallel numerical algorithms, applications, architectures, and system software. The book examines various solutions for issues of concurrency, scale, energy efficiency, and programmability, which are discussed in the context of a diverse range of applications. Features: includes contributions from an international selection of world-class authorities; examines parallel algorithm-architecture interaction through issues of computational capacity-based codesign and automatic restructuring of programs using compilation techniques; reviews emerging applications of numerical methods in information retrieval and data mining; discusses the latest issues in dense and sparse matrix computations for modern high-performance systems, multicores, manycores and GPUs, and several perspectives on the Spike family of algorithms for solving linear systems; presents outstanding challenges and developing technologies, and puts these in their historical context.

Extracting content from text continues to be an important research problem for information processing and management. Approaches to capture the semantics of text-based document collections may be based on Bayesian models, probability theory, vector space models, statistical models, or even graph theory.

As the volume of digitized textual media continues to grow, so does the need for designing robust, scalable indexing and search strategies (software) to meet a variety of user needs. Knowledge extraction or creation from text requires systematic yet reliable processing that can be codified and adapted for changing needs and environments.

This book will draw upon experts in both academia and industry to recommend practical approaches to the purification, indexing, and mining of textual information. It will address document identification, clustering and categorizing documents, cleaning text, and visualizing semantic models of text.

This Second Edition brings readers thoroughly up to date with the emerging field of text mining, the application of techniques of machine learning in conjunction with natural language processing, information extraction, and algebraic/mathematical approaches to computational information retrieval. The book explores a broad range of issues, ranging from the development of new learning approaches to the parallelization of existing algorithms. Authors highlight open research questions in document categorization, clustering, and trend detection. In addition, the book describes new application problems in areas such as email surveillance and anomaly detection.

The proliferation of digital computing devices and their use in communication has resulted in an increased demand for systems and algorithms capable of mining textual data. Thus, the development of techniques for mining unstructured, semi-structured, and fully-structured textual data has become increasingly important in both academia and industry.

This second volume continues to survey the evolving field of text mining - the application of techniques of machine learning, in conjunction with natural language processing, information extraction and algebraic/mathematical approaches, to computational information retrieval. Numerous diverse issues are addressed, ranging from the development of new learning approaches to novel document clustering algorithms, collectively spanning several major topic areas in text mining.

Features:

a [ Acts as an important benchmark in the development of current and future approaches to mining textual information

a [ Serves as an excellent companion text for courses in text and data mining, information retrieval and computational statistics

a [ Experts from academia and industry share their experiences in solving large-scale retrieval and classification problems

a [ Presents an overview of current methods and software for text mining

a [ Highlights open research questions in document categorization and clustering, and trend detection

a [ Describes new application problems in areas such as email surveillance and anomaly detection

Survey of Text Mining II offers a broad selection in state-of-the art algorithms and software for text mining from both academic and industrial perspectives, to generate interest and insight into the stateof the field. This book will be an indispensable resource for researchers, practitioners, and professionals involved in information retrieval, computational statistics, and data mining.

Michael W. Berry is a professor in the Department of Electrical Engineering and Computer Science at the University of Tennessee, Knoxville.

Malu Castellanos is a senior researcher at Hewlett-Packard Laboratories in Palo Alto, California.

Extracting content from text continues to be an important research problem for information processing and management. Approaches to capture the semantics of text-based document collections may be based on Bayesian models, probability theory, vector space models, statistical models, or even graph theory. As the volume of digitized textual media continues to grow, so does the need for designing robust, scalable indexing and search strategies (software) to meet a variety of user needs. Knowledge extraction or creation from text requires systematic yet reliable processing that can be codified and adapted for changing needs and environments. This book will draw upon experts in both academia and industry to recommend practical approaches to the purification, indexing, and mining of textual information. It will address document identification, clustering and categorizing documents, cleaning text, and visualizing semantic models of text.

This book constitutes the refereed proceedings of the 6th International Conference on Soft Computing in Data Science, SCDS 2021, which was held virtually in November 2021. The 31 revised full papers presented were carefully reviewed and selected from 79 submissions. The papers are organized in topical sections on AI techniques and applications; data analytics and technologies; data mining and image processing; machine & statistical learning.

This book covers the state of the art in learning algorithms with an inclusion of semi-supervised methods to provide a broad scope of clustering and classification solutions for big data applications. Case studies and best practices are included along with theoretical models of learning for a comprehensive reference to the field. The book is organized into eight chapters that cover the following topics: discretization, feature extraction and selection, classification, clustering, topic modeling, graph analysis and applications. Practitioners and graduate students can use the volume as an important reference for their current and future research and faculty will find the volume useful for assignments in presenting current approaches to unsupervised and semi-supervised learning in graduate-level seminar courses. The book is based on selected, expanded papers from the Fourth International Conference on Soft Computing in Data Science (2018). Includes new advances in clustering and classification using semi-supervised and unsupervised learning; Address new challenges arising in feature extraction and selection using semi-supervised and unsupervised learning; Features applications from healthcare, engineering, and text/social media mining that exploit techniques from semi-supervised and unsupervised learning.

This book constitutes the refereed proceedings of the 5th International Conference on Soft Computing in Data Science, SCDS 2019, held in Iizuka, Japan, in August 2019. The 30 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers are organized in topical sections on information and customer analytics; visual data science; machine and deep learning; big data analytics; computational and artificial intelligence; social network and media analytics.

This book constitutes the refereed proceedings of the 4th International Conference on Soft Computing in Data Science, SCDS 2018, held in Bangkok, Thailand, in August 2018. The 30 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers are organized in topical sections on machine and deep learning, image processing, financial and fuzzy mathematics, optimization algorithms, data and text analytics, data visualization.

The second edition of Understanding Search Engines: Mathematical Modeling and Text Retrieval follows the basic premise of the first edition by discussing many of the key design issues for building search engines and emphasizing the important role that applied mathematics can play in improving information retrieval. The authors discuss important data structures, algorithms, and software as well as user-centered issues such as interfaces, manual indexing, and document preparation. Readers will find that the second edition includes significant changes that bring the text up to date on current information retrieval methods. For example, the authors have added a completely new chapter on link-structure algorithms used in search engines such as Google, and the chapter on user interface has been rewritten to specifically focus on search engine usability. To reflect updates in the literature on information retrieval, the authors have added new recommendations for further reading and expanded the bibliography. In addition, the index has been updated and streamlined to make it more reader friendly. text for courses in information retrieval, applied linear algebra, and scientific computing. Because of the authors' informal, conversational tone, readers with nonmathematical backgrounds also will appreciate the less technical chapters of the text.

In this book, which focuses on the use of iterative methods for solving large sparse systems of linear equations, templates are introduced to meet the needs of both the traditional user and the high performance specialist. Templates, a description of a general algorithm rather than the executable object or source code more commonly found in a conventional software library, offer whatever degree of customization the user may desire. Templates have three distinct advantages: they are general and reusable, they are not language specific, and they exploit the expertise of both the numerical analyst, who creates a template reflecting in depth knowledge of a specific numerical technique, and the computational scientist, who then provides "value added" capability to the general template description, customizing it for specific needs. For each template that is presented, the authors provide a mathematical description of the flow of the algorithm, discussion of convergence and stopping criteria to use in the iteration, suggestions for applying a method to special matrix types, advice for tuning the template, tips on parallel implementations, and hints as to when and why a method is useful.