Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part I: Lecture Notes in Computer Science, cartea 7818
Editat de Jian Pei, Vincent S. Tseng, Longbing Cao, Hiroshi Motoda, Guandong Xuen Limba Engleză Paperback – 20 mar 2013
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (2) | 340.90 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 19 mar 2013 | 340.90 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 20 mar 2013 | 342.02 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 567.60 lei
- 20% Preț: 571.63 lei
- 15% Preț: 568.74 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 574.05 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 20% Preț: 649.49 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 20% Preț: 575.48 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 809.19 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 747.79 lei
- Preț: 389.48 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 342.02 lei
Preț vechi: 427.52 lei
-20% Nou
Puncte Express: 513
Preț estimativ în valută:
65.48€ • 68.16$ • 53.90£
65.48€ • 68.16$ • 53.90£
Carte tipărită la comandă
Livrare economică 01-15 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642374524
ISBN-10: 3642374522
Pagini: 632
Ilustrații: XXII, 610 p. 199 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.88 kg
Ediția:2013
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: 3642374522
Pagini: 632
Ilustrații: XXII, 610 p. 199 illus.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.88 kg
Ediția:2013
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
Discovering Local Subgroups, with an Application to Fraud Detection.- PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data.- Frequent Pattern Mining in Attributed Trees.- Mining Frequent Patterns from Human Interactions in Meetings Using Directed Acyclic Graphs.- ClaSP: An Efficient Algorithm for Mining Frequent Closed Sequences.- Efficient Mining of Contrast Patterns on Large Scale Imbalanced Real-Life Data.- Online Cross-Lingual PLSI for Evolutionary Theme Patterns Analysis.- F-Trail: Finding Patterns in Taxi Trajectories.- Mining Appliance Usage Patterns in Smart Home Environment.- Computational Models of Stress in Reading Using Physiological and Physical Sensor Data.- Latent Patient Profile Modelling and Applications with Mixed-Variate Restricted Boltzmann Machine.- MassBayes: A New Generative Classifier with Multi-dimensional Likelihood Estimation.- Fast and Effective Single Pass Bayesian Learning.- Sparse Reductions for Fixed-Size Least Squares Support Vector Machines on Large Scale Data.- Discovery of Regional Co-location Patterns with k-Nearest Neighbor Graph.- Spectral Decomposition for Optimal Graph Index Prediction.- Patterns amongst Competing Task Frequencies: Super-Linearities, and the Almond-DG Model.- Node Classification in Social Network via a Factor Graph Model.- Fast Graph Stream Classification Using Discriminative Clique Hashing.- Mining Interesting Itemsets in Graph Datasets.- Robust Synchronization-Based Graph Clustering.- Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors.- Exploiting Temporal Information in a Two-Stage Classification Framework for Content-Based Depression Detection.- EEG-Based Person Verification Using Multi-Sphere SVDD and UBM.- Measuring Reproducibility of High-Throughput Deep-Sequencing Experiments Based on Self-adaptive Mixture Copula.- Mining Representative Movement Patterns through Compression.- NARGES: Prediction Model for Informed Routing in a Communications Network.- Mining Usage Traces of Mobile Apps for Dynamic Preference Prediction.- Leveraging Hybrid Citation Context for Impact Summarization.- Optimal Allocation of High Dimensional Assets through Canonical Vines.- Inducing Context Gazetteers from Encyclopedic Databases for Named Entity Recognition.- An Optimization Method for Proportionally Diversifying Search Results.- Joint Naıve Bayes and LDA for Unsupervised Sentiment Analysis.- An Unsupervised Learning Model to Perform Side Channel Attack.- Decisive Supervised Learning.- Learning Overlap Optimization for Domain Decomposition Methods.- CLUEKR : CLUstering Based Efficient kNN Regression.- AREM: A Novel Associative Regression Model Based on EM Algorithm.- One-Class Transfer Learning with Uncertain Data.- Time Series Forecasting Using Distribution Enhanced Linear Regression.- Twin Bridge Transfer Learning for Sparse Collaborative Filtering.- Dimensionality Reduction with Dimension Selection.- Multi-View Visual Classification via a Mixed-Norm Regularizer.- Mining Specific Features for Acquiring User Information Needs.- Ensemble-Based Wrapper Methods for Feature Selection and Class Imbalance Learning.- Exploring Groups from Heterogeneous Data via Sparse Learning.- Multiplex Topic Models.- Integrating Clustering and Ranking on Hybrid Heterogeneous Information Network.- Learning from Multiple Observers with Unknown Expertise.
Caracteristici
State-of-the-art research Fast track conference proceedings Up-to-date results in knowledge discovery and data mining