P2P信息检索系统的查询结果排序与合并策略

基于P2P信息检索系统的特性,提出了一种完全分布式的查询结果排序与合并策略.首先分析当前P2P信息检索系统查询结果排序和合并问题的根源;接着提出一种完全分布式的查询结果排序与合并策略,包括元数据管理策略、查询结果的排序与合并的实现;然后用详细的实验证明了该策略的有效性.     

基于改进的SOFM神经网络的矢量量化方法

基于Kohonen自组织特征映射(SOFM)神经网络的矢量量化图像压缩编码是一种非常高效的方法,但其码字利用不均匀,某些神经元永远无法获胜而产生"死神经元"的问题仍然十分明显。在追求为使各个神经元能以较为均衡的几率获胜,尽量避免"死神经元"过程中,Kohonen SOFM-C很具代表性,它既能保持拓扑不变性映射又能最有效地避免"死神经元",是一种带"良心"的竞争学习方法。本文利用Kohonen SOFM-C码字利用更为均衡的优点,并针对SOFM在胜出神经元的邻域内神经元修改权值方法的不足,提出基于SOFM-C的辅助神经元自组织映射算法,此方法具有开放性,可随时添加入新的有效算法模块以达到更好的效果。并把该矢量量化算法应用于小波变换域,以获得更好的码书。仿真结果表明,该方法优于已有的SOFM方法。     

Expansive and Competitive Learning for Vector Quantization

In this paper, we develop a necessary and sufficient condition for a local minimum to be a global minimum to the vector quantization problem and present a competitive learning algorithm based on this condition which has two learning terms; the first term regulates the force of attraction between the synaptic weight vectors and the input patterns in order to reach a local minimum while the second term regulates the repulsion between the synaptic weight vectors and the input's gravity center to favor convergence to the global minimum This algorithm leads to optimal or near optimal solutions and it allows the network to escape from local minima during training. Experimental results in image compression demonstrate that it outperforms the simple competitive learning algorithm, giving better codebooks.     

A Novel Self-Creating Neural Network for Learning Vector Quantization

This paper presents a novel self-creating neural network scheme which employs two resource counters to record network learning activity. The proposed scheme not only achieves the biologically plausible learning property, but it also harmonizes equi-error and equi-probable criteria. The training process is smooth and incremental: it not only avoids the stability-and-plasticity dilemma, but also overcomes the dead-node problem and the deficiency of local minimum. Comparison studies on learning vector quantization involving stationary and non-stationary, structured and non-structured inputs demonstrate that the proposed scheme outperforms other competitive networks in terms of quantization error, learning speed, and codeword search efficiency.     

对等网络中检索结果合并策略研究

针对对等网络中检索结果的重复问题,提出一种检索结果合并策略。介绍一种重复文档检测方法,对于重复文档,采用以减少下载数据量和下载响应时间为目的的下载节点选择方法及合并算法,有效减少检索结果的冗余度、下载数据的网络传输量和获取数据的响应时间。实验验证了该方法的有效性。     

基于矢量量化的嵌入式零树小波改进编码方法

基于矢量量化的SOFM算法和嵌入式零树小波算法(EZW)如今已经广泛的被使用于图像压缩领域,均被认为是非常有效的压缩编码技术。矢量量化方法压缩比较高,但往往存在分块效应,而EZW算法在高压缩比情况下存在恢复的图像质量较差的问题,提出一种基于矢量量化的嵌入式零树小波方法,它的基本原理是引入差值图像思想,先对原图像做矢量量化,再将原图像与矢量量化的恢复图像求差值图像,差值图像经过小波分解以后会存在大量为0的小波系数,再利用EZW编码,帮助提高重建图像质量。实验表明,相对于EZW和JPEG2000算法,本文算法的压缩比和编码质量均有显著提高。     

Self-Organizing Maps and Learning Vector Quantization for Feature Sequences

The Self-Organizing Map (SOM) and Learning Vector Quantization (LVQ) algorithms are constructed in this work for variable-length and warped feature sequences. The novelty is to associate an entire feature vector sequence, instead of a single feature vector, as a model with each SOM node. Dynamic time warping is used to obtain time-normalized distances between sequences with different lengths. Starting with random initialization, ordered feature sequence maps then ensue, and Learning Vector Quantization can be used to fine tune the prototype sequences for optimal class separation. The resulting SOM models, the prototype sequences, can then be used for the recognition as well as synthesis of patterns. Good results have been obtained in speaker-independent speech recognition.     

矢量量化的误差竞争学习算法

提出了误差竞争学习（Ｄｉｓｔｏｒｔｉｏｎ ｃｏｐｍｐｅｔｉｔｉｖｅ ｌｅａｒｎｉｎｇ,ＤＣＬ）算法。该算法基于Ｇｅｒｓｈｏ的矢量量化误差渐近理论的等误差原则,即当码本数趋于无穷大时,各区域子误差相等,使用这个原则作为最优码书设计的一个必要条件,并结合传统最优码书设计的两个必要条件,然后根据这３个必要条件：（１）最近邻规则;（２）中心准则;（３）各区域了误差近似相等设计最优码书,而在算法的实现中引入     

基于LVQ的软件项目风险评估模型的研究

以16种风险为基础,建立了一个新的软件项目风险评估模型,把以往每个软件项目的16种风险看做一个16×1维列矢量,并做为LVQ神经网络的训练矢量,对其进行聚类分析,最终把项目风险水平分为:风险水平很低、风险水平中等、风险水平很高等三个类别,并对项目风险水平做出预测。     

用于矢量量化的神经网络竞争学习算法

对典型的竞争学习算法进行了研究和分析，提出了一种基于神经元获胜概率的概率敏感竞争虎法。与传统竞争学习算法只有一个神经元获胜而得到学习不同，ＰＳＣＬ算法按照各种凶的获胜概率并通过对失真距离的调整使每个神经元均得到不同的学习，可以有效地克服神经元欠利用问题。     

基于路径学习的信息自动抽取方法

针对用户需求的网页信息自动抽取是解决互联网信息爆炸问题的一个有效途径 ,然而现有的信息自动抽取方法均难以同时满足网页信息自动抽取中查全率与查准率高、抽取速度快、抽取信息量大和用户负担轻的要求 .本文提出了一种基于路径学习的信息自动抽取方法 ,并采用该方法编制了一个商品价格信息自动抽取系统 .实验结果表明 ,该方法具有用户负担较轻 (只需用户提供 2～ 4个学习实例 )、查全率 (97.0 4～ 10 0 % )与查准率 (99～ 10 0 % )高、可实现大样本量信息抽取和时间资源耗费少 (抽取时间 <1秒 )等特点 ,能基本满足网页信息自动抽取的要求 .     

基于多层向量空间模型的Web信息检索方法

针对Web信息检索的特点,在分析传统向量空间模型存在问题的基础上,提出了一种多层向量空间模型。该模型将一篇文档的相关信息从逻辑上划分为多个相对独立的文本段。按照不同位置的文本段确定相应的索引项权重,并给出了该模型的相似度计算方法。实验表明,将该模型应用于Web信息检索中,具有对输出结果的排序能力强、查询速度快等优点。     

Rule-Based Learning Systems for Support Vector Machines

In this article, we propose some methods for deriving symbolic interpretation of data in the form of rule based learning systems by using Support Vector Machines (SVM). First, Radial Basis Function Neural Networks (RBFNN) learning techniques are explored, as is usual in the literature, since the local nature of this paradigm makes it a suitable platform for performing rule extraction. By using support vectors from a learned SVM it is possible in our approach to use any standard Radial Basis Function (RBF) learning technique for the rule extraction, whilst avoiding the overlapping between classes problem. We will show that merging node centers and support vectors explanation rules can be obtained in the form of ellipsoids and hyper-rectangles. Next, in a dual form, following the framework developed for RBFNN, we construct an algorithm for SVM. Taking SVM as the main paradigm, geometry in the input space is defined from a combination of support vectors and prototype vectors obtained from any clustering algorithm. Finally, randomness associated with clustering algorithms or RBF learning is avoided by using only a learned SVM to define the geometry of the studied region. The results obtained from a certain number of experiments on benchmarks in different domains are also given, leading to a conclusion on the viability of our proposal.     

基于增量学习支持向量机的音频例子识别与检索

音频例子识别与检索的主要任务是构造一个良好的分类学习机，而在构造过程中，从含有冗余样本的训练库中选择最佳训练例子、节省学习机的训练时间是构造分类机面临的一个挑战，尤其是对含有大样本训练库音频例子的识别．由于支持向量是支持向量机中的关键例子，提出了增量学习支持向量机训练算法．在这个算法中，训练样本被分成训练子库按批次进行训练，每次训练中，只保留支持向量，去除非支持向量．与普通和减量支持向量机对比的实验表明，算法在显著减少训练时间前提下，取得了良好的识别检索正确率．     

基于向量空间模型的并行信息检索算法

基于向量空间模型的信息检索技术是较为成熟且应用广泛的信息检索技术，该技术将文档和查询信息均用向量空间表示，查询匹配问题转化为向量空间的矢量匹配问题，文档与查询的相似度可用向量之间的夹角来度量．信息检索速度是衡量信息检索技术好坏的重要指标，基于向量空间模型的信息检索之串行算法的计算复杂度为θ（n^3），本文提出了一种在Hypercube SIMD模型上的并行算法，其时间计算复杂度为θ（nlogn），该算法与传统的串行算法相比，能显著地提高查询速度．     

使用遗传算法的信息检索动态参数学习方法

信息检索系统中的参数设定在很大程度上决定着系统的检索性能．参数的数据相关性和敏感性使得经验值往往不可靠．另一方面,由于在检索过程中缺乏当前查询的相关文档信息,因而不可能进行有指导的参数学习．因此,自动无指导的参数学习方法是极为必要和重要的．首先考察传统上根据经验值设定固定的系统参数的效果,结果表明其泛化能力差,效果不稳定且不可靠．其次,提出一种使用遗传算法进行动态参数学习的方法．在TREC11,TREC10和TREC9三组大规模Web标准测试数据集上进行了实验,数据集规模均超过10GB．实验结果表明,经过动态参数学习,系统性能总是能够接近甚至达到可能实现的最优性能．     

基于排序学习算法的智能检索系统

本文旨在解决数据资产管理系统中信息检索效率低、检索结果准确率低下的痛点,基于排序学习算法构建智能检索系统,提升检索结果和用户请求的相关性.对排序学习算法理论进行研究,对常用的排序学习算法进行相关优化,将分类问题扩展到文本排序问题之上,定义相关的目标函数及损失函数,使用机器学习的方法来提升检索结果的准确度.基于垂直分布式...     

Learning effective color features for content based image retrieval in dermatology

We investigate the extraction of effective color features for a content-based image retrieval (CBIR) application in dermatology. Effectiveness is measured by the rate of correct retrieval of images from four color classes of skin lesions. We employ and compare two different methods to learn favorable feature representations for this special application: limited rank matrix learning vector quantization (LiRaM LVQ) and a Large Margin Nearest Neighbor (LMNN) approach. Both methods use labeled training data and provide a discriminant linear transformation of the original features, potentially to a lower dimensional space. The extracted color features are used to retrieve images from a database by a k-nearest neighbor search. We perform a comparison of retrieval rates achieved with extracted and original features for eight different standard color spaces. We achieved significant improvements in every examined color space. The increase of the mean correct retrieval rate lies between 10% and 27% in the range of k=1-25 retrieved images, and the correct retrieval rate lies between 84% and 64%. We present explicit combinations of RGB and CIE-Lab color features corresponding to healthy and lesion skin. LiRaM LVQ and the computationally more expensive LMNN give comparable results for large values of the method parameter κ of LMNN (κ≥25) while LiRaM LVQ outperforms LMNN for smaller values of κ. We conclude that feature extraction by LiRaM LVQ leads to considerable improvement in color-based retrieval of dermatologic images.     

基于前向神经网络的交互式图像检索系统

相关反馈技术是近年来基于内容图像检索中的研究重点,它有效地缩短了用户的高层语义概念同图像的底层视觉特征之间的差距,从而大大提高了系统的检索精度.本文对比了前向神经网络中的BP、FP和RBF三种网络学习算法;并在此基础上从机器学习的角度出发,分析了在图像检索中基于这三种网络的不同相关反馈技术.最后对今后的研究方向进行了展望.     

面向领域的个性化智能检索系统MySpy的研究与开发

针对互联网上的“Rich Data Poor Information”问题 ,进行了面向领域的个性化智能检索系统的开发与研究 .系统采用多 Agent技术实现对 web文档索引数据库管理 ;实现基于智能代理的信息过滤和个性化服务 ;利用辅助词典、同义词词典和蕴含词词典 ,对查询词进行概念扩检 ,使检索结果能返回与查询需求相似的文档 .