A flexible multi-layer self-organizing map for generic processing of tree-structured data

A new multi-layer self-organizing map (MLSOM) is proposed for unsupervised processing tree-structured data. The MLSOM is an improved self-organizing map for handling structured data. By introducing multiple SOM layers, the MLSOM can overcome the computational speed and visualization problems of SOM for structured data (SOM-SD). Node data in different levels of a tree are processed in different layers of the MLSOM. Root nodes are dedicatedly processed on the top SOM layer enabling the MLSOM a better utilization of SOM map compared with the SOM-SD. Thus, the MLSOM exhibits better data organization, clustering, visualization, and classification results of tree-structured data. Experimental results on three different data sets demonstrate that the proposed MLSOM approach can be more efficient and effective than the SOM-SD.     

On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain

In this paper, two state-of-the-art algorithms for the Traveling Salesman Problem (TSP) are examined in the multi-goal path planning problem motivated by inspection planning in the polygonal domain W. Both algorithms are based on the self-organizing map (SOM) for which an application in W is not typical. The first is Somhom’s algorithm, and the second is the Co-adaptive net. These algorithms are augmented by a simple approximation of the shortest path among obstacles in W. Moreover, the competitive and cooperative rules are modified by recent adaptation rules for the Euclidean TSP, and by proposed enhancements to improve the algorithms’ performance in the non-Euclidean TSP. Based on the modifications, two new variants of the algorithms are proposed that reduce the required computational time of their predecessors by an order of magnitude, therefore making SOM more competitive with combinatorial heuristics. The results show how SOM approaches can be used in the polygonal domain so they can provide additional features over the classical combinatorial approaches based on the complete visibility graph.     

A self-organizing map for transactional data and the related categorical domain

After projecting high dimensional data into a two-dimension map via the SOM, users can easily view the inner structure of the data on the 2-D map. In the early stage of data mining, it is useful for any kind of data to inspect their inner structure. However, few studies apply the SOM to transactional data and the related categorical domain, which are usually accompanied with concept hierarchies. Concept hierarchies contain information about the data but are almost ignored in such researches. This may cause mistakes in mapping. In this paper, we propose an extended SOM model, the SOMCD, which can map the varied kinds of data in the categorical domain into a 2-D map and visualize the inner structure on the map. By using tree structures to represent the different kinds of data objects and the neurons’ prototypes, a new devised distance measure which takes information embedded in concept hierarchies into consideration can properly find the similarity between the data objects and the neurons. Besides the distance measure, we base the SOMCD on a tree-growing adaptation method and integrate the U-Matrix for visualization. Users can hierarchically separate the trained neurons on the SOMCD's map into different groups and cluster the data objects eventually. From the experiments in synthetic and real datasets, the SOMCD performs better than other SOM variants and clustering algorithms in visualization, mapping and clustering.     

PolSOM: A new method for multidimensional data visualization

In this paper, a new algorithm named polar self-organizing map (PolSOM) is proposed. PolSOM is constructed on a 2-D polar map with two variables, radius and angle, which represent data weight and feature, respectively. Compared with the traditional algorithms projecting data on a Cartesian map by using the Euclidian distance as the only variable, PolSOM not only preserves the data topology and the inter-neuron distance, it also visualizes the differences among clusters in terms of weight and feature. In PolSOM, the visualization map is divided into tori and circular sectors by radial and angular coordinates, and neurons are set on the boundary intersections of circular sectors and tori as benchmarks to attract the data with the similar attributes. Every datum is projected on the map with the polar coordinates which are trained towards the winning neuron. As a result, similar data group together, and data characteristics are reflected by their positions on the map. The simulations and comparisons with Sammon's mapping, SOM and ViSOM are provided based on four data sets. The results demonstrate the effectiveness of the PolSOM algorithm for multidimensional data visualization.     

融合差分进化和SOM的组合文本聚类算法

自组织映射算法是一种重要的聚类模型,能够有效提高搜索引擎的精确性。为克服自组织映射网络对于初始连接权值敏感的不足,提出一种改进的差分进化和SOM相结合的组合文档聚类算法IDE-SOM,首先引入一种改进的差分进化算法对文档集进行一次粗聚类,旨在对SOM网络的初始连接权值进行优化,然后将这个连接权值初始化SOM网络进行细聚类。仿真实验表明,该算法在F-measure、熵等评价指标上都获得了较好的聚类效果。     

一种自动抽取图像中可判别区域的新方法

图像分割是图像处理中的一个难题，为了自动抽取图像中的可差别区域，提出了一种基于自组织图归约算法的区域抽取新方法，首先，利用包括颜色、纹理以及位置在内的多模特征抽算法，原始图像被转换成特征，接着，通过自组织映射学习算法，特征图映射成自组织图，然后，对自组织图实施归纳算法得到一族约简的自组织图谱系；最后，利用一个 综合的聚类有效性分析指标从约简的自组织图谱系中得到一个最优约简的自组织图，以此实现图像区域的分割，新方法的有效性通过两个评价实验得到了验证。     

Load estimation for microgrid planning based on a self-organizing map methodology

This study presents a novel load estimation method for isolated communities that do not receive energy or only receive it for a limited time each day. These profiles have been used to determine the installed capacity of generating units for microgrid electrification projects. The social characteristics and lifestyles of isolated communities differ from those in urban areas; therefore, the load profiles of microgrids are sensitive to minor variations in generation and/or consumption. The proposed methodology for obtaining the residential profiles is based on clustering algorithms such as k-means, a self-organizing map (SOM) or others. In this work, SOM clustering is considered because it allows a better interpretation of results that can be contrasted with social aspects. The proposed methodology includes the following components. First, the inputs are processed based on surveys of residents that live in each socio-economic level of housing and the community. Second, family types are clustered using an SOM, from which relevant information is derived that distinguishes one family from another. Third, the load profiles of each cluster are selected from a database. Additionally, social aspects and relevant energy supply information from communities with similar characteristics are used to generate the required database. The SOM for the clustering of families of the community with available energy measurements is used as an initial guess for the clustering of the families in the community with unknown energy measurements.The methodology is applied and tested in the community of El Romeral, Chile, where a microgrid will be installed. The SOM technique compares favorably with a benchmark method that uses the average load profile of a community; furthermore, the SOM clustering algorithm for the methodology is favorably compared with the k-means algorithm because the results obtained by SOM are consistent with the social aspects.     

基于分组式P2P网络的空间区域查询

针对传统集中式空间数据应用出现的性能瓶颈以及结构化P2P系统中由于数据的一致性分布而导致的空间数据物理特性丢失等问题,提出一种分组式P2P网络系统,并描述在该网络系统下的数据插入和删除、节点的加入和离开以及空间区域查询。通过仿真验证了其有效性。     

P2P视频直播数据调度算法

P2P技术解决了传统流媒体应用中的不能支持大用户的问题.而数据调度算法一直是P2P研究中的热点问题.在给出了P2P视频直播系统中节点能力的定义和计算方法后,结合BT中的Rarest First策略,提出了一种基于节点能力的适用于P2P视频直播系统的数据调度算法.该算法既考虑了流媒体数据具有时间限制的特性,同时也考虑了如何能充分的利用节点的上传带宽,增进了系统的负载平衡.     

Selecting the right MBA schools – An application of self-organizing map networks

The self-organizing map (SOM) network, an unsupervised neural computing network, is a categorization network developed by Kohonen. The SOM network was designed for solving problems that involve tasks such as clustering, visualization, and abstraction. In this study, we apply the clustering and visualization capabilities of SOM to group and plot the top 79 MBA schools as ranked by US News and World Report (USN&WR) into a two-dimensional map with four segments. The map should assist prospective students in searching for the MBA programs that best meet their personal requirements. Comparative analysis with the outputs from two popular clustering techniques K-means analysis and a two-step Factor analysis/K-means procedure are also included.     

一种基于节点可选度的P2P点播流媒体数据调度算法

当前的P2P(Peer-to-Peer)点播流媒体系统中数据调度算法未能充分利用每个用户节点自身的特性.在分析典型数据调度算法基础上提出一种基于节点可选度的数据调度算法(SSP算法).该算法一方面在调度下载数据块时综合考虑了邻居节点带宽能力及其所拥有的数据信息.另一方面对服务节点的请求处理过程进行了优化.SSP算法有利于提高用户节点播放视频的连续性,降低流媒体服务器的负载压力,从而改善P2P点播流媒体系统的整体服务质量.仿真结果和实际应用表明算法性能良好,适用于用户节点能力差异较大的P2P点播流媒体环境.     

P2P流媒体直播系统中的合作节点选择策略

合作节点选择是P2P流媒体直播系统中的核心问题之一。针对此问题进行深入分析,提出了一种基于服务能力的启发式合作节点选择策略,根据节点的服务能力对其在系统中的位置进行自适应调整,使得节点最终形成层状结构,且服务能力越高的节点位于越高层。仿真结果表明,与随机选择策略相比,该策略能够显著降低系统传输延迟。     

一种激励相容的P2P信誉模型

针对现有的信任模型不能很好地处理P2P网络环境中恶意节点提供虚假服务的欺作行为,及不积极提供诚实推荐的问题,提出了一种激励相容的P2P信誉模型(简称ICRM)。该模型使用时间区间的概念来标示经验和推荐的时间特性,利用直接信任度、推荐信任度及推荐可信度等机制来精确描述节点的实际信任等级,并引入参与层次来度量节点提供推荐的积极程度,从而有效地识别与抑制不同类型的恶意节点,激励节点积极提供诚实推荐。仿真实验表明,ICRM能够有效地抑制恶意节点的欺作行为及不诚实反馈行为,并能有效解决节点推荐积极性不高的问题。     

一种支持多维资源描述的高效P2P路由算法

在分析现有P2P(peer to peer)路由算法的基础上,提出了一种基于二阶矩定位、支持多维资源数据描述的高效资源路由算法--FAN(flabellate addressable network)路由算法.FAN算法将节点映射到统一的多维笛卡尔空间,并以节点相对空间原点的二阶矩作为子空间管理和资源搜索的依据.FAN路由算法具有O(log(N/k))的高路由效率,在节点加入和退出FAN网络时,更新路由信息的代价为O(klog(N/k)).实验结果表明,FAN路由算法具有路由效率高、维护代价小的优点,是一种P2P环境中支持多维资源数据描述的高效结构化资源路由算法.而且,目前部分基于CAN(content-addressable network)网络的改进算法也可以在FAN网络中适用,并获得更好的路由效率和更低的维护代价.     

Newsmap: a knowledge map for online news

Information technology has made possible the capture and accessing of a large number of data and knowledge bases, which in turn has brought about the problem of information overload. Text mining to turn textual information into knowledge has become a very active research area, but much of the research remains restricted to the English language. Due to the differences in linguistic characteristics and methods of natural language processing, many existing text analysis approaches have yet to be shown to be useful for the Chinese language. This research focuses on the automatic generation of a hierarchical knowledge map NewsMap, based on online Chinese news, particularly the finance and health sections. Whether in print or online, news still represents one important knowledge source that people produce and consume on a daily basis. The hierarchical knowledge map can be used as a tool for browsing business intelligence and medical knowledge hidden in news articles. In order to assess the quality of the map, an empirical study was conducted which shows that the categories of the hierarchical knowledge map generated by NewsMap are better than those generated by regular news readers, both in terms of recall and precision, on the sub-level categories but not on the top-level categories. NewsMap employs an improved interface combining a 1D alphabetical hierarchical list and a 2D Self-Organizing Map (SOM) island display. Another empirical study compared the two visualization displays and found that users' performances can be improved by taking advantage of the visual cues of the 2D SOM display.     

P2P流媒体直播分布式缓存替换算法研究

P2P流媒体直播系统中分布式节点缓存区别于传统的Client/Server缓存结构,节点的实时同步给缓存管理提出较大挑战。分析了分布式缓存空间利用率的决定因素,通过节点成功请求比率,缓存的fresh度及数据分片点击率3个指标来评估节点缓存空间利用率,提出了频度限制与改进的LRU相结合的K-Degree&LRU2缓存替换算法。仿真实验结果表明,该算法较传统的FIFO、LRU算法具有更高的执行效率。     

基于自组织映射模型的数据挖掘算法在对二甲苯吸附分离过程中的应用

以PX吸附分离过程为研究对象，运用基于SOM模型的数据挖掘算法对其进行分析研究．SOM模型在整个挖掘过程中起了关键性的作用．一方面，SOM模型作为探索性数据分析的有效工具，为进一步的挖掘提供了依据．另一方面，SOM模型为聚类算法提供参数指导和数据支持．最终，通过数据挖掘实现了两个目标，得到了在不同负荷情况下操作参数的稳态优化区域；建立了可用于指导操作员改进操作的可视化实时评估模型．     

人类心理认知习惯与云模型相结合的P2P信任模型

为了解决P2P网络信任模型的计算复杂度以及信任的不确定问题,提出了一种适合于P2P网络的信任模型。该模型借鉴人类心理认知习惯中优先采纳直接经验进行判断的思想来评估节点信任度,进而降低模型的计算复杂度,同时减少获取虚假推荐信息的风险。在此基础上,应用传统云模型中表征不确定性的两个参数——熵和超熵,引入奖励因子和惩罚因子分别对善意节点实施奖励和对恶意节点实施惩罚。仿真实验表明,该模型能很好地抵御网络中策略型恶意节点的欺骗行为,有效辨识出以小概率作恶的复杂恶意节点。     

Fast Evolutionary Learning with Batch-Type Self-Organizing Maps

Although no distance function over the input data is definable, it is still possible to implement the self-organizing map (SOM) process using evolutionary-learning operations. The process can be made to converge more rapidly when the probabilistic trials of conventional evolutionary learning are replaced by averaging using the so-called Batch Map version of the self-organizing map. Although no other condition or metric than a fitness function between the input samples and the models is assumed, an order in the map that complies with the functional similarity of the models can be seen to emerge. There exist two modes of use of this new principle: representation of nonmetric input data distributions by models that may have variable structures, and fast generation of evolutionary cycles that resemble those defined by the genetic algorithms. The spatial order in the array of models can be utilized for finding more uniform variations, such as crossings between functionally similar models.     

一种新的基于SOM的数据可视化算法

SOM（self—organizing map）所具有的拓扑保持特性使之可用来对高维数据进行低维展现,但由于数据间的距离信息在映射到低维空间中固定有序的神经元上时被丢掉了,因此数据的结构通常是被扭曲了的．为了更自然地展现数据的结构,提出了一种新的基于SOM的数据可视化算法——DPSOM（distance-preserving SOM）,它能够按照相应的距离信息对神经元的位置进行自适应调节,从而实现了对数据间距离信息的直观展现,特别地,该算法还能自动避免神经元的过度收缩问题,从而极大地提高了算法的可控性和数据可视化的质量．