الصفحة 1
الصفحة 1
Visual Data Mining : Theory, Techniques and Tools for Visual Analytics
The volume is structured in three parts on theory and methodologies, techniques, and tools and applications.
Transactions on Rough Sets VIII
This volume of TRS presents papers that introduce a number of new - vances in the foundations and applications of arti?cial intelligence, engineering, logic, mathematics, and science. These advances have signi?cant implications in a number of researchareas.In addition, it is evident from the papers included in this volume that roughset theoryand its application forma veryactiveresearch area worldwide.
Transactions on Rough Sets III
The LNCS journal Transactions on Rough Sets is devoted to the entire spectrum of rough sets related issues, from logical and mathematical foundations, through all aspects of rough set theory and its applications, such as data mining, knowledge discovery, and intelligent information processing, to relations between rough sets and other approaches to uncertainty, vagueness, and incompleteness, such as fuzzy sets and theory of evidence. This third volume of the Transactions on Rough Sets presents 11 revised papers that have been through a careful peer reviewing process by the journal's Editorial Board. The research monograph "Time Complexity of Decision Trees" by Mikhail Ju. Moshkov is presented in the section on dissertation and monographs. Among the regular papers the one by Zdzislaw Pawlak entitled "Flow Graphs and Data Mining" deserves a special mention.
Soft Computing Applications in Business
Soft computing techniques are widely used in most businesses. This book consists of several important papers on the applications of soft computing techniques for the business field.The soft computing techniques used in this book include (or very closely related to): Bayesian networks, biclustering methods, case-based reasoning, data mining, Dempster-Shafer theory, ensemble learning, evolutionary programming, fuzzy decision trees, hidden Markov models, intelligent agents, k-means clustering, maximum likelihood Hebbian learning, neural networks, opportunistic scheduling, probability distributions combined with Monte Carlo methods, rough sets, self organizing maps, support vector machines, uncertain reasoning, other statistical and machine learning techniques, and combinations of these techniques.
Simplicial Complexes of Graphs
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
Nonlinear Analyses and Algorithms for Speech Processing ; International Conference on Non-Linear Speech Processing, NOLISP 2005, Barcelona, Spain, April 19-22, 2005, Revised Selected Papers
We present in this volume the collection of ?nally accepted papers of NOLISP 2005 conference. It has been the third event in a series of events related to N- linear speech processing, in the framework of the European COST action 277 “Nonlinear speech processing”. Many speci?cs of the speech signal are not well addressed by conv- tional models currently used in the ?eld of speech processing. The purpose of NOLISP is to present and discuss novel ideas, work and results related to alternative techniques for speech processing, which depart from mainstream approaches. With this intention in mind, we provide an open forum for discussion. Alt- nate approaches are appreciated, although the results achieved at present may not clearly surpass results based on state-of-the-art methods. The call for papers was launched at the beginning of 2005, addressing the following domains: 1. Non-Linear Approximation and Estimation 2. Non-Linear Oscillators and Predictors 3. Higher-Order Statistics 4. Independent Component Analysis 5. Nearest Neighbors 6. Neural Networks 7. Decision Trees 8. Non-Parametric Models 9. Dynamics of Non-Linear Systems 10. Fractal Methods 11. Chaos Modeling 12. Non-Linear Di?erential Equations 13. Others All the main ?elds of speech processing are targeted by the workshop, namely: 1. Speech Coding:Thebit rateavailablefor speechsignalsmustbe strictly l- ited in order to accommodate the constraints of the channel resource.
Multiple Classifier Systems ; 7th International Workshop, MCS 2007, Prague, Czech Republic, May 23-25, 2007, Proceedings
These proceedings are a record of the Multiple Classifier Systems Workshop, MCS 2007, held at the Institute of Information Theory and Automation, Czech Academy of Sciences, Prague in May 2007. the workshop achieved its objective of bringing together researchers from diverse communities (neural networks, pattern rec- nition, machine learning and statistics) concerned with this research topic.
Multi-Objective Machine Learning
This monograph presents a selected collection of research work on multi-objective approach to machine learning, including multi-objective feature selection, multi-objective model selection in training multi-layer perceptrons, radial-basis-function networks, support vector machines, decision trees, and intelligent systems.
Mathematical Tools for Data Mining : Set Theory, Partial Orders, Combinatorics
Mathematics is presented in a thorough and rigorous manner offering a detailed explanation of each topic, with applications to data mining such as frequent item sets, clustering, decision trees also being discussed. More than 400 exercises are included and they form an integral part of the material. Some of the exercises are in reality supplemental material and their solutions are included. The reader is assumed to have a knowledge of elementary analysis.
Fundamentals of pattern recognition and machine learning
Fundamentals of Pattern Recognition and Machine Learning is designed for a one or two-semester introductory course in Pattern Recognition or Machine Learning at the graduate or advanced undergraduate level. The book combines theory and practice and is suitable to the classroom and self-study.
Fundamentals of image data mining : Analysis, features, classification and retrieval
Presents a comprehensive review of the essentials of image data mining, and the latest cutting-edge techniques used in the field. The coverage spans all aspects of image analysis and understanding, offering deep insights into areas of feature extraction, machine learning, and image retrieval. The theoretical coverage is supported by practical mathematical models and algorithms, utilizing data from real-world examples and experiments. Topics and features: Describes essential tools for image mining, covering Fourier transforms, Gabor filters, and contemporary wavelet transforms / Develops many new exercises (most with MATLAB code and instructions) / Includes review summaries at the end of each chapter / Analyses state-of-the-art models, algorithms, and procedures for image mining / Integrates new sections on pre-processing, discrete cosine transform, and statistical inference and testing / Demonstrates how features like color, texture, and shape can be mined or extracted for image representation / Applies powerful classification approaches: Bayesian classification, support vector machines, neural / networks, and decision trees / Implements imaging techniques for indexing, ranking, and presentation, as well as database visualization
Feasibility and Infeasibility in Optimization : Algorithms and Computational Methods
Feasibility and Infeasibility in Optimization is a timely expository book that summarizes the state of the art in both classical and recent algorithms related to feasibility and infeasibility in optimization, with a focus on practical methods. All model forms are covered, including linear, nonlinear, and mixed-integer programs. Connections to related work in constraint programming are shown. Part I of the book addresses algorithms for seeking feasibility quickly, including new methods for the difficult cases of nonlinear and mixed-integer programs. Part II provides algorithms for analyzing infeasibility by isolating minimal infeasible (or maximum feasible) subsets of constraints, or by finding the best repair for the infeasibility. Infeasibility analysis algorithms have arisen primarily over the last two decades, and the book covers these in depth and detail. Part III describes applications in numerous areas outside of direct infeasibility analysis such as finding decision trees for data classification, analyzing protein folding, radiation treatment planning, automated test assembly, etc.
Designing smart homes : The role of artificial intelligence
The area of smart homes is fast developing as an emergent area which attracts the synergy of several areas of science. This volume offers a collection of contributions addressing how artificial intelligence (AI), one of the core areas of computer science, can bring the growing area of smart homes to a higher level of functionality where homes can truly realize the long standing dream of proactively helping their inhabitants in an intelligent way.
Data mining and Knowledge discovery handbook
Data Mining and Knowledge Discovery Handbook organizes all major concepts, theories, methodologies, trends, challenges and applications of data mining (DM) and knowledge discovery in databases (KDD) into a coherent and unified repository. This book first surveys, then provides comprehensive yet concise algorithmic descriptions of methods, including classic methods plus the extensions and novel methods developed recently. This volume concludes with in-depth descriptions of data mining applications in various interdisciplinary industries including finance, marketing, medicine, biology, engineering, telecommunications, software, and security.
Data Mining : A Knowledge Discovery Approach
This book on data mining details the unique steps of the knowledge discovery process that prescribe the sequence in which data mining projects should be performed. Data Mining offers an authoritative treatment of all development phases from problem and data understanding through data preprocessing to deployment of the results. This knowledge discovery approach is what distinguishes this book from other texts in the area. It concentrates on data preparation, clustering and association rule learning (required for processing unsupervised data), decision trees, rule induction algorithms, neural networks, and many other data mining methods, focusing predominantly on those which have proven successful in data mining projects.
Computational Discovery of Scientific Knowledge : Introduction, Techniques, and Applications in Environmental and Life Sciences
Advances in technology have enabled the collection of data from scientific observations, simulations, and experiments at an ever-increasing pace. For the scientist and engineer to benefit from these enhanced data collecting capabilities, it is becoming clear that semi-automated data analysis techniques must be applied to find the useful information in the data. Computational scientific discovery methods can be used to this end: they focus on applying computational methods to automate scientific activities, such as finding laws from observational data. In contrast to mining scientific data, which focuses on building highly predictive models, computational scientific discovery puts a strong emphasis on discovering knowledge represented in formalisms used by scientists and engineers, such as numeric equations and reaction pathways. This state-of-the-art survey provides an introduction to computational approaches to the discovery of scientific knowledge and gives an overview of recent advances in this area, including techniques and applications in environmental and life sciences.
Local Pattern Detection ; International Seminar Dagstuhl Castle, Germany, April 12-16, 2004, Revised Selected Papers
Introduction The dramatic increase in available computer storage capacity over the last 10 years has led to the creation of very large databases of scienti?c and commercial information. The need to analyze these masses of data has led to the evolution of the new field knowledge discovery in databases (KDD) at the intersection of machine learning, statistics and database technology. Being interdisciplinary by nature, the field offers the opportunity to combine the expertise of different fields into a common objective. Moreover, within each field diverse methods have been developed and justified with respect to different quality criteria. We have to investigate how these methods can contributet o solving the problem of KDD. Traditionally, KDD was seeking to end global models for the data that - plain most of the instances of the database and describe the general structure of the data. Examples are statistical time series models, cluster models, logic programs with high coverageor classi?cation models like decision trees or linear decision functions. In practice, though, the use of these models often is very l- ited, because global models tend to end only the obvious patterns in the data, 1 which domain experts already are aware of . What is really of interest to the users are the local patterns that deviate from the already-known background knowledge. David Hand, who organized a workshop in 2002, proposed the new field of local patterns.
Learning Classifier Systems ; International Workshops, IWLCS 2003-2005, Revised Selected Papers
The work embodied in this volume was presented across three consecutive e- tions of the International Workshop on Learning Classi?er Systems that took place in Chicago (2003), Seattle (2004), and Washington (2005). The Genetic and Evolutionary Computation Conference, the main ACM SIGEvo conference, hosted these three editions.
Knowledge Discovery in Databases : PKDD 2007 ; 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings
The two premier annual European conferences in the areas of machine learning and data mining have been collocated ever since the ?rst joint conference in Freiburg, 2001. The European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD) was?rstheldin1997inTrondheim, Norway.
Knowledge discovery in databases : PKDD 2006 ; 10th European Conference on Principles and practice of knowledge discovery in databases, Berlin, Germany, September 18-22, 2006, Proceedings
The European Conference on Principles and Practice of Knowledge Discovery in Databases celebrates its tenth anniversary ; the first PKDD took place in 1997 in Trondheim, Norway. Over the years, the ECML/PKDD series has evolved into one of the largest and most selective international conferences in these areas, the only one that provides a common forum for the two closely related ?elds. In 2006, the 6th collocated ECML/PKDD took place during September 18-22, when the Humboldt-Universität zu Berlin hosted the 17th European Conference on Machine Learning (ECML) and the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD). The successful model of a hierarchical reviewing process that was introduced last year for the ECML/PKDD 2005 in Porto has been taken over in 2006.
