Pinned Repositories
2019-CCF-BDCI-Car_sales
2019年CCF大数据与计算智能大赛乘用车细分市场销量预测冠军解决方案
Ai-Learn
人工智能学习路线图，整理近200个实战案例与项目，免费提供配套教材，零基础入门，就业实战！包括：Python，数学，机器学习，数据分析，深度学习，计算机视觉，自然语言处理，PyTorch tensorflow machine-learning,deep-learning data-analysis data-mining mathematics data-science artificial-intelligence python tensorflow tensorflow2 caffe keras pytorch algorithm numpy pandas matplotlib seaborn nlp cv等热门领域
Algorithm-learning
研一开始关于算法的学习过程，分享小白学习过程中遇到的错误，踩的坑，如何解决
Arsenal-DataAnalysis
Tianchi Data Analysis
competition-baseline
数据科学竞赛各种baseline代码、思路分享
Deep-Learning-Papers-Reading-Roadmap
Deep Learning papers reading roadmap for anyone who are eager to learn this amazing tech!
denmune-clustering-algorithm
DenMune a clustering algorithm that can find clusters of arbitrary size, shapes and densities in two-dimensions. Higher dimensions are first reduced to 2-D using the t-sne. The algorithm relies on a single parameter K (the number of nearest neighbors). The results show the superiority of DenMune. Enjoy the simplicty but the power of DenMune.
DensityPeakCluster
Python Code For 'Clustering By Fast Search And Find Of Density Peaks' In Science 2014.
DPC
clustering by fast search and find of density peaks
Education
"数智教育"数据可视化创新大赛
pxzheng01's Repositories
pxzheng01/Ai-Learn
人工智能学习路线图，整理近200个实战案例与项目，免费提供配套教材，零基础入门，就业实战！包括：Python，数学，机器学习，数据分析，深度学习，计算机视觉，自然语言处理，PyTorch tensorflow machine-learning,deep-learning data-analysis data-mining mathematics data-science artificial-intelligence python tensorflow tensorflow2 caffe keras pytorch algorithm numpy pandas matplotlib seaborn nlp cv等热门领域
pxzheng01/2019-CCF-BDCI-Car_sales
2019年CCF大数据与计算智能大赛乘用车细分市场销量预测冠军解决方案
pxzheng01/Algorithm-learning
研一开始关于算法的学习过程，分享小白学习过程中遇到的错误，踩的坑，如何解决
pxzheng01/Arsenal-DataAnalysis
Tianchi Data Analysis
pxzheng01/competition-baseline
数据科学竞赛各种baseline代码、思路分享
pxzheng01/Deep-Learning-Papers-Reading-Roadmap
Deep Learning papers reading roadmap for anyone who are eager to learn this amazing tech!
pxzheng01/denmune-clustering-algorithm
DenMune a clustering algorithm that can find clusters of arbitrary size, shapes and densities in two-dimensions. Higher dimensions are first reduced to 2-D using the t-sne. The algorithm relies on a single parameter K (the number of nearest neighbors). The results show the superiority of DenMune. Enjoy the simplicty but the power of DenMune.
pxzheng01/DensityPeakCluster
Python Code For 'Clustering By Fast Search And Find Of Density Peaks' In Science 2014.
pxzheng01/DPC
clustering by fast search and find of density peaks
pxzheng01/Education
"数智教育"数据可视化创新大赛
pxzheng01/FINCH-Clustering
Source Code for FINCH Clustering Algorithm
pxzheng01/Machine-Learning-Session
pxzheng01/NPIR
Nearest Point with Indexing Ratio (NPIR) is an efficient clustering algorithm based on the k-nearest neighbors with an indexing ratio
pxzheng01/pso-clustering
PSO-Clustering algorithm [Matlab code]
pxzheng01/SimpleSVClustering
A simple implementation of support vector clustering in only python/numpy
pxzheng01/SupplyChain
智能供应链分析，对顾客用rfm模型分类，用多种机器学习模型建模，进行欺诈订单预测，延迟发货预测，销售额预测，销售数量预测
pxzheng01/support-vector-clustering
Python implementation of scalable support vector clustering
pxzheng01/svc
Support vector clustering toolbox (SVC-Toolbox) for GNU Octave.
pxzheng01/SVC-1
Support vector clustering