k-meansy算法源代碼。This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
標(biāo)簽： code implementing directory algorithm
上傳時(shí)間： 2016-04-07
上傳用戶：shawvi
In this demo, I use the EM algorithm with a Rauch-Tung-Striebel smoother and an M step, which I ve recently derived, to train a two-layer perceptron, so as to classify medical data (kindly provided by Steve Roberts and Will Penny from EE, Imperial College). The data and simulations are described in: Nando de Freitas, Mahesan Niranjan and Andrew Gee Nonlinear State Space Estimation with Neural Networks and the EM algorithm After downloading the file, type "tar -xf EMdemo.tar" to uncompress it. This creates the directory EMdemo containing the required m files. Go to this directory, load matlab5 and type "EMtremor". The figures will then show you the simulation results, including ROC curves, likelihood plots, decision boundaries with error bars, etc. WARNING: Do make sure that you monitor the log-likelihood and check that it is increasing. Due to numerical errors, it might show glitches for some data sets.
標(biāo)簽： Rauch-Tung-Striebel algorithm smoother which
上傳時(shí)間： 2016-04-15
上傳用戶：zhenyushaw
決策樹分類，Your task for this project is to develop an system which performs a classification task with any various Decision Tree.
上傳時(shí)間： 2016-08-01
上傳用戶：源弋弋
輕易學(xué)好C++編程技巧 - 進(jìn)楷 (香港科技大學(xué)筆記 19課) 內(nèi)容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) Recursion,Linked Lists, 4) Stacks and Queues, 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing 18) Pattern Matching 19) Additional Review
標(biāo)簽： Pointers Dynamic Objects review
上傳時(shí)間： 2014-10-10
上傳用戶：chfanjiang
This a very simple baseband simulator for SC-FDMA system. This simulator is part of the upcoming book “Single Carrier FDMA: A New Air Interface for Long Term Evolution” (Wiley, Nov. 2008) which I co-authored with professor David J. Goodman at Polytechnic University. The purpose of this simulator is to give some concrete idea of how SC-FDMA system works. It does lack many realistic and sophisticated features such as channel coding, time-varying fading channel model, soft decision decoding, etc. Regardless, I am hoping that it will help you understand SC-FDMA which is a fairly new development in 3GPP LTE.
標(biāo)簽： simulator This baseband upcoming
上傳時(shí)間： 2016-08-26
上傳用戶：小草123
Recent advances in experimental methods have resulted in the generation of enormous volumes of data across the life sciences. Hence clustering and classification techniques that were once predominantly the domain of ecologists are now being used more widely. This book provides an overview of these important data analysis methods, from long-established statistical methods to more recent machine learning techniques. It aims to provide a framework that will enable the reader to recognise the assumptions and constraints that are implicit in all such techniques. Important generic issues are discussed first and then the major families of algorithms are described. Throughout the focus is on explanation and understanding and readers are directed to other resources that provide additional mathematical rigour when it is required. Examples taken from across the whole of biology, including bioinformatics, are provided throughout the book to illustrate the key concepts and each technique’s potential.
標(biāo)簽： experimental generation advances enormous
上傳時(shí)間： 2016-10-23
上傳用戶：wkchong
This document contains official rules of the 3D soccer simulation competition at RoboCup 2006. While we will try to cover all cases, if unexpected events do occur, the rule committee will seek input from the participants and then make a decision. However, once the committee has made a decision, that decision is final and will not be open to further discussion
標(biāo)簽： competition simulation document contains
上傳時(shí)間： 2016-11-30
上傳用戶：zhengzg
個(gè)體商品銷售管理及分析系統(tǒng) —進(jìn)貨處理子系統(tǒng)本文在分析商品進(jìn)貨、營(yíng)銷、存儲(chǔ)系統(tǒng)及其特點(diǎn)的基礎(chǔ)上，提出將DSS技術(shù)運(yùn)用到市場(chǎng)營(yíng)銷決策上，開發(fā)MDSS（Marketing Decision Support System）、CRM、DSM的建議，并就MDSS的總體設(shè)計(jì)思想及研究方向作簡(jiǎn)要介紹，以明確系統(tǒng)的基本組成與結(jié)構(gòu)
上傳時(shí)間： 2016-12-09
上傳用戶：changeboy
aiParts is a set of C++ classes that can be used to develop artificial intelligence for multi-decision problems. It includes classes that implement the High-Hope technique and some sample programs.
標(biāo)簽： intelligence multi-decisi artificial aiParts
上傳時(shí)間： 2017-02-20
上傳用戶：徐孺
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標(biāo)簽： fault-tolerant algorithms redundant underlyin
上傳時(shí)間： 2013-12-18
上傳用戶：jkhjkh1982
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
