Description: This paper studies the problem of categorical data clustering,
especially for transactional data characterized by high
dimensionality and large volume. Starting from a heuristic method
of increasing the height-to-width ratio of the cluster histogram, we
develop a novel algorithm – CLOPE, which is very fast and
scalable, while being quite effective. We demonstrate the
performance of our algorithm on two real world-This paper studies the problem of categori cal data clustering. especially for transactional data characteri propellant by high dimensionality and large volume. St. arting from a heuristic method of increasing th e height-to-width ratio of the cluster histogr am, we develop a novel algorithm-CLOPE. which is very fast and scalable, while being quite effective. We demonstrate th e performance of our algorithm on two real world Platform: |
Size: 108363 |
Author:hanzhang |
Hits:
Description: 开发环境:Matlab
简要说明:动量-自适应学习调整算法。在实际应用中，原始的BP算法很难胜任，因此出现了很多的改进算法。BP算法的改进主要有两种途径，一种是采用启发式学习方法，另一种则是采用更有效的优化算法。本例采用动量BP算法，来实现对网络的训练过程，动量法降低了网络对于误差曲面局部细节的敏感性，有效地抑制网络陷于局部极小。-development environment : Matlab Brief Description : Momentum-adaptive learning algorithm adjustments. In practical application, the original BP algorithm competence, resulting in a lot of improved algorithm. BP algorithm improvements There are two main ways of using a heuristic approach to learning Another is the use of a more effective method of optimization. Momentum cases using the BP algorithm to achieve the network training process, Momentum for reducing error of the network for local surface details of the sensitivity, to effectively curb the network into local minima. Platform: |
Size: 1024 |
Author:zhangjian |
Hits:
Description: 基因算法（GA）
GA 是一种启发式的优化法 （heuristic optimization method）， 它是通过既定的随机搜索进行操作．优化问题的可能的解的集合被认为是 个体（individuals）组成的 人群（population）． 一个个体对它的环境的适应程度由它的 健康度（fitness）表示． -genetic algorithm (GA) GA is a heuristic optimization method (heuristic optimi method. 5), which is established through a random search for the operation. Optimization of the solution may be considered a collection of individuals (individuals) of the crowd (pop ulation). It's an individual adaptation to the environment by its Health (fitness). Platform: |
Size: 16384 |
Author:黄波 |
Hits:
Description: 1、对于凯撒密文，实现了：1种盲目式搜索，4种启发式搜索，以及利用密钥实现的凯撒加密系统。
2、对于代入法密文，实现了：2种启发式搜索，1种利用密钥的代入法加密系统以及随机生成密钥的代入法加密系统。
3、字典工具，实现了对词库的增加，删除，检查等一系列的操作。
4、7种其他较为经典的加密方法的加密解密工具。包括：DES、Vigenere、IDEA、Keyword、LFSR、Playfair以及RC4等。
-1, Caesar ciphertext, realized : a blind search species, four species of heuristic search, and the use of the keys for encryption system Caesar. 2, substituting it into law ciphertext, realized : two kinds of heuristic search, a key species used in lieu of law into the system and random encryption key generation to generation method of encryption systems. 3, dictionary tools, for the achievement of the Thesaurus of addition, deletion, and examined a series of operations. 4,7 kinds of other more classic methods of encryption tools for encryption and decryption. Including : DES, Vigenere, IDEA, Keyword, LFSR, Playfair and RC4, and so on. Platform: |
Size: 10400768 |
Author:陈守勇 |
Hits:
Description: This paper studies the problem of categorical data clustering,
especially for transactional data characterized by high
dimensionality and large volume. Starting from a heuristic method
of increasing the height-to-width ratio of the cluster histogram, we
develop a novel algorithm – CLOPE, which is very fast and
scalable, while being quite effective. We demonstrate the
performance of our algorithm on two real world-This paper studies the problem of categori cal data clustering. especially for transactional data characteri propellant by high dimensionality and large volume. St. arting from a heuristic method of increasing th e height-to-width ratio of the cluster histogr am, we develop a novel algorithm-CLOPE. which is very fast and scalable, while being quite effective. We demonstrate th e performance of our algorithm on two real world Platform: |
Size: 108544 |
Author:hanzhang |
Hits:
Description: 蚁群算法是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题-Ant colony algorithm is a combinatorial optimization problem to solve a new type of general-purpose heuristic method, the method has positive feedback, distributed computing and constructive greedy heuristic search features. Through the establishment of appropriate mathematical model, based on the fault over-current distribution network fault location into a nonlinear global optimization problem Platform: |
Size: 3072 |
Author:陈艳玲 |
Hits:
Description: A new heuristic algorithm-ant colony optimization and its basical theory are introduced in this article to solve the complicated and optimized questions.This method simulates the course of ant searching food to solve this kind of questions.It has these merits such as intelligent searching,holistic optimizing,strong solidity,distributed calculate and easily to combine with other methods. Platform: |
Size: 869376 |
Author:wangliang |
Hits:
Description: 谢金星，邢文训
本书系统地介绍了禁忌搜索、模拟退火、遗传
算法、人工神经网络和拉格朗日松驰等现代优化计算方法的模型与理论、应用技术和应用案例。本书共6章，第1章介绍算法复杂性的基本概念和启发式算法的评价方法，后5章分别介绍各个现代优化计算方法。-Xie Venus, Xing Wenxun book systematically introduce the tabu search, simulated annealing, genetic algorithms, artificial neural networks and modern optimization Lagrangian relaxation method of calculating the model with the theory, applied technology and application of the case. A total of 6 book chapters, Chapter 1 Introduction algorithm complexity of the basic concepts and heuristic algorithm of the evaluation methods, Chapter 5, respectively, after the introduction of modern optimization of the various methods of calculation. Platform: |
Size: 4205568 |
Author:萧七 |
Hits:
Description: java编写的最短路径算法，先由启发式方法获得染色体的初始编码，然后由遗传算法求出最短路径，对解决物流领域的TSP是非常好的计算机实现-java prepared by the shortest path algorithm, by the heuristic method to obtain the initial encoding of chromosome, and then by the genetic algorithm to derive the shortest path to solve the TSP area of logistics is a very good computer Platform: |
Size: 312320 |
Author:wangxiaofang |
Hits:
Description: 遗传算法是一种模拟生物进化机制的随机全局优化搜索方法，具有很强的全局优化能力及鲁棒性。遗传算法属于直接搜索法，对适应函数基本无限制，既不要求连续，也不要求函数可微，而且不需要初始信息可以寻求全局最优解克服了单纯形算法初始条件影响大，易陷入局部最小等缺点，操作方便，速度快，不需要复杂的规则，且可用于多目标寻优，在解空间进行高效启发式搜索，可以提高运算速度。-The genetic algorithm is one simulation organic evolution mechanism stochastic global optimization reconnaissance method, has the very strong global optimization ability and robustness. The genetic algorithm belongs to the direct search method, to adapts the function basically unlimited, also does not request continual, also does not request the function differentiable, moreover did not need the initial information to be possible to seek the globally optimal solution to overcome the simplex algorithm initial condition to affect in a big way, easy to fall into is partially smallest and so on shortcomings, the ease of operation, the speed is quick, did not need the complex rule, and might use in the multi-objective optimizations, carried on the highly effective heuristic search in the solution space, might raise the operating speed. Platform: |
Size: 3072 |
Author:大同小异 |
Hits:
Description: SFLA算法是解决组合性优化问题的算法。它是基于集合类方法的启发式研究，这种SFLA初始化于一群虚拟集合青蛙，在池塘中跳跃，搜寻最优的食物地点。青蛙们可以被看作是具有思维的的主体。一种思维可以被看作是一个思想的集合或是文化的进化。每一种思维都是由一系列策略构成。在这种策略进化期间，青蛙的思维也在发生改变，导致了他们在面向目标时方位的改变，这种思维的变化或改变的发生，正是因为青蛙受到其他更好思想的影响。-SFLA algorithm to solve portfolio optimization problems and algorithms. It is based on the collections of the heuristic research method, which is initialized to a group of SFLA virtual collection of frogs, jumping in the pond, searching for the optimal location of food. Frogs can be seen as the main body with thinking. Can be seen as a way of thinking is a set of ideological or cultural evolution. Each type of thinking is constituted by a series of strategies. Period in the evolution of this strategy, the frog is also a change of thinking, leading to goal-oriented when they change direction, this way of thinking of the change or changes occur, because frogs are better ideas. Platform: |
Size: 194560 |
Author:yangfei |
Hits:
Description: The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator
matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is
introduced. The method is based on a rigorous approach to spin glasses developed by Francesco
Guerra. It allows to construct lower bounds on the entropy of the transmitted message conditional
to the received one. Based on heuristic statistical mechanics calculations, we conjecture
such bounds to be tight. The result holds for standard irregular ensembles when used over
binary input output symmetric channels.
The method is first developed for Tanner graph ensembles with Poisson left degree distribution.
It is then generalized to ‘multi-Poisson’ graphs, and, by a completion procedure, to
arbitrary degree distribution. Platform: |
Size: 457728 |
Author:mike zhou |
Hits:
Description: Minoux’s greedy algorithm is a method of a heuristic solution for the network design with linear separable costs. Platform: |
Size: 172032 |
Author:Makmur Hidayat |
Hits:
Description: 用状态空间法求解传教士-野人问题，设计启发式函数引导规则的选用。
通过设计，深入理解状态空间概念与启发式搜索技术，培养一般问题求解能力。-Using state space method for solving the missionaries- Yeti issues, design heuristic function to guide the selection of the rules. By design, in-depth understanding of the concept of the state space and heuristic search techniques, developing general problem-solving ability. Platform: |
Size: 2048 |
Author:chaoyalin |
Hits:
Description: 蚁群算法是一种用来在图中寻找优化路径的机率型技术，该算法具有许多优良的性质，具有一种新的模拟进化优化方法的有效性和应用价值， 是一种求解组合最优化问题的新型通用启发式方法，可以解决一维静态优化问题甚至多维动态组合优化问题。
-Ant colony algorithm is a method used to find optimal path in the graph of the probability-based technology, the algorithm has many good properties, with a new kind of simulated evolutionary optimization method is effective and value is a kind of solving combinatorial optimization issue a new general-purpose heuristic method to solve the static optimization problem of one-dimensional or even multi-dimensional dynamic combinatorial optimization problems. Platform: |
Size: 2048 |
Author:曹艳丽 |
Hits:
Description: 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of optimization problems to solve new general heuristic method, which has a positive feedback, distributed computing and constructive and the greedy heuristic search features. Through the establishment of an appropriate mathematical model, over-current fault-based distribution network fault location into a nonlinear global optimization problem. Platform: |
Size: 3072 |
Author:prince |
Hits:
Description: 本程序实现了对影像特征点自动提取，利用Morevac、Forstner、Harris3个经典算子。在此基础上利用相关系数法实现影像自动匹配，并且引入最小二乘平差，使匹配点精度有所提高。
在搜索点过程中，利用了核线影像特性，对二维影像搜索使用了爬山法启发式搜索。对大数据量影像采用影像金字塔结构处理。
1、使用GDAL库读取影片，支持TIFF、PNG、JPEG、JPG、BMP、GIF、IMG格式读取。使用GDI绘图。
2、防止大数据量绘图视图闪烁，图片显示采用双缓存技术。
3、保存视图数据为图片文件，支持TIFF、PNG、JPEG、JPG、BMP、GIF格式保存。
4、TreeCtrl控件、ListCtrl控件的基本操作。
5、MFC单文档程序视图通讯、更换视图、视图分割。-This program of image features automatic extraction point, use Morevac, Forstner, Harris3 a classic operator. Based on the correlation coefficient method using the image matching, realization and introducing least squares adjustment, the matching point to improve precision.
In the search process, the use of the image characteristics of nuclear line, 2d image search using the heuristic method of climbing. For large quantity of data using image processing image pyramid structure.
1, using film, read GDAL repository support JPEG, TIFF, PNG, GIF, BMP, JPG, read IMG format. Use GDI drawing.
2 and prevent large amount of data, drawing view pictures showed adopt double caching techniques.
3, save for the image file, views data support JPEG, TIFF, JPG, PNG, GIF, BMP format.
4 and TreeCtrl controls, the basic operation ListCtrl controls.
5 and MFC single document procedure view communication, replace view, view. Platform: |
Size: 3047424 |
Author:方毅 |
Hits:
Description: 最小增量法的代码，是用来求解邮递员问题的改进启发式方法，能求得近似解-The small increments, the code is used to solve the problem of a heuristic method to improve the postman, i can procure approximate solutions
Platform: |
Size: 1024 |
Author:sqq |
Hits:
Description: Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers-Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers Platform: |
Size: 2048 |
Author:ahmed |
Hits:
Search - heuristic method