基于VSM的自适应信息过滤系统的研究与设计

为了从网络动态信息流中获得感兴趣的内容或过滤掉无关的垃圾信息,设计了一个基于向量空间模型的自适应信息过滤系统;描述了该系统的结构和工作流程;对该系统实现的关键技术,包括文本表示、用户模板与过滤阈值初始化、特征项选取、自适应过滤算法、模板更新和阈值调整等进行了深入的分析和研究。     

网络信息过滤系统的设计与实现

随着Internet普及和应用,电子商务已经成为一种发展趋势。网络的安全日益引起人们的关注。提供一定的手段,实时对网络中的信息进行监测具有十分重要的意义。本文利用向量空间模型、TC3分类算法、Rocchio反馈模型等构造了一个具有反馈机制的网络信息过滤系统(NIFS),并且从信息过滤系统结构、网络信息捕获、用户兴趣文件(Profile)的形成与重构等方面对网络信息过滤系统(NIFS)基本理论和实现方法进行了详细的讨论。     

基于自适应学习的文本信息过滤系统

面对实时网络信息过滤的新挑战,自适应信息过滤能够解决问题。针对现有自适应系统的不足,提出了提高模板准确性的学习和过滤阈值优化的新方法。采用增量迭代学习算法来逼近真实的过滤模板,结合非法网页的分布函数自适应调整阈值,不断提高过滤精度,并运行于一个校园网关之上,取得了较好的效果。     

改进的Web文本自适应过滤策略

面对实时网络信息过滤的新挑战,自适应信息过滤基本上能够解决问题。针对现有自适应系统的不足,本文提出提高模板准确性的学习和过滤阈值优化的新方法。改进的过滤策略过滤初期采用SVM算法,中后期采用改进的自适应模板过滤法。模板的更新采用改进的模板系数调整策略,并引入特征衰减因子来提高过滤的准确率。该系统运行于一个校园网关上,取得了较好的结果。     

一个中文网络文本过滤系统的设计

信息过滤是海量信息检索的重要手段之一,中文网络文本过滤系统在我国更具有明显的应用价值。该文介绍实现的一个中文网络文本过滤系统;该系统包括中文预处理、特征项选择、权重计算和分类等功能模块,可以方便地实现对中文网络文本的过滤功能。同时对系统采用的文本过滤算法的性能进行了测试。该系统具有一定的可扩充性和通用性。     

自适应信息过滤中使用少量正例进行阈值优化

自适应信息过滤中一个大的挑战在于其数据稀疏问题.因此,在对输入的文本流进行过滤的同时学习最优阈值非常重要.提出了一种新颖的阈值优化算法.该算法可以通过少量的正例进行快速的学习,所需数据的获得具有增量性,故而其计算量及所需的存储空间很小.此外,该算法还具有高效、健壮、实用性强等优点.在第10届国际文本检索会议(TREC10)上,复旦大学的自适应信息过滤系统使用了该阈值优化算法,并取得了第3名的成绩.其T10U和T10F分别达到了0.215和0.414.     

一种改进的自适应文本信息过滤模型

自适应信息过滤技术能够帮助用户从Web等信息海洋中获得感兴趣的内容或过滤无关垃圾信息．针对现有自适应过滤系统的不足,提出了一种改进的自适应文本信息过滤模型．模型中提供了两种相关性检索机制,在此基础上改进了反馈算法,并采用了增量训练的思想,对过滤中的自适应学习机制也提出了新的算法．基于本模型的系统在相关领域的国际评测中取得良好成绩．试验数据说明各项改进是有效的,新模型具有更高的性能．     

面向网页文本内容的网页信息过滤系统设计

该文按照基于内容理解的中文文本网页的主题探测和过滤设计网页信息过滤系统。首先对智能网页过滤系统工作流程进行了研究,然后给出了智能网页信息过滤系统的系统设并对各个模块进行分析,最后对网络数据处理、文本数据处理和自适应处理三个模块进行详细研究。     

电子商务环境下信息过滤中用户偏好调整算法

对信息过滤过程进行了分析,包括定义用户偏好、接受信息输入流、过滤以及用户反馈环节。在此基础上,分析了网络环境下群体决策信息收集与过滤的特点,提出决策信息过滤中用户偏好生成及自适应调整算法。     

三层物流网络选址-路径优化及混合启发式算法研究*

为同时解决转运、分配、选址和车辆路径问题,在考虑车辆载重和行驶距离约束,配送中心处理能力约束的基础上,构建了一个多产品三层物流网络选址-路径模型,以总成本最小为目标,提出一种基于贪婪随机自适应搜索算法和里程节约算法的混合启发式算法,给出了该算法的步骤和伪代码。实验结果表明该算法具有可行性,并且与其他算法比较而言,算法具有高效性。     

Competitive Hopfield Network Combined With Estimation of Distribution for Maximum Diversity Problems

This paper presents a discrete competitive Hopfield neural network (HNN) (DCHNN) based on the estimation of distribution algorithm (EDA) for the maximum diversity problem. In order to overcome the local minimum problem of DCHNN, the idea of EDA is combined with DCHNN. Once the network is trapped in local minima, the perturbation based on EDA can generate a new starting point for DCHNN for further search. It is expected that the further search is guided to a promising area by the probability model. Thus, the proposed algorithm can escape from local minima and further search better results. The proposed algorithm is tested on 120 benchmark problems with the size ranging from 100 to 5000. Simulation results show that the proposed algorithm is better than the other improved DCHNN such as multistart DCHNN and DCHNN with random flips and is better than or competitive with metaheuristic algorithms such as tabu-search-based algorithms and greedy randomized adaptive search procedure algorithms.      

独立任务分配的贪婪随机自适应搜索过程

提出了一种贪婪随机自适应搜索过程求解异构环境下的独立任务分配问题。使用随机化的最小最小完成时间算法来产生问题的初始解，再通过变邻域下降算法来改进这个解，在变邻域下降算法中，为增强算法的空间勘探能力，外层局部搜索采用允许接收劣质解的策略，使用禁忌表来防止迂回搜索，使算法在多样性和集中性间取得了较好的平衡。与领域中的典型算法进行了仿真比较，结果表明提出的算法具有良好的性能。     

Scalable Feature Selection in High-Dimensional Data Based on GRASP

Feature selection in high-dimensional data is one of the active areas of research in pattern recognition. Most of the algorithms in this area try to select a subset of features in a way to maximize the accuracy of classification regardless of the number of selected features that affect classification time. In this article, a new method for feature selection algorithm in high-dimensional data is proposed that can control the trade-off between accuracy and classification time. This method is based on a greedy metaheuristic algorithm called greedy randomized adaptive search procedure (GRASP). It uses an extended version of a simulated annealing (SA) algorithm for local search. In this version of SA, new parameters are embedded that allow the algorithm to control the trade-off between accuracy and classification time. Experimental results show supremacy of the proposed method over previous versions of GRASP for feature selection. Also, they show how the trade-off between accuracy and classification time is controllable by the parameters introduced in the proposed method.     

A GRASP approach to the container-loading problem

The container-loading problem aims to determine the arrangement of items in a container. We present GRMODGRASP, a new algorithm for the CLP based on the GRASP (greedy randomized adaptive search procedure) paradigm. We evaluate GRMODGRASP'S performance in terms of volume use and load stability and by comparing it with nine well-known algorithms. Our approach produces solutions that surpass other approaches' solutions in terms of volume use and cargo stability.     

Reactive GRASP for the strip-packing problem

This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite height so as to minimize the required height. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances which have been previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures. The results show that the GRASP algorithm outperforms recently reported metaheuristics.     

A path cost-based GRASP for minimum independent dominating set problem

The minimum independent dominating set problem (MIDS) is an extension of the classical dominating set problem with wide applications. In this paper, we describe a greedy randomized adaptive search procedure (GRASP) with path cost heuristic for MIDS, as well as the classical tabu mechanism. Our novel GRASP algorithm makes better use of the vertex neighborhood information provided by path cost and thus is able to discover better and more solutions and to escape from local optimal solutions when the original GRASP fails to find new improved solutions. Moreover, to further overcome the serious cycling problem, the tabu mechanism is employed to forbid some just-removed vertices back to the candidate solution. Computational experiments carried out on standard benchmarks, namely DIMACS instances, show that our algorithm consistently outperforms two MIDS solvers as well as the original GRASP.

     

混合装配线平衡排产协同优化新算法

装配线平衡和产品排序是紧密相关而且对目标值存在交互影响作用的两个NP—hard问题。文中基于这两个问题的交互影响以及贪婪随机自适应算法（GI己AsP）比较好的收敛速度和全局满意度,设计了协同优化贪婪随机自适应算法（（X）GRASP）,并行协同地优化混合装配线,并用实例对此算法进行了仿真研究。此外,文中还考虑了可能存在的瓶颈工序对协同优化效果的影响,将一种基于OPT思想的关键资源调度方法融入原来的COGRASP中,通过相应实例验证,取得的效果也非常好。     

基于改进迭代贪婪算法的预制构件调度研究

迭代贪婪算法是一种具有较强局部搜索能力的元启发式算法,但由于传统迭代贪婪算法搜索范围过大,搜索效率有限,为了进一步提升传统迭代贪婪算法的搜索能力,考虑到阈值接受算法具有能缩小搜索范围的特点,提出了一种改进的迭代贪婪算法解决流水车间预制生产的订单接受与调度问题。该改进算法是在破坏原调度序列后加入一种基于构造启发式规则的重建策略,并结合阈值接受算法的自适应接受准则用以跳出局部最优。经大量仿真实验结果显示,与传统迭代贪婪算法、禁忌搜索算法以及遗传算法对比,改进的迭代贪婪算法具有更好的求解质量和鲁棒性。     

Hybrid ensemble selection algorithm incorporating GRASP with path relinking

The greedy randomized adaptive search procedure (GRASP) is an iterative two-phase multi-start metaheuristic procedure for a combination optimization problem, while path relinking is an intensification procedure applied to the solutions generated by GRASP. In this paper, a hybrid ensemble selection algorithm incorporating GRASP with path relinking (PRelinkGraspEnS) is proposed for credit scoring. The base learner of the proposed method is an extreme learning machine (ELM). Bootstrap aggregation (bagging) is used to produce multiple diversified ELMs, while GRASP with path relinking is the approach for ensemble selection. The advantages of the ELM are inherited by the new algorithm, including fast learning speed, good generalization performance, and easy implementation. The PRelinkGraspEnS algorithm is able to escape from local optima and realizes a multi-start search. By incorporating path relinking into GRASP and using it as the ensemble selection method for the PRelinkGraspEnS the proposed algorithm becomes a procedure with a memory and high convergence speed. Three credit datasets are used to verify the efficiency of our proposed PRelinkGraspEnS algorithm. Experimental results demonstrate that PRelinkGraspEnS achieves significantly better generalization performance than the classical directed hill climbing ensemble pruning algorithm, support vector machines, multi-layer perceptrons, and a baseline method, the best single model. The experimental results further illustrate that by decreasing the average time needed to find a good-quality subensemble for the credit scoring problem, GRASP with path relinking outperforms pure GRASP (i.e., without path relinking).