Location:
Search - Apriori-code
Search list
Description: 本程序是数据挖掘中的关联规则模型中著名的Aprior算法的VC实现程序，可用于知识发现、数据挖掘、人工智能、模式识别等领域（请先解压文件）-The code is the VC implementation of the well-known Aprior algorithm in Association Rule Model of Data Mining field, can be used in Knowledge Discovery, Data Mining, AI, Pattern Recognition and so on.(Please unzip the file first)
Platform: |
Size: 73442 |
Author: 杨永刚 |
Hits:
Description: 关联规则发现vc源代码-association rules found vc source code
Platform: |
Size: 48739 |
Author: yzh |
Hits:
Description: 这是一个数据挖掘中的关联规则挖掘的经典算法：Apriori算法的程序-This is the code of Apriori-the classical algorithm used in Association Rules of Data Mining
Platform: |
Size: 694609 |
Author: 金水湾 |
Hits:
Description: 一个用Apriori算法实现的数据挖掘关联规则程序-An implementation of Association Rules Data Mining using Apriori Algorithm
Platform: |
Size: 84992 |
Author: 潘文斌 |
Hits:
Description: own Java code. WEKA 是一个机器学习运算法则，它是为解决真实世界中的数据问题。它用java写成并且几乎可以在任何平台上运行。运算法则能够被直接应用到数据集上或者从你自己的java 码中调用。-own Java code. WEKA is a machine learning algorithms, it is to solve the real-world data. Using java can be written in almost any platform. Algorithms can be directly applied to the data collected on or from your own java code call.
Platform: |
Size: 4892672 |
Author: |
Hits:
Description: Apriori算法源码（C++）
看了以前在这里发的apriori源码，觉得写得代码有些繁琐，现在重写了一下，主要是把数据操作和界面显示分离，使用了stl和boost，简化了字符操作的算法，数据库用的是mysql的，API是mysql++,在mfc下mysql++无法运行，所以gui框架用的是win32gui-lib(可以到sf.net/project/win32gui下载)。当然你也可以用odbc改写，或是换用别的数据库，因为算法逻辑是独立的，所以应该很容易改写
-Apriori algorithm source code (C) read here in the past made the algorithm source code some feel cumbersome written code, rewrite it, and the data is the main operation and interface shows separation, stl and use the boost, simplified characters of algorithms, databases using the mysql. API is mysql, the mfc mysql could not operate under, So the framework of the gui is win32gui-lib (logo can/project/win32gui download). Of course, you can also use odbc rewritten, or used for other databases, because logic algorithm is independent, Therefore, it should be very easy to rewrite
Platform: |
Size: 28672 |
Author: libing |
Hits:
Description: 本程序为apriori算法的java代码程序， 具有一定得实用性-procedures for the algorithm algorithm java code procedures, in a certain practicality
Platform: |
Size: 53248 |
Author: 沈海天 |
Hits:
Description: 数据挖掘中关联规则的经典算法Apriori算法源代码，可以连接到数据库-Data Mining Association Rules classical algorithm Apriori algorithm source code, can be connected to the database
Platform: |
Size: 75776 |
Author: dx |
Hits:
Description: 使用C++STL实现的关联规则挖掘Apriori算法，代码简洁易懂。-use C STL realized Apriori association rule mining algorithm, code easy to read.
Platform: |
Size: 7168 |
Author: szg |
Hits:
Description: 一个用C语言编写的Apriori程序源代码。-a C language Apriori source code.
Platform: |
Size: 3072 |
Author: lixiaoqing |
Hits:
Description: 数据挖掘的一个源代码，实现了Apriori算法，应用在水污染相关数据上，对学习这方面的有很好的参考价值-a data mining source code, achieving Apriori algorithm, used in water-related data, learning in this area have a good reference value
Platform: |
Size: 4096 |
Author: 李小宇 |
Hits:
Description: apriorall代码很完整，用java编的-apriorall code complete with java series
Platform: |
Size: 41984 |
Author: 赵晓峰 |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 30720 |
Author: clark |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 33792 |
Author: clark |
Hits:
Description: 框架版本的java apriori 源代码 -Framework version of the java apriori framework source code version of the java apriori source code
Platform: |
Size: 10240 |
Author: sn |
Hits:
Description: 数据挖掘中并行关联规则中经典Apriori算法的Java源代码实现。-Parallel data mining association rules in the classical Apriori algorithm realize the Java source code.
Platform: |
Size: 4096 |
Author: 张国祥 |
Hits:
Description: apriori算法源码，自己下了看吧，具体不清楚，别处来的-apriori algorithm source code, the look under their own specific do not know, somewhere else to
Platform: |
Size: 15360 |
Author: 杨柳 |
Hits:
Description: apriori算法的详细代码，并且附有数据，以及程序运行方法！-apriori algorithm code in detail and accompanied by data, and methods of program runs!
Platform: |
Size: 97280 |
Author: zcinalily |
Hits:
Description: 经典的Apriori算法由于要多次扫描数据库，产生大量的候选项集，极大的影响了算法的时间和空间效率。为了减少数据库的扫描次数，可采用矩阵记录所需数据并放入内存中。矩阵record的每个行号对应一个商品码（即一个项），每个列号对应一个客户号（即一个事务）。倘若第j个客户买了第i个商品，则record[i][j]=1,否则record[i][j]=0. 扫描一遍数据库，将矩阵record初始化。接下来的工作，都可以通过扫描内存中的矩阵进行，不必再扫描数据库。(The classic Apriori algorithm generates many candidate itemsets because it needs to scan the database many times, which greatly affects the time and space efficiency of the algorithm. In order to reduce the number of database scanning, we can use matrix to record the required data and put it into memory. Every row number of matrix record corresponds to a commodity code, that is, one item, and each column number corresponds to a customer number (i.e. a transaction). If a j customer buys a I commodity, then record[i][j]=1, otherwise record[i][j]=0. scan the database once and initialize the matrix record. The next work can be done by scanning the matrix in memory without scanning the database again.)
Platform: |
Size: 23552 |
Author: 等朕称了帝 |
Hits:
Description: apriori算法python代码实现，需用数据集进行测试(Apriori algorithm Python code implementation, you need to take the data set to test.)
Platform: |
Size: 2048 |
Author: zbyyyyyy |
Hits: