panda熊猫陈
jessiedido
第一章 绪论1 数据挖掘概述2 数据挖掘的分类3 数据挖掘研究的公开问题4 国内外数据挖掘研究现状本章参考文献第二章 KDD的理论基础1 数学理论Ⅰ2 数学理论Ⅱ3 机器学习理论4 数据库理论5 可视化理论本章参考文献第三章 计算智能方法理论基础1 神经网络2 进化计算3 免疫克隆计算第四章 基于神经网络与进化计算的分类1 神经网络分类2 海量数据的组织协同进化分类算法3 基于免疫克隆算法的特征选择本章参考文献第五章 支撑矢量机与核分类1 统计学习理论2 支撑矢量机3 子波核匹配追踪学习机本章参考文献第六章 集成分类器1 集成学习2 Boosting概述3 Bagging算法4 基于免疫克隆算法的选择性SVMs集成5 核匹配追踪分类器集成本章参考文献第七章 大规模数据聚类算法第八章 关联规则挖掘第九章 数据挖掘应用实例及可视化
tiaotiao1985
google 搜索一下太多了。AA M "Rasprostranenie zakona bol'shih chisel na velichiny, zavisyaschie drug ot druga" Izvestiya Fiziko-matematicheskogo obschestva pri Kazanskom universitete, 2-ya seriya, tom 15, 135–156, AA M "Extension of the limit theorems of probability theory to a sum of variables connected in a chain" reprinted in Appendix B of: R H Dynamic Probabilistic Systems, volume 1: Markov C John Wiley and Sons, Classical Text in Translation: A A Markov, An Example of Statistical Investigation of the Text Eugene Onegin Concerning the Connection of Samples in Chains, David L Science in Context 4 (2006): 591– Online: B P Original edition published by Addison-Wesley, 1968; reprinted by Society for Industrial and Applied Mathematics, ISBN 0-89871-296- (See Chapter )JL D Stochastic P New York: John Wiley and Sons, ISBN 0-471-52369-S P Meyn and R L T Markov Chains and Stochastic S London: Springer-Verlag, ISBN 0-387-19832- online: _files/html Second edition to appear, Cambridge University Press, S P M Control Techniques for Complex N Cambridge University Press, ISBN 978-0-521-88441- Appendix contains abridged Meyn & T online: _files/CTCN/CTCNhtmlBooth, Taylor L (1967) Sequential Machines and Automata Theory (1st ) New York: John Wiley and Sons, I Library of Congress Card Catalog Number 67- Extensive, wide-ranging book meant for specialists, written for both theoretical computer scientists as well as electrical With detailed explanations of state minimization techniques, FSMs, Turing machines, Markov processes, and Excellent treatment of Markov processes Discusses Z-transforms, D transforms in their Kemeny, John G; Hazleton Mirkil, J Laurie Snell, Gerald L Thompson (1959) Finite Mathematical Structures (1st ) Englewood Cliffs, NJ: Prentice-Hall, I Library of Congress Card Catalog Number 59- Classical cf Chapter 6 Finite Markov Chains E N "General irreducible Markov chains and non-negative operators" Cambridge University Press, 1984, ISBN 0-521-60494-XSeneta, E Non-negative matrices and Markov 2nd , 1981, XVI, 288 , Softcover Springer Series in S (Originally published by Allen & Unwin L, London, 1973) ISBN 978-0-387-29765-1Kishor S Trivedi, Probability and Statistics with Reliability, Queueing, and Computer Science Applications, John Wiley & Sons, I New York, ISBN 0-471-33341-KSTrivedi and RASahner, SHARPE at the age of twenty-two, 36, 4, -52-57, ACM SIGMETRICS Performance Evaluation Review, RASahner, KSTrivedi and A Puliafito, Performance and reliability analysis of computer systems: an example-based approach using the SHARPE software package, Kluwer Academic Publishers, ISBN 0-7923-9650-GBolch, SGreiner, Hde Meer and KSTrivedi, Queueing Networks and Markov Chains, John Wiley, 2nd edition, ISBN 978-0-7923-9650-
复制完整地址下载我国电子商务推荐策略的比较分析余力,刘鲁,罗掌华-系统工程理论与实践,2004-04-24(8)-pdf电子商务发展与中介效率的博弈论分析邵兵家
相关范文:数据挖掘技术及其应用摘要:随着网络、数据库技术的迅速发畏以及数据库管理系统的广泛应用,人们积累的数据越来越多。数据挖掘(Data Mining)就是从
可以看看。
是这个不? 传统运输向物流业发展的途径分析 2007-5-28 共有 人次浏览 国务院在今年下发的《关于加快发展服务业的若干意见》中提出。要优先发展运输业
数据挖掘是从大量数据中提取人们感兴趣知识的高级处理过程, 这些知识是隐含的、 事先未知的, 并且是可信的、 新颖的、 潜在有用的、 能被人们理解的模式。随着信息