Discovery Science: 10th International Conference, DS 2007 Sendai, Japan, October 1-4, 2007. Proceedings: Lecture Notes in Computer Science, cartea 4755
Editat de Vincent Corruble, Masayuki Takeda, Einoshin Suzukien Limba Engleză Paperback – 17 sep 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 389.11 lei
Nou
Puncte Express: 584
Preț estimativ în valută:
74.47€ • 76.82$ • 63.02£
74.47€ • 76.82$ • 63.02£
Carte tipărită la comandă
Livrare economică 05-19 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540754879
ISBN-10: 3540754873
Pagini: 314
Ilustrații: XI, 300 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.44 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540754873
Pagini: 314
Ilustrații: XI, 300 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.44 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- Challenge for Info-plosion.- Machine Learning in Ecosystem Informatics.- Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity.- A Theory of Similarity Functions for Learning and Clustering.- A Hilbert Space Embedding for Distributions.- Long Papers.- Time and Space Efficient Discovery of Maximal Geometric Graphs.- Iterative Reordering of Rules for Building Ensembles Without Relearning.- On Approximating Minimum Infrequent and Maximum Frequent Sets.- A Partially Dynamic Clustering Algorithm for Data Insertion and Removal.- Positivism Against Constructivism: A Network Game to Learn Epistemology.- Learning Locally Weighted C4.4 for Class Probability Estimation.- User Preference Modeling from Positive Contents for Personalized Recommendation.- Reducing Trials by Thinning-Out in Skill Discovery.- A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets.- Fast NML Computation for Naive Bayes Models.- Unsupervised Spam Detection Based on String Alienness Measures.- A Consequence Finding Approach for Full Clausal Abduction.- Literature-Based Discovery by an Enhanced Information Retrieval Model.- Discovering Mentorship Information from Author Collaboration Networks.- Active Contours as Knowledge Discovery Methods.- An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining.- Discovering Implicit Feedbacks from Search Engine Log Files.- Regular Papers.- Pharmacophore Knowledge Refinement Method in the Chemical Structure Space.- An Attempt to Rebuild C. Bernard’s Scientific Steps.- Semantic Annotation of Data Tables Using a Domain Ontology.- Model Selection and Estimation Via Subjective User Preferences.- Detecting Concept Drift Using StatisticalTesting.- Towards Future Technology Projection: A Method for Extracting Capability Phrases from Documents.- Efficient Incremental Mining of Top-K Frequent Closed Itemsets.- An Intentional Kernel Function for RNA Classification.- Mining Subtrees with Frequent Occurrence of Similar Subtrees.- Semantic Based Real-Time Clustering for PubMed Literatures.