GHSOM在遥感图像分割中的应用

提出一种基于自组织增长分级神经网络（Growing Hierarchical Self-Organizing Map ,GHSOM）的遥感图像分类方法。首先详细分析了GHSOM方法的基本原理和算法,然后成功将其应用于遥感图像分类。实验结果表明了GHSOM通过分级的分类方法有效解决了SOM分类中的混分问题,大大提高了分类精度和效率,是一种新的有效的无监督遥感图像分类方法。     

Comparison of visualization of optimal clustering using self-organizing map and growing hierarchical self-organizing map in cellular manufacturing system

The present research deals with the cell formation problem (CFP) of cellular manufacturing system which is a NP-hard problem thus, the development of optimum machine-part cell formation algorithms has always been the primary attraction in the design of cellular manufacturing system. In this proposed work, the self-organizing map (SOM) approach has been used which is able to project data from a high-dimensional space to a low-dimensional space so it is considered a visualized approach for explaining a complicated CFP data set. However, for a large data set with a high dimensionality, a traditional flat SOM seems difficult to further explain the concepts inside the clusters. We propose one such possible solution for a large CFP data set by using the SOM in a hierarchical manner known as growing hierarchical self-organizing map (GHSOM). In the present work, the two novel contributions using GHSOM are: the choice of optimum architecture through the minimum pattern units extracted at layer 1 for the respective threshold values and selection. Furthermore, the experimental results clearly indicated that the machine-part visual clustering using GHSOM can be successfully applied in identifying a cohesive set of part family that is processed by a machine group. Computational experience specifically with the proposed GHSOM algorithm, on a set of 15 CFP problems from the literature, has shown that it performs remarkably well. The GHSOM algorithm obtained solutions that are at least as good as the ones found the literature. For 75% of the cell formation problems, the GHSOM algorithm improved the goodness of cell formation through GTE performance measure using SOM as well as best one from the literature, in some cases by as much as more than 12.81% (GTE). Thus, comparing the results of the experiment in this paper with the SOM and GHSOM using the paired t-test it has been revealed that the GHSOM approach performed better than the SOM approach so far the group technology efficiency (GTE) measures of performance of the goodness of cell formation is concerned.     

Self-Organizing-Map Based Clustering Using a Local Clustering Validity Index

Classical clustering methods, such as partitioning and hierarchical clustering algorithms, often fail to deliver satisfactory results, given clusters of arbitrary shapes. Motivated by a clustering validity index based on inter-cluster and intra-cluster density, we propose that the clustering validity index be used not only globally to find optimal partitions of input data, but also locally to determine which two neighboring clusters are to be merged in a hierarchical clustering of Self-Organizing Map (SOM). A new two-level SOM-based clustering algorithm using the clustering validity index is also proposed. Experimental results on synthetic and real data sets demonstrate that the proposed clustering algorithm is able to cluster data in a better way than classical clustering algorithms on an SOM.     

Mixing numerical and categorical data in a Self-Organizing Map by means of frequency neurons

Even though Self-Organizing Maps (SOMs) constitute a powerful and essential tool for pattern recognition and data mining, the common SOM algorithm is not apt for processing categorical data, which is present in many real datasets. It is for this reason that the categorical values are commonly converted into a binary code, a solution that unfortunately distorts the network training and the posterior analysis. The present work proposes a SOM architecture that directly processes the categorical values, without the need of any previous transformation. This architecture is also capable of properly mixing numerical and categorical data, in such a manner that all the features adopt the same weight. The proposed implementation is scalable and the corresponding learning algorithm is described in detail. Finally, we demonstrate the effectiveness of the presented algorithm by applying it to several well-known datasets.     

基于改进的GHSOM网络预测客户欺诈行为

生长、分级的自组织映射(Growing Hierarchical Self-Organizing Map,GHSOM)网络是自组织映射(Self-Organizing Map,SOM)网络的一种变体,它不仅具备了SOM网络可解释性强的优点,同时采用多层分级的结构,不需要预先定义好网络的结构和尺寸,解决了SOM由于竞争层神经元过多造成的训练时间过长的问题,却忽略了对样本向量各个分量在模型中重要性的分析,因此将一种新的输入模式分量和映射单元权向量之间的灰关联度引入到网络权值的调整过程中,对GHSOM算法进行了改进。运用于对电信客户行为的分类,从中获取了预测欺诈客户的关键指标,大大降低了输入样本的维度。结果显示,采用改进后的GHSOM算法降维后,分类正确率仍然可以达到94.59%。     

基于GHSOM网络的时间序列聚类方法

提出了一种基于增长型分层自组织映射(GHSOM)的时间序列聚类方法，给出了该方法的基本原理和具体算法步骤，对实测时间序列数据进行了聚类验证和分析。研究结果表明，增长型分层自组织映射能根据对象特征无监督地对时间序列进行正确聚类，由于具有动态增长及分层特性，能分析对象内在的层次结构并实现由粗到精的聚类，可以扩展应用于大型乃至巨量时间序列数据库的模式发现。     

Studying the feasibility of a recommender in a citizen web portal based on user modeling and clustering algorithms

This paper presents a methodology to estimate the future success of a collaborative recommender in a citizen web portal. This methodology consists of four stages, three of them are developed in this study. First of all, a user model, which takes into account some usual characteristics of web data, is developed to produce artificial data sets. These data sets are used to carry out a clustering algorithm comparison in the second stage of our approach. This comparison provides information about the suitability of each algorithm in different scenarios. The benchmarked clustering algorithms are the ones that are most commonly used in the literature: c-Means, Fuzzy c-Means, a set of hierarchical algorithms, Gaussian mixtures trained by the expectation-maximization algorithm, and Kohonen's self-organizing maps (SOM). The most accurate clustering is yielded by SOM. Afterwards, we turn to real data. The users of a citizen web portal (Infoville XXI, http://www.infoville.es) are clustered. The clustering achieved enables us to study the future success of a collaborative recommender by means of a prediction strategy. New users are recommended according to the cluster in which they have been classified. The suitability of the recommendation is evaluated by checking whether or not the recommended objects correspond to those actually selected by the user. The results show the relevance of the information provided by clustering algorithms in this web portal, and therefore, the relevance of developing a collaborative recommender for this web site.     

The growing hierarchical self-organizing map: exploratory analysis of high-dimensional data

The self-organizing map (SOM) is a very popular unsupervised neural-network model for the analysis of high-dimensional input data as in data mining applications. However, at least two limitations have to be noted, which are related to the static architecture of this model as well as to the limited capabilities for the representation of hierarchical relations of the data. With our novel growing hierarchical SOM (GHSOM) we address both limitations. The GHSOM is an artificial neural-network model with hierarchical architecture composed of independent growing SOMs. The motivation was to provide a model that adapts its architecture during its unsupervised training process according to the particular requirements of the input data. Furthermore, by providing a global orientation of the independently growing maps in the individual layers of the hierarchy, navigation across branches is facilitated. The benefits of this novel neural network are a problem-dependent architecture and the intuitive representation of hierarchical relations in the data. This is especially appealing in explorative data mining applications, allowing the inherent structure of the data to unfold in a highly intuitive fashion.     

Hierarchical Color Quantization Based on Self-organization

In this paper, a new hierarchical color quantization method based on self-organizing maps that provides different levels of quantization is presented. Color quantization (CQ) is a typical image processing task, which consists of selecting a small number of code vectors from a set of available colors to represent a high color resolution image with minimum perceptual distortion. Several techniques have been proposed for CQ based on splitting algorithms or cluster analysis. Artificial neural networks and, more concretely, self-organizing models have been usually utilized for this purpose. The self-organizing map (SOM) is one of the most useful algorithms for color image quantization. However, it has some difficulties related to its fixed network architecture and the lack of representation of hierarchical relationships among data. The growing hierarchical SOM (GHSOM) tries to face these problems derived from the SOM model. The architecture of the GHSOM is established during the unsupervised learning process according to the input data. Furthermore, the proposed color quantizer allows the evaluation of different color quantization rates under different codebook sizes, according to the number of levels of the generated neural hierarchy. The experimental results show the good performance of this approach compared to other quantizers based on self-organization.     

基于遗传算法和自组织特征映射网络的文本聚类方法

自组织映射(SOM)算法作为一种聚类和高维可视化的无监督学习算法,为进行中文Web文档聚类提供了有力的手段。但是SOM算法天然存在着对网络初始权值敏感的缺陷,从而影响聚类质量。为此,引进遗传算法对SOM网络加以优化。提出了以遗传算法优化SOM网络的文本聚类算法（GSTCA）;进行了对比实验,实验表明,改进后的算法GSTCA比SOM算法在Web中文文档聚类中具有更高的准确率,其F-measure值平均提高了14%,同时,实验还表明,GSTCA算法对网络初始权值是不敏感的,从而提高了算法的稳定性。     

Two-level Clustering of Web Sites Using Self-Organizing Maps

Web sites contain an ever increasing amount of information within their pages. As the amount of information increases so does the complexity of the structure of the web site. Consequently it has become difficult for visitors to find the information relevant to their needs. To overcome this problem various clustering methods have been proposed to cluster data in an effort to help visitors find the relevant information. These clustering methods have typically focused either on the content or the context of the web pages. In this paper we are proposing a method based on Kohonen’s self-organizing map (SOM) that utilizes both content and context mining clustering techniques to help visitors identify relevant information quicker. The input of the content mining is the set of web pages of the web site whereas the source of the context mining is the access-logs of the web site. SOM can be used to identify clusters of web sessions with similar context and also clusters of web pages with similar content. It can also provide means of visualizing the outcome of this processing. In this paper we show how this two-level clustering can help visitors identify the relevant information faster. This procedure has been tested to the access-logs and web pages of the Department of Informatics and Telecommunications of the University of Athens.     

基于多层自组织映射和主成分分析的入侵检测方法*

首先改进了自组织映射学习和分类算法,通过引入自定义变量匹配度、约简率和约简样本量化误差,提出了一种新的基于多层自组织映射和主成分分析入侵检测模型与算法。模型运用主成分分析算法对输入样本进行特征约简,运用分层思想对分类精度低的聚类进行逐层细分,解决了单层自组织映射分类不精确的问题。实验结果表明该模型用于入侵检测的效果良好,能准确区分攻击与否且能进一步指出攻击的具体类型。     

基于SOM网络的语音训练可视化方法研究

提出了一种利用SOM网络输出层可视化的特点进行语音训练的方法。SOM网络能够将输入向量映射到二维平面或曲面上,受试者通过视觉反馈的位置信息,指导其发音行为。为了提高SOM聚类效果,SOM还进行加强训练;讨论了SOM输出层神经元个数对聚类的影响。实验结果表明,提出的利用SOM语音训练方法,直观简单,能够有效地实现“看图说话”。     

基于小波对比度和神经网络的图像隐写方法

为使通信安全在传输过程中提供较大的秘密信息嵌入量,并保持较好的载密图像质量,提出一种基于自组织特征映射神经网络和小波对比度的图像隐写方法。将载体图像分成固定大小的小块,采用小波一级分解并计算其小波对比度,利用自组织特征映射神经网络将小块分为3类,采用模算子技术嵌入秘密信息。实验结果表明,该方法有较大的嵌入量并保持良好的载密图像质量。     

基于小波对比度和神经网络的图像隐写方法

为使通信安全在传输过程中提供较大的秘密信息嵌入量,并保持较好的载密图像质量,提出一种基于自组织特征映射神经网络和小波对比度的图像隐写方法。将载体图像分成固定大小的小块,采用小波一级分解并计算其小波对比度,利用自组织特征映射神经网络将小块分为3类,采用模算子技术嵌入秘密信息。实验结果表明,该方法有较大的嵌入量并保持良好的载密图像质量。     

Ranked centroid projection: a data visualization approach with self-organizing maps

The self-organizing map (SOM) is an efficient tool for visualizing high-dimensional data. In this paper, the clustering and visualization capabilities of the SOM, especially in the analysis of textual data, i.e., document collections, are reviewed and further developed. A novel clustering and visualization approach based on the SOM is proposed for the task of text mining. The proposed approach first transforms the document space into a multidimensional vector space by means of document encoding. Afterwards, a growing hierarchical SOM (GHSOM) is trained and used as a baseline structure to automatically produce maps with various levels of detail. Following the GHSOM training, the new projection method, namely the ranked centroid projection (RCP), is applied to project the input vectors to a hierarchy of 2-D output maps. The RCP is used as a data analysis tool as well as a direct interface to the data. In a set of simulations, the proposed approach is applied to an illustrative data set and two real-world scientific document collections to demonstrate its applicability.     

改进的GHSOM 算法在文本聚类中的应用

信息时代,文本信息极其巨大。本文运用一种改进GHSOM 算法进行文本聚类,该算法具有显著的文本聚类 能力,能够将文本的相似性用多种手段表现。实验结果表明改进GHSOM 算法整体上是优于SOM 算法,它的先进性主要体现 在更短的计算时间,并提供更丰富的有序性表达能力。     

基于SOM网络的三次B样条曲线重建

使用散乱点集重建曲线曲面,在逆向工程和计算机视觉中有着广泛的应用。提出基于SOM网络的三次B样条曲线重建算法。给定某一曲线散乱点集和一初始神经网络,优化SOM网络中神经元位置,使网络逼近散乱点和映射散乱点空间特征。用特征点反求三次B样条曲线控制点,利用控制点重建三次B样条曲线。试验结果表明,算法取得的曲线重建效果良好。     

Topological pattern discovery and feature extraction for fraudulent financial reporting

Fraudulent financial reporting (FFR) involves conscious efforts to mislead others regarding the financial condition of a business. It usually consists of deliberate actions to deceive regulators, investors or the general public that also hinder systematic approaches from effective detection. The challenge comes from distinguishing dichotomous samples that have their major attributes falling in the same distribution. This study pioneers a novel dual GHSOM (Growing Hierarchical Self-Organizing Map) approach to discover the topological patterns of FFR, achieving effective FFR detection and feature extraction. Specifically, the proposed approach uses fraudulent samples and non-fraudulent samples to train a pair of dual GHSOMs under the same training parameters and examines the hypotheses for counterpart relationships among their subgroups taking advantage of unsupervised learning nature and growing hierarchical structures from GHSOMs. This study further presents (1) an effective classification rule to detect FFR based on the topological patterns and (2) an expert-competitive feature extraction mechanism to capture the salient characteristics of fraud behaviors. The experimental results against 762 annual financial statements from 144 public-traded companies in Taiwan (out of which 72 are fraudulent and 72 are non-fraudulent) reveal that the topological pattern of FFR follows the non-fraud-central spatial relationship, as well as shows the promise of using the topological patterns for FFR detection and feature extraction.     

Toward a hybrid data mining model for customer retention

The prevention of subscriber churn through customer retention is a core issue of Customer Relationship Management (CRM). By minimizing customer churn a company maximizes its profit. This paper proposes a hybridized architecture to deal with customer retention problems. It does so not only through predicting churn probability but also by proposing retention policies. The architecture works in two modes: learning and usage.

In the learning mode, the churn model learner seeks potential associations from the subscriber database. This historical information is used to form a churn model. This mode also calls for a policy model constructor to use the attributes identified in the churn model to divide all ‘churners’ into distinct groups. The policy model constructor is also responsible for developing a policy model for each churner group. In the usage mode, a churn predictor uses the churn model to predict the churn probability of a given subscriber. When the churn model finds that the subscriber has a high churn probability the policy model is used to suggest specific retention policies.

This study’s experiments show that the churn model has an evaluation accuracy of approximately eighty-five percent. This suggests that policy model construction represents an interesting and important technique in investigating the characteristics of churner groups. Furthermore, this study indicates that understanding the relationships between churns is essential in creating effective retention policy models for dealing with ‘churners’.