Advances in intelligent data analysis : third international symposium, IDA-99, Amsterdam, the Netherlands, August 9-11, 1999 : proceedings / / David J. Hand, Joost N. Kok, Michael R. Berthold (editors) |
Edizione | [1st ed. 1999.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1999] |
Descrizione fisica | 1 online resource (XII, 544 p.) |
Disciplina | 519.5 |
Collana | Lecture Notes in Computer Science |
Soggetto topico | Mathematical statistics |
ISBN | 3-540-48412-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Learning -- From Theoretical Learnability to Statistical Measures of the Learnable -- ALM: A Methodology for Designing Accurate Linguistic Models for Intelligent Data Analysis -- A “Top-Down and Prune” Induction Scheme for Constrained Decision Committees -- Mining Clusters with Association Rules -- Evolutionary Computation to Search for Strongly Correlated Variables in High-Dimensional Time-Series -- The Biases of Decision Tree Pruning Strategies -- Feature Selection as Retrospective Pruning in Hierarchical Clustering -- Discriminative Power of Input Features in a Fuzzy Model -- Learning Elements of Representations for Redescribing Robot Experiences -- “Seeing“ Objects in Spatial Datasets -- Intelligent Monitoring Method Using Time Varying Binomial Distribution Models for Pseudo-Periodic Communication Traffic -- Visualization -- Monitoring Human Information Processing via Intelligent Data Analysis of EEG Recordings -- Knowledge-Based Visualization to Support Spatial Data Mining -- Probabilistic Topic Maps: Navigating through Large Text Collections -- 3D Grand Tour for Multidimensional Data and Clusters -- Classification and Clustering -- A Decision Tree Algorithm for Ordinal Classification -- Discovering Dynamics Using Bayesian Clustering -- Integrating Declarative Knowledge in Hierarchical Clustering Tasks -- Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization -- Supervised Classification Problems: How to Be Both Judge and Jury -- Temporal Pattern Generation Using Hidden Markov Model Based Unsupervised Classification -- Exploiting Similarity for Supporting Data Analysis and Problem Solving -- Multiple Prototype Model for Fuzzy Clustering -- A Comparison of Genetic Programming Variants for Data Classification -- Fuzzy Clustering Based on Modified Distance Measures -- Building Classes in Object-Based Languages by Automatic Clustering -- Integration -- Adjusted Estimation for the Combination of Classifiers -- Data-Driven Theory Refinement Using KBDistAl -- Reasoning about Input-Output Modeling of Dynamical Systems -- Undoing Statistical Advice -- A Method for Temporal Knowledge Conversion -- Applications -- Intrusion Detection through Behavioral Data -- Bayesian Neural Network Learning for Prediction in the Australian Dairy Industry -- Exploiting Sample-Data Distributions to Reduce the Cost of Nearest-Neighbor Searches with Kd-Trees -- Pump Failure Detection Using Support Vector Data Descriptions -- Data Mining for the Detection of Turning Points in Financial Time Series -- Computer-Assisted Classification of Legal Abstracts -- Sequential Control Logic Inferring Method from Observed Plant I/O Data -- Evaluating an Eye Screening Test -- Application of Rough Sets Algorithms to Prediction of Aircraft Component Failure -- Media Mining -- Exploiting Structural Information for Text Classification on the WWW -- Multi-agent Web Information Retrieval: Neural Network Based Approach -- Adaptive Information Filtering Algorithms -- A Conceptual Graph Approach for Video Data Representation and Retrieval. |
Record Nr. | UNINA-9910143456603321 |
Berlin ; ; Heidelberg : , : Springer, , [1999] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in intelligent data analysis : third international symposium, IDA-99, Amsterdam, the Netherlands, August 9-11, 1999 : proceedings / / David J. Hand, Joost N. Kok, Michael R. Berthold (editors) |
Edizione | [1st ed. 1999.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1999] |
Descrizione fisica | 1 online resource (XII, 544 p.) |
Disciplina | 519.5 |
Collana | Lecture Notes in Computer Science |
Soggetto topico | Mathematical statistics |
ISBN | 3-540-48412-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Learning -- From Theoretical Learnability to Statistical Measures of the Learnable -- ALM: A Methodology for Designing Accurate Linguistic Models for Intelligent Data Analysis -- A “Top-Down and Prune” Induction Scheme for Constrained Decision Committees -- Mining Clusters with Association Rules -- Evolutionary Computation to Search for Strongly Correlated Variables in High-Dimensional Time-Series -- The Biases of Decision Tree Pruning Strategies -- Feature Selection as Retrospective Pruning in Hierarchical Clustering -- Discriminative Power of Input Features in a Fuzzy Model -- Learning Elements of Representations for Redescribing Robot Experiences -- “Seeing“ Objects in Spatial Datasets -- Intelligent Monitoring Method Using Time Varying Binomial Distribution Models for Pseudo-Periodic Communication Traffic -- Visualization -- Monitoring Human Information Processing via Intelligent Data Analysis of EEG Recordings -- Knowledge-Based Visualization to Support Spatial Data Mining -- Probabilistic Topic Maps: Navigating through Large Text Collections -- 3D Grand Tour for Multidimensional Data and Clusters -- Classification and Clustering -- A Decision Tree Algorithm for Ordinal Classification -- Discovering Dynamics Using Bayesian Clustering -- Integrating Declarative Knowledge in Hierarchical Clustering Tasks -- Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization -- Supervised Classification Problems: How to Be Both Judge and Jury -- Temporal Pattern Generation Using Hidden Markov Model Based Unsupervised Classification -- Exploiting Similarity for Supporting Data Analysis and Problem Solving -- Multiple Prototype Model for Fuzzy Clustering -- A Comparison of Genetic Programming Variants for Data Classification -- Fuzzy Clustering Based on Modified Distance Measures -- Building Classes in Object-Based Languages by Automatic Clustering -- Integration -- Adjusted Estimation for the Combination of Classifiers -- Data-Driven Theory Refinement Using KBDistAl -- Reasoning about Input-Output Modeling of Dynamical Systems -- Undoing Statistical Advice -- A Method for Temporal Knowledge Conversion -- Applications -- Intrusion Detection through Behavioral Data -- Bayesian Neural Network Learning for Prediction in the Australian Dairy Industry -- Exploiting Sample-Data Distributions to Reduce the Cost of Nearest-Neighbor Searches with Kd-Trees -- Pump Failure Detection Using Support Vector Data Descriptions -- Data Mining for the Detection of Turning Points in Financial Time Series -- Computer-Assisted Classification of Legal Abstracts -- Sequential Control Logic Inferring Method from Observed Plant I/O Data -- Evaluating an Eye Screening Test -- Application of Rough Sets Algorithms to Prediction of Aircraft Component Failure -- Media Mining -- Exploiting Structural Information for Text Classification on the WWW -- Multi-agent Web Information Retrieval: Neural Network Based Approach -- Adaptive Information Filtering Algorithms -- A Conceptual Graph Approach for Video Data Representation and Retrieval. |
Record Nr. | UNISA-996465733803316 |
Berlin ; ; Heidelberg : , : Springer, , [1999] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Machine learning : ECML 2007 : 18th European Conference on Machine Learning, Warsaw, Poland, September 17-21, 2007 : proceedings / / edited by Joost N. Kok [and four others] |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (XXIV, 812 p.) |
Disciplina | 006.31 |
Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ;4701 |
Soggetto topico | Machine learning |
ISBN | 3-540-74958-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Learning, Information Extraction and the Web -- Putting Things in Order: On the Fundamental Role of Ranking in Classification and Probability Estimation -- Mining Queries -- Adventures in Personalized Information Access -- Long Papers -- Statistical Debugging Using Latent Topic Models -- Learning Balls of Strings with Correction Queries -- Neighborhood-Based Local Sensitivity -- Approximating Gaussian Processes with -Matrices -- Learning Metrics Between Tree Structured Data: Application to Image Recognition -- Shrinkage Estimator for Bayesian Network Parameters -- Level Learning Set: A Novel Classifier Based on Active Contour Models -- Learning Partially Observable Markov Models from First Passage Times -- Context Sensitive Paraphrasing with a Global Unsupervised Classifier -- Dual Strategy Active Learning -- Decision Tree Instability and Active Learning -- Constraint Selection by Committee: An Ensemble Approach to Identifying Informative Constraints for Semi-supervised Clustering -- The Cost of Learning Directed Cuts -- Spectral Clustering and Embedding with Hidden Markov Models -- Probabilistic Explanation Based Learning -- Graph-Based Domain Mapping for Transfer Learning in General Games -- Learning to Classify Documents with Only a Small Positive Training Set -- Structure Learning of Probabilistic Relational Models from Incomplete Relational Data -- Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA -- Bayesian Substructure Learning - Approximate Learning of Very Large Network Structures -- Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs -- Source Separation with Gaussian Process Models -- Discriminative Sequence Labeling by Z-Score Optimization -- Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches -- Bayesian Inference for Sparse Generalized Linear Models -- Classifier Loss Under Metric Uncertainty -- Additive Groves of Regression Trees -- Efficient Computation of Recursive Principal Component Analysis for Structured Input -- Hinge Rank Loss and the Area Under the ROC Curve -- Clustering Trees with Instance Level Constraints -- On Pairwise Naive Bayes Classifiers -- Separating Precision and Mean in Dirichlet-Enhanced High-Order Markov Models -- Safe Q-Learning on Complete History Spaces -- Random k-Labelsets: An Ensemble Method for Multilabel Classification -- Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble -- Avoiding Boosting Overfitting by Removing Confusing Samples -- Planning and Learning in Environments with Delayed Feedback -- Analyzing Co-training Style Algorithms -- Policy Gradient Critics -- An Improved Model Selection Heuristic for AUC -- Finding the Right Family: Parent and Child Selection for Averaged One-Dependence Estimators -- Short Papers -- Stepwise Induction of Multi-target Model Trees -- Comparing Rule Measures for Predictive Association Rules -- User Oriented Hierarchical Information Organization and Retrieval -- Learning a Classifier with Very Few Examples: Analogy Based and Knowledge Based Generation of New Examples for Character Recognition -- Weighted Kernel Regression for Predicting Changing Dependencies -- Counter-Example Generation-Based One-Class Classification -- Test-Cost Sensitive Classification Based on Conditioned Loss Functions -- Probabilistic Models for Action-Based Chinese Dependency Parsing -- Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search -- A Simple Lexicographic Ranker and Probability Estimator -- On Minimizing the Position Error in Label Ranking -- On Phase Transitions in Learning Sparse Networks -- Semi-supervised Collaborative Text Classification -- Learning from Relevant Tasks Only -- An Unsupervised Learning Algorithm for Rank Aggregation -- Ensembles of Multi-Objective Decision Trees -- Kernel-Based Grouping of Histogram Data -- Active Class Selection -- Sequence Labeling with Reinforcement Learning and Ranking Algorithms -- Efficient Pairwise Classification -- Scale-Space Based Weak Regressors for Boosting -- K-Means with Large and Noisy Constraint Sets -- Towards ‘Interactive’ Active Learning in Multi-view Feature Sets for Information Extraction -- Principal Component Analysis for Large Scale Problems with Lots of Missing Values -- Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling -- Class Noise Mitigation Through Instance Weighting -- Optimizing Feature Sets for Structured Data -- Roulette Sampling for Cost-Sensitive Learning -- Modeling Highway Traffic Volumes -- Undercomplete Blind Subspace Deconvolution Via Linear Prediction -- Learning an Outlier-Robust Kalman Filter -- Imitation Learning Using Graphical Models -- Nondeterministic Discretization of Weights Improves Accuracy of Neural Networks -- Semi-definite Manifold Alignment -- General Solution for Supervised Graph Embedding -- Multi-objective Genetic Programming for Multiple Instance Learning -- Exploiting Term, Predicate, and Feature Taxonomies in Propositionalization and Propositional Rule Learning. |
Altri titoli varianti |
European Conference on Machine Learning
ECML 2007 18th European Conference on Machine Learning Eighteenth European Conference on Machine Learning |
Record Nr. | UNINA-9910485018703321 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Machine learning : ECML 2007 : 18th European Conference on Machine Learning, Warsaw, Poland, September 17-21, 2007 : proceedings / / edited by Joost N. Kok [and four others] |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (XXIV, 812 p.) |
Disciplina | 006.31 |
Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ;4701 |
Soggetto topico | Machine learning |
ISBN | 3-540-74958-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Learning, Information Extraction and the Web -- Putting Things in Order: On the Fundamental Role of Ranking in Classification and Probability Estimation -- Mining Queries -- Adventures in Personalized Information Access -- Long Papers -- Statistical Debugging Using Latent Topic Models -- Learning Balls of Strings with Correction Queries -- Neighborhood-Based Local Sensitivity -- Approximating Gaussian Processes with -Matrices -- Learning Metrics Between Tree Structured Data: Application to Image Recognition -- Shrinkage Estimator for Bayesian Network Parameters -- Level Learning Set: A Novel Classifier Based on Active Contour Models -- Learning Partially Observable Markov Models from First Passage Times -- Context Sensitive Paraphrasing with a Global Unsupervised Classifier -- Dual Strategy Active Learning -- Decision Tree Instability and Active Learning -- Constraint Selection by Committee: An Ensemble Approach to Identifying Informative Constraints for Semi-supervised Clustering -- The Cost of Learning Directed Cuts -- Spectral Clustering and Embedding with Hidden Markov Models -- Probabilistic Explanation Based Learning -- Graph-Based Domain Mapping for Transfer Learning in General Games -- Learning to Classify Documents with Only a Small Positive Training Set -- Structure Learning of Probabilistic Relational Models from Incomplete Relational Data -- Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA -- Bayesian Substructure Learning - Approximate Learning of Very Large Network Structures -- Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs -- Source Separation with Gaussian Process Models -- Discriminative Sequence Labeling by Z-Score Optimization -- Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches -- Bayesian Inference for Sparse Generalized Linear Models -- Classifier Loss Under Metric Uncertainty -- Additive Groves of Regression Trees -- Efficient Computation of Recursive Principal Component Analysis for Structured Input -- Hinge Rank Loss and the Area Under the ROC Curve -- Clustering Trees with Instance Level Constraints -- On Pairwise Naive Bayes Classifiers -- Separating Precision and Mean in Dirichlet-Enhanced High-Order Markov Models -- Safe Q-Learning on Complete History Spaces -- Random k-Labelsets: An Ensemble Method for Multilabel Classification -- Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble -- Avoiding Boosting Overfitting by Removing Confusing Samples -- Planning and Learning in Environments with Delayed Feedback -- Analyzing Co-training Style Algorithms -- Policy Gradient Critics -- An Improved Model Selection Heuristic for AUC -- Finding the Right Family: Parent and Child Selection for Averaged One-Dependence Estimators -- Short Papers -- Stepwise Induction of Multi-target Model Trees -- Comparing Rule Measures for Predictive Association Rules -- User Oriented Hierarchical Information Organization and Retrieval -- Learning a Classifier with Very Few Examples: Analogy Based and Knowledge Based Generation of New Examples for Character Recognition -- Weighted Kernel Regression for Predicting Changing Dependencies -- Counter-Example Generation-Based One-Class Classification -- Test-Cost Sensitive Classification Based on Conditioned Loss Functions -- Probabilistic Models for Action-Based Chinese Dependency Parsing -- Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search -- A Simple Lexicographic Ranker and Probability Estimator -- On Minimizing the Position Error in Label Ranking -- On Phase Transitions in Learning Sparse Networks -- Semi-supervised Collaborative Text Classification -- Learning from Relevant Tasks Only -- An Unsupervised Learning Algorithm for Rank Aggregation -- Ensembles of Multi-Objective Decision Trees -- Kernel-Based Grouping of Histogram Data -- Active Class Selection -- Sequence Labeling with Reinforcement Learning and Ranking Algorithms -- Efficient Pairwise Classification -- Scale-Space Based Weak Regressors for Boosting -- K-Means with Large and Noisy Constraint Sets -- Towards ‘Interactive’ Active Learning in Multi-view Feature Sets for Information Extraction -- Principal Component Analysis for Large Scale Problems with Lots of Missing Values -- Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling -- Class Noise Mitigation Through Instance Weighting -- Optimizing Feature Sets for Structured Data -- Roulette Sampling for Cost-Sensitive Learning -- Modeling Highway Traffic Volumes -- Undercomplete Blind Subspace Deconvolution Via Linear Prediction -- Learning an Outlier-Robust Kalman Filter -- Imitation Learning Using Graphical Models -- Nondeterministic Discretization of Weights Improves Accuracy of Neural Networks -- Semi-definite Manifold Alignment -- General Solution for Supervised Graph Embedding -- Multi-objective Genetic Programming for Multiple Instance Learning -- Exploiting Term, Predicate, and Feature Taxonomies in Propositionalization and Propositional Rule Learning. |
Altri titoli varianti |
European Conference on Machine Learning
ECML 2007 18th European Conference on Machine Learning Eighteenth European Conference on Machine Learning |
Record Nr. | UNISA-996465580103316 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|