资源列表
fuzzy
- 模糊聚类分析是根据客观事物间的特征、亲疏程度、相似性，通过建立模糊相似关系对客观事物进行聚类的分析方法。-Fuzzy clustering analysis based on objective characteristics, the degree of relatedness, similarity, through the establishment of fuzzy cluster analysis method of objective things.
svmMLiA
- 支持向量机是最常用的一种分类器，它通过求解一个二次优化问题来最大化分类间隔，本例采用的SMO算法，可以大大优化运行-Support vector machine is the most commonly used classifier, it can be used to solve a two optimization problem to maximize the classification interval, this example uses the SMO algorithm, ca
keyword_find
- 实现了将pdf转换为txt,并且进行分模块的关键词抽取算法-Realized convert pdf to txt, and dividing module keyword extraction algorithm
Apriori
- Apriori算法是一种最有影响的挖掘布尔关联规则频繁项集的算法。其核心是基于两阶段频集思想的递推算法。- Apriori algorithm is one of the most influential mining Boolean association rules frequent itemsets algorithm. Its core is based on a two-stage frequency set recursive algorithm thought.
GoogleNormalDistanceCalculator
- 计算两个词语的google相似度，即google normal distance-To calculate the distance between two words with google normal distance algorithm.
FPGrowth
- FpGrowth算法的Java完整实现，可用于改进到分布式环境，自制基础数据文件后结果可生成-Results can generate a full implementation of Java FpGrowth algorithm that can be used to improve the distributed environment, homemade basic data files
time
- python 初级时间抓取，读取时间。希望对你有所帮助-python primary gripping time, read time. I hope for your help
sPl1Pl21
- 论文 Least Squares Loss for Multi-class (task) Learning via the sparse group Lasso penalty 的算法源代码，是sparse+l1+lq,1的稀疏属性选择算法。- Least Squares Loss for Multi-class (task) Learning via the sparse group Lasso penalty Problem
density-peaks-clustering
- 这是密度峰聚类的简易代码，比原作者给出的代码要简洁迅速。并提供RI指数检测。用matlab编程的代码- 这是密度峰聚类的简易代码，比原作者给出的代码要简洁迅速。并提供RI指数检测。用matlab编程的代码 This is a simple density peak clustering code, compared to the original author of the code to be concise and rapid. And provides RI index de
DecisionTree
- matlab代码实现决策树，是学习数据挖掘的基本分类器的入门代码-DecisionTree classifier about data mining coded by matlab
K-LDA
- KFDA是FDA进行首先投影到核空间，然后进行判别分析，核技巧提高了算法的可行性。-KFDA said the FDA is first projection in kernel space, and then the discriminant analysis, nuclear techniques to improve the feasibility of the algorithm.
draw-boundary
- Drawing boundary for decision tree algorithms