A program to find frequent molecular substructures and discriminative fragments in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining.
標(biāo)簽： discriminative substructures fragments molecular
上傳時(shí)間： 2014-01-20
上傳用戶：龍飛艇
A program to demonstrate the optimization process of particle swarm optimization. A two-dimensional objective function is visualized by level of grey: the lighter the color, the higher the function value. The particles are shown as red circles, their trajectory as red lines.
標(biāo)簽： optimization two-dimensional demonstrate particle
上傳時(shí)間： 2013-12-22
上傳用戶：Andy123456
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
標(biāo)簽： optimization demonstrate the traveling
上傳時(shí)間： 2015-07-12
上傳用戶：偷心的海盜
A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists.
標(biāo)簽： algorithm frequent itemsets program
上傳時(shí)間： 2013-12-27
上傳用戶：ouyangtongze
Programs to induce a naive possibilistic classifier (a possibilistic analog of the naive Bayes classifier) and to classify new data with an induced naive possibilistic classifier.
標(biāo)簽： possibilistic naive classifier Programs
上傳時(shí)間： 2015-07-12
上傳用戶：蟲蟲蟲蟲蟲蟲
This OpenNL, a library to easily construct and solve sparse linear systems. * OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradient,BICGSTAB, GMRes) and preconditioners (Jacobi, SSOR). * OpenNL can also use other solvers (SuperLU 3.0 is supported as an OpenNL extension,MUMPS will be supported in a future version)
標(biāo)簽： OpenNL construct supplied library
上傳時(shí)間： 2014-01-07
上傳用戶：semi1981
本程序直接摘自文獻(xiàn)： ％ S. K. Mitra. Digital Signal Processing: A Computer-Based Approach. Second Edition, ％ McGraw-Hill,2001 清華大學(xué)出版社，2001
標(biāo)簽： S. K. Computer-Based Processing
上傳時(shí)間： 2014-12-02
上傳用戶：佳期如夢(mèng)
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part.
標(biāo)簽： estimates incidence Computes forests
上傳時(shí)間： 2013-12-26
上傳用戶：com1com2
Computes the permanent of a nonnegative integer matrix. Notes: Compile in C++, "g++ -o permanent permanent.c".
標(biāo)簽： permanent nonnegative Computes Compile
上傳時(shí)間： 2013-12-23
上傳用戶：zhangyi99104144
Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then "make" the codes (this codes are in C, not C++). The program is then run by the command "wmatch".
標(biāo)簽： hafnian nonnegative the Computes
上傳時(shí)間： 2013-12-23
上傳用戶：lmeeworm
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
