References
by Krishna Choppella, Dr. Uday Kamath, Boštjan Kaluža, Jennifer L. Reese, Richard M
Machine Learning: End-to-End guide for Java developers
- Machine Learning: End-to-End guide for Java developers
- Table of Contents
- Machine Learning: End-to-End guide for Java developers
- Credits
- Preface
- 1. Module 1
- 1. Getting Started with Data Science
- Problems solved using data science
- Understanding the data science problem - solving approach
- Acquiring data for an application
- The importance and process of cleaning data
- Visualizing data to enhance understanding
- The use of statistical methods in data science
- Machine learning applied to data science
- Using neural networks in data science
- Deep learning approaches
- Performing text analysis
- Visual and audio analysis
- Improving application performance using parallel techniques
- Assembling the pieces
- Summary
- 2. Data Acquisition
- 3. Data Cleaning
- 4. Data Visualization
- 5. Statistical Data Analysis Techniques
- 6. Machine Learning
- 7. Neural Networks
- 8. Deep Learning
- 9. Text Analysis
- 10. Visual and Audio Analysis
- 11. Mathematical and Parallel Techniques for Data Analysis
- 12. Bringing It All Together
- 1. Getting Started with Data Science
- 2. Module 2
- 1. Applied Machine Learning Quick Start
- 2. Java Libraries and Platforms for Machine Learning
- 3. Basic Algorithms – Classification, Regression, and Clustering
- 4. Customer Relationship Prediction with Ensembles
- 5. Affinity Analysis
- 6. Recommendation Engine with Apache Mahout
- 7. Fraud and Anomaly Detection
- 8. Image Recognition with Deeplearning4j
- 9. Activity Recognition with Mobile Phone Sensors
- 10. Text Mining with Mallet – Topic Modeling and Spam Detection
- 11. What is Next?
- A. References
- 3. Module 3
- 1. Machine Learning Review
- Machine learning – history and definition
- What is not machine learning?
- Machine learning – concepts and terminology
- Machine learning – types and subtypes
- Datasets used in machine learning
- Machine learning applications
- Practical issues in machine learning
- Machine learning – roles and process
- Machine learning – tools and datasets
- Summary
- 2. Practical Approach to Real-World Supervised Learning
- Formal description and notation
- Data transformation and preprocessing
- Feature relevance analysis and dimensionality reduction
- Model building
- Model assessment, evaluation, and comparisons
- Case Study – Horse Colic Classification
- Summary
- References
- 3. Unsupervised Machine Learning Techniques
- Issues in common with supervised learning
- Issues specific to unsupervised learning
- Feature analysis and dimensionality reduction
- Clustering
- Outlier or anomaly detection
- Real-world case study
- Summary
- References
- 4. Semi-Supervised and Active Learning
- Semi-supervised learning
- Active learning
- Case study in active learning
- Summary
- References
- 5. Real-Time Stream Machine Learning
- Assumptions and mathematical notations
- Basic stream processing and computational techniques
- Concept drift and drift detection
- Incremental supervised learning
- Incremental unsupervised learning using clustering
- Modeling techniques
- Partition based
- Hierarchical based and micro clustering
- Density based
- Grid based
- Validation and evaluation techniques
- Key issues in stream cluster evaluation
- Evaluation measures
- Cluster Mapping Measures (CMM)
- V-Measure
- Other external measures
- Unsupervised learning using outlier detection
- Case study in stream learning
- Summary
- References
- 6. Probabilistic Graph Modeling
- Probability revisited
- Graph concepts
- Bayesian networks
- Representation
- Inference
- Learning
- Learning parameters
- Learning structures
- Measures to evaluate structures
- Methods for learning structures
- Constraint-based techniques
- Search and score-based techniques
- 7. Deep Learning
- Multi-layer feed-forward neural network
- Inputs, neurons, activation function, and mathematical notation
- Multi-layered neural network
- Structure and mathematical notations
- Activation functions in NN
- Training neural network
- Empirical risk minimization
- Parameter initialization
- Loss function
- Gradients
- Feed forward and backpropagation
- How does it work?
- Regularization
- L2 regularization
- L1 regularization
- Limitations of neural networks
- Deep learning
- Building blocks for deep learning
- Rectified linear activation function
- Restricted Boltzmann Machines
- Autoencoders
- Unsupervised pre-training and supervised fine-tuning
- Deep feed-forward NN
- Deep Autoencoders
- Deep Belief Networks
- Deep learning with dropouts
- Sparse coding
- Convolutional Neural Network
- CNN Layers
- Recurrent Neural Networks
- Building blocks for deep learning
- Case study
- Summary
- References
- 8. Text Mining and Natural Language Processing
- NLP, subfields, and tasks
- Text categorization
- Part-of-speech tagging (POS tagging)
- Text clustering
- Information extraction and named entity recognition
- Sentiment analysis and opinion mining
- Coreference resolution
- Word sense disambiguation
- Machine translation
- Semantic reasoning and inferencing
- Text summarization
- Automating question and answers
- Issues with mining unstructured data
- Text processing components and transformations
- Topics in text mining
- Tools and usage
- Summary
- References
- NLP, subfields, and tasks
- 9. Big Data Machine Learning – The Final Frontier
- What are the characteristics of Big Data?
- Big Data Machine Learning
- Batch Big Data Machine Learning
- Case study
- Business problem
- Machine Learning mapping
- Data collection
- Data sampling and transformation
- Spark MLlib as Big Data Machine Learning platform
- A. Linear Algebra
- B. Probability
- D. Bibliography
- Index
- Empirical risk minimization
- Multi-layer feed-forward neural network
- Modeling techniques
- 1. Machine Learning Review
- J. B. Lovins (1968). Development of a stemming algorithm, Mechanical Translation and Computer Linguistic, vol.11, no.1/2, pp. 22-31.
- Porter M.F, (1980). An algorithm for suffix stripping, Program; 14, 130-137.
- ZIPF, H.P., (1949). Human Behaviour and the Principle of Least Effort, Addison-Wesley, Cambridge, Massachusetts.
- LUHN, H.P., (1958). The automatic creation of literature abstracts', IBM Journal of Research and Development, 2, 159-165.
- Deerwester, S., Dumais, S., Furnas, G., & Landauer, T. (1990), Indexing by latent semantic analysis, Journal of the American Society for Information Sciences, 41, 391–407.
- Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977), Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistic Society, Series B, 39(1), 1–38.
- Greiff, W. R. (1998). A theory of term weighting based on exploratory data analysis. In 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY. ACM.
- P. F. Brown, P. V. deSouza, R. L. Mercer, V. J. Della Pietra, and J/ C. Lai (1992), Class-based n-gram models of natural language, Computational Linguistics, 18, 4, 467-479.
- T. Liu, S. Lin, Z. Chen, W.-Y. Ma (2003), An Evaluation on Feature Selection for Text Clustering, ICML Conference.
- Y. Yang, J. O. Pederson (1995). A comparative study on feature selection in text categorization, ACM SIGIR Conference.
- Salton, G. & Buckley, C. (1998). Term weighting approaches in automatic text retrieval. Information Processing & Management, 24(5), 513–523.
- Hofmann, T. (2001). Unsupervised learning by probabilistic latent semantic analysis. Machine Learning Journal, 41(1), 177–196.
- D. Blei, J. Lafferty (2006). Dynamic topic models. ICML Conference.
- D. Blei, A. Ng, M. Jordan (2003). Latent Dirichlet allocation, Journal of Machine Learning Research, 3: pp. 993–1022.
- W. Xu, X. Liu, and Y. Gong (2003). Document-Clustering based on Non-negative Matrix Factorization. Proceedings of SIGIR'03, Toronto, CA, pp. 267-273,
- Dud´ik M. and Schapire (2006). R. E. Maximum entropy distribution estimation with generalized regularization. In Lugosi, G. and Simon, H. (Eds.), COLT, Berlin, pp. 123– 138, Springer-Verlag,.
- McCallum, A., Freitag, D., and Pereira, F. C. N. (2000). Maximum Entropy Markov Models for Information Extraction and Segmentation. In ICML, pp. 591–598..
- Langville, A. N, Meyer, C. D., Albright, R. (2006). Initializations for the Nonnegative Factorization. KDD, Philadelphia, USA
- Dunning, T. (1993). Accurate Methods for the Statistics of Surprise and Coincidence. Computational Linguistics, 19, 1, pp. 61-74.
- Y. Bengio, R. Ducharme, P. Vincent and C. Jauvin (2003). A Neural Probabilistic Language Model. Journal of Machine Learning Research.
- R. Collobert, J. Weston, L. Bottou, M. Karlen, K. Kavukcuoglu, and P. Kuksa. (2011). Natural language processing (almost) from scratch. Journal of Machine Learning Research, 12:2493–2537.
- T. Mikolov, K. Chen, G. Corrado and J. Dean (2013). Efficient Estimation of Word Representations in Vector Space. arXiv:1301.3781v1.
- R. Socher, Christopher Manning, and Andrew Ng. (2010). Learning continuous phrase representations and syntactic parsing with recursive neural networks. In NIPS 2010 Workshop on Deep Learning and Unsupervised Feature Learning.
- R. Socher, J. Pennington, E. H. Huang, A. Y. Ng, and C. D. Manning. (2011). Semi-supervised recursive autoencoders for predicting sentiment distributions. In EMNLP.
- M. Luong, R. Socher and C. Manning (2013). Better word representations with recursive neural networks for morphology. CONLL.
- A. Frome, G. S. Corrado, J. Shlens, S. Bengio, J. Dean, T. Mikolov, et al (2013). Devise: A deep visual-semantic embedding model. In NIPS Proceedings.
- Léon Bottou (2011). From Machine Learning to Machine Reasoning. https://arxiv.org/pdf/1102.1808v3.pdf.
- Cho, Kyunghyun, et al (2014). Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078.
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.