搜索资源列表
Sort
- The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return wi
10Algorithms-08
- This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, PageRank, AdaBoost, kNN, Naive Bayes, and CART. These top 10 algorithms
kohonen
- This program is a simple demonstration of a Kohonen self-organizing neural network. The program merely maps itself to a set of coordinates ranging from -0.5 to 0.5 on both the x and y-axis. The program layout is very simple - the Run button will
src
- 值得一提的是,实验中进行数据预处理的做法对Top-K查准率的影响很小,即如果不进行服务的粗分类而直接使用以上各种算法,在运行效率大幅下降的同时,结果并不会有明显的提高.-http://blog.csdn.net/chief1985/archive/2007/10/28/1852366.aspx
wei
- 对数据建立基于四叉树的索引，并使用skyline方法剪枝，实现top-k查询。-Data to establish an index based on quadtree and uses the method of pruning skyline, to achieve top-k query.
ChebyshevExpansion
- 给定一个普通多项式p(x)，用列向量表示，阶次从高到低排列，此函数返回p(x)的切比雪夫多项式展开的系数，返回的的结果也是一个列向量，同样按切比雪夫多项式的阶次从高到低排列 另外该函数用cos(x)项傅里叶级数展开一个多项式- ChebyshevExpansion.m by David Terr, Raytheon, 5-26-04 Given a polynomial f(x) of degree n expressed as a row vector of c
Mining
- Mining Top-K Frequent Closed Patterns without Minimum Support
top-k
- top-k算法用于数据查询，特别对于大量数据查询时效率很高，大大节省了时间-top-k algorithm for data query, especially for very efficient large amounts of data query, saving time
TopKMax
- 找出一组数字中最大的K个数，用一个K大小的最小堆维护-Output top K numbers in an array using a minheap with heapsize equals to K
k_means-algorithm
- k-means算法是模式识别十大算法之一 matlab仿真的k-means聚类算法-k-means algorithm for pattern recognition algorithm is one of the top ten k-means clustering algorithm
dataming
- 介绍数据挖掘的10种主要算法及其应用 一种透过数理模式来分析企业内储存的大量资料，以找出不同的客户或市场划分，分析出消费者喜好和行为的方法。 -Top 10 algorithms in data mining his paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006:
k-meas
- k近邻法分类iris数据。iris数据共分三类，每一类50个数据，这里把每一类前20个作为训练样本，后30个作为测试样本-k-nearest-neighbor classification iris data. iris data is divided into three categories, each category of data from 50, as the training samples in each category of the top 20 after 30 as th
knnClassification
- 十大经典人工智能算法之一——K最近邻Matlab实现-One of the top ten classical artificial intelligence algorithms- K nearest neighbor Matlab implementation
CreateMagicMatrix
- 《洛书》增强版算法解密 包括偶数阶、双偶数阶、单偶数阶等各类魔方（幻方）的生成算法源码。 其中单偶数阶最难： 单偶数魔方，n为偶数，且不能被4整除(n=6,10,14,18,22……)(n=4k+2,k=1,2,3,4,5……)。这是奇数阶魔方，双偶数阶魔方，单偶数阶魔方三种魔方里面最复杂的魔方。 以n=10为例，这时k=2。 (1)把方阵从左到右，从上到下分成A,B,C,D四个象限，这样每个象限肯定是奇数阶，用罗伯法，依次在A,D,B,C象限按奇数阶魔方的
Min
- 构建一个容量为k的大根堆，依次读取int数据，若大根堆已满，则比较读取的元素是否小于堆顶最大元素，是则先将最大元素删除，再将新元素压入。若大根堆未满，则直接将读取的元素 压入大根堆。在将n个元素依次判断比较处理完之后，即得到n个数据中最小的k个数据。将其从堆顶依次弹出，即将最小的k个元素从大到小输出。-Building a capacity of large root heap k sequentially read int data elements if a large root hea