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) | 334.67 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 19 mar 2013 | 334.67 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 20 mar 2013 | 335.74 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 426.75 lei - 20%
Preț: 315.62 lei - 20%
Preț: 320.92 lei - 15%
Preț: 426.53 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.79 lei - 20%
Preț: 355.54 lei - 20%
Preț: 355.18 lei - 20%
Preț: 390.68 lei - 20%
Preț: 392.03 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.79 lei - 20%
Preț: 495.44 lei - 20%
Preț: 498.80 lei - 20%
Preț: 498.50 lei - 20%
Preț: 355.93 lei - 20%
Preț: 639.52 lei - 20%
Preț: 499.90 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.42 lei - 20%
Preț: 326.81 lei - 20%
Preț: 391.36 lei - 20%
Preț: 321.68 lei - 20%
Preț: 498.90 lei - 20%
Preț: 312.82 lei - 20%
Preț: 496.73 lei - 20%
Preț: 320.72 lei - 20%
Preț: 497.25 lei - 15%
Preț: 496.40 lei - 20%
Preț: 324.19 lei - 20%
Preț: 498.80 lei - 20%
Preț: 461.86 lei - 20%
Preț: 355.59 lei -
Preț: 418.19 lei - 20%
Preț: 498.59 lei - 20%
Preț: 391.28 lei - 20%
Preț: 355.69 lei - 15%
Preț: 499.72 lei - 20%
Preț: 499.40 lei - 20%
Preț: 458.84 lei - 20%
Preț: 390.42 lei - 20%
Preț: 270.68 lei - 20%
Preț: 497.75 lei - 20%
Preț: 423.78 lei - 20%
Preț: 322.32 lei - 20%
Preț: 322.09 lei - 20%
Preț: 427.09 lei - 20%
Preț: 499.90 lei - 20%
Preț: 463.03 lei
Preț: 335.74 lei
Preț vechi: 419.68 lei
-20% Nou
Puncte Express: 504
Preț estimativ în valută:
59.40€ • 69.31$ • 51.93£
59.40€ • 69.31$ • 51.93£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
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