Machine Learning: ECML 2006 17th European Conference on Machine Learning Berlin, Germany, September 18-22, 2006 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Fürnkranz, Johannes (Επιμελητής έκδοσης), Scheffer, Tobias (Επιμελητής έκδοσης), Spiliopoulou, Myra (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
Σειρά:Lecture Notes in Computer Science, 4212
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 07142nam a22005535i 4500
001 978-3-540-46056-5
003 DE-He213
005 20151123193825.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 |a 9783540460565  |9 978-3-540-46056-5 
024 7 |a 10.1007/11871842  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Machine Learning: ECML 2006  |h [electronic resource] :  |b 17th European Conference on Machine Learning Berlin, Germany, September 18-22, 2006 Proceedings /  |c edited by Johannes Fürnkranz, Tobias Scheffer, Myra Spiliopoulou. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2006. 
300 |a XXIII, 851 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4212 
505 0 |a Invited Talks -- On Temporal Evolution in Data Streams -- The Future of CiteSeer: CiteSeerx -- Learning to Have Fun -- Winning the DARPA Grand Challenge -- Challenges of Urban Sensing -- Long Papers -- Learning in One-Shot Strategic Form Games -- A Selective Sampling Strategy for Label Ranking -- Combinatorial Markov Random Fields -- Learning Stochastic Tree Edit Distance -- Pertinent Background Knowledge for Learning Protein Grammars -- Improving Bayesian Network Structure Search with Random Variable Aggregation Hierarchies -- Sequence Discrimination Using Phase-Type Distributions -- Languages as Hyperplanes: Grammatical Inference with String Kernels -- Toward Robust Real-World Inference: A New Perspective on Explanation-Based Learning -- Fisher Kernels for Relational Data -- Evaluating Misclassifications in Imbalanced Data -- Improving Control-Knowledge Acquisition for Planning by Active Learning -- PAC-Learning of Markov Models with Hidden State -- A Discriminative Approach for the Retrieval of Images from Text Queries -- TildeCRF: Conditional Random Fields for Logical Sequences -- Unsupervised Multiple-Instance Learning for Functional Profiling of Genomic Data -- Bayesian Learning of Markov Network Structure -- Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks -- Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions -- EM Algorithm for Symmetric Causal Independence Models -- Deconvolutive Clustering of Markov States -- Patching Approximate Solutions in Reinforcement Learning -- Fast Variational Inference for Gaussian Process Models Through KL-Correction -- Bandit Based Monte-Carlo Planning -- Bayesian Learning with Mixtures of Trees -- Transductive Gaussian Process Regression with Automatic Model Selection -- Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees -- Why Is Rule Learning Optimistic and How to Correct It -- Automatically Evolving Rule Induction Algorithms -- Bayesian Active Learning for Sensitivity Analysis -- Mixtures of Kikuchi Approximations -- Boosting in PN Spaces -- Prioritizing Point-Based POMDP Solvers -- Graph Based Semi-supervised Learning with Sharper Edges -- Margin-Based Active Learning for Structured Output Spaces -- Skill Acquisition Via Transfer Learning and Advice Taking -- Constant Rate Approximate Maximum Margin Algorithms -- Batch Classification with Applications in Computer Aided Diagnosis -- Improving the Ranking Performance of Decision Trees -- Multiple-Instance Learning Via Random Walk -- Localized Alternative Cluster Ensembles for Collaborative Structuring -- Distributional Features for Text Categorization -- Subspace Metric Ensembles for Semi-supervised Clustering of High Dimensional Data -- An Adaptive Kernel Method for Semi-supervised Clustering -- To Select or To Weigh: A Comparative Study of Model Selection and Model Weighing for SPODE Ensembles -- Ensembles of Nearest Neighbor Forecasts -- Short Papers -- Learning Process Models with Missing Data -- Case-Based Label Ranking -- Cascade Evaluation of Clustering Algorithms -- Making Good Probability Estimates for Regression -- Fast Spectral Clustering of Data Using Sequential Matrix Compression -- An Information-Theoretic Framework for High-Order Co-clustering of Heterogeneous Objects -- Efficient Inference in Large Conditional Random Fields -- A Kernel-Based Approach to Estimating Phase Shifts Between Irregularly Sampled Time Series: An Application to Gravitational Lenses -- Cost-Sensitive Decision Tree Learning for Forensic Classification -- The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces -- Right of Inference: Nearest Rectangle Learning Revisited -- Reinforcement Learning for MDPs with Constraints -- Efficient Non-linear Control Through Neuroevolution -- Efficient Prediction-Based Validation for Document Clustering -- On Testing the Missing at Random Assumption -- B-Matching for Spectral Clustering -- Multi-class Ensemble-Based Active Learning -- Active Learning with Irrelevant Examples -- Classification with Support Hyperplanes -- (Agnostic) PAC Learning Concepts in Higher-Order Logic -- Evaluating Feature Selection for SVMs in High Dimensions -- Revisiting Fisher Kernels for Document Similarities -- Scaling Model-Based Average-Reward Reinforcement Learning for Product Delivery -- Robust Probabilistic Calibration -- Missing Data in Kernel PCA -- Exploiting Extremely Rare Features in Text Categorization -- Efficient Large Scale Linear Programming Support Vector Machines -- An Efficient Approximation to Lookahead in Relational Learners -- Improvement of Systems Management Policies Using Hybrid Reinforcement Learning -- Diversified SVM Ensembles for Large Data Sets -- Dynamic Integration with Random Forests -- Bagging Using Statistical Queries -- Guiding the Search in the NO Region of the Phase Transition Problem with a Partial Subsumption Test -- Spline Embedding for Nonlinear Dimensionality Reduction -- Cost-Sensitive Learning of SVM for Ranking -- Variational Bayesian Dirichlet-Multinomial Allocation for Exponential Family Mixtures. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 0 |a Mathematical logic. 
650 0 |a Database management. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Database Management. 
700 1 |a Fürnkranz, Johannes.  |e editor. 
700 1 |a Scheffer, Tobias.  |e editor. 
700 1 |a Spiliopoulou, Myra.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540453758 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4212 
856 4 0 |u http://dx.doi.org/10.1007/11871842  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)