A COMPARISON OF ALTERNATIVE CRITERIA FOR DEFINING FUZZY BOUNDARIES ON FUZZY CATEGORICAL MAPS

This paper provides a brief introduction to the methods for generating fuzzy categorical maps from remotely sensed images (in graphical and digital forms).This is followed by a description of the slicing process for deriving fuzzy boundaries from fuzzy categorical maps,which can be based on the maximum fuzzy membership values,confusion index,or measure of entropy.Results from an empirical test preformed in an Edinburgh suburb show that fuzzy boundaries of land cover can be derived from aerial photographs and satellite images by using the three criteria with small differences,and that slicing based on the maximum fuzzy membership values is the easiest and most straightforward solution.This,in turn,implies the suitability of maintaining both a crisp classification and its underlying certainty map for deriving fuzzy boundaries at different thresholds,which is a flexible and compact management of categorical map data and their uncertainty.

Categorical Database Generalization

This paper focuses on the issues of categorical database gen-eralization and emphasizes the roles ofsupporting data model, integrated datamodel, spatial analysis and semanticanalysis in database generalization.The framework contents of categoricaldatabase generalization transformationare defined. This paper presents an in-tegrated spatial supporting data struc-ture, a semantic supporting model andsimilarity model for the categorical da-tabase generalization. The concept oftransformation unit is proposed in generalization.

Coupled Attribute Similarity Learning on Categorical Data for Multi-Label Classification

In this paper a novel coupled attribute similarity learning method is proposed with the basis on the multi-label categorical data（CASonMLCD）.The CASonMLCD method not only computes the correlations between different attributes and multi-label sets using information gain,which can be regarded as the important degree of each attribute in the attribute learning method,but also further analyzes the intra-coupled and inter-coupled interactions between an attribute value pair for different attributes and multiple labels.The paper compared the CASonMLCD method with the OF distance and Jaccard similarity,which is based on the MLKNN algorithm according to 5common evaluation criteria.The experiment results demonstrated that the CASonMLCD method can mine the similarity relationship more accurately and comprehensively,it can obtain better performance than compared methods.

Mapping QTL for Categorical Traits with Multivariate Regression

Simple linear regression analysis has been used to map QTL for quantitative traits. Many traits of biological interest and/or economical importance in various species show binary phenotypic distributions (e.g., presence or absence). It has been shown that such a binary trait also can be analyzed with the simple linear regression, subject to virtually no loss in power compared to the generalized linear model analysis. Binary trait is a special case of a multiple categorical trait (e.g., low, medium or high). We propose a mechanism to decompose a multiple categorical trait into an array of correlated binary variables. The categorical trait turned multiple binary traits are analyzed with a multivariate linear regression method. Turning the problem of categorical trait mapping into that of multivariate mapping allows the exploration of pleiotropic effects of QTL for different categories. Efficiency of the method is verified through a series of simulation experiments.

A Graph Drawing Algorithm for Visualizing Multivariate Categorical Data

In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify patterns, trends and relationship within the data. A mathematical model for the graph layout problem is deduced and a spectral graph drawing algorithm for visualizing multivariate categorical data is proposed. The experiments show that the drawings by the algorithm well capture the structures of multivariate categorical data and the computing speed is fast.

Analysis of Extension Categorical Data Mining Process for the Extension Interior Designing

On the basis of extension architectonics,this paper researches the process of extension categorical data mining for extension interior design. In accordance with the theory of extension data mining,the extension categorical data mining for the extension interior design can be divided into data preparation,the operation of mining and knowledge application. The paper expatiates the main content and cohesive relations of each link,and emphatically discusses extension acquisition,analysis extension,categorical mining extension,knowledge application extension and other several core nodes that are related with data. Through the knowledge fusion of extension architectonics and data mining,the paper discusses the process of knowledge requirements with multiple classification under different mining targets. The purpose of this paper is to explore a whole categorical data mining process of interior design from extension design data to the design of knowledge discovery and extension application.

Clustering Categorical Data Based on Within-Cluster Relative Mean Difference

The clustering on categorical variables has received intensive attention. In dataset with categorical features, some features show the superior performance on clustering procedure. In this paper, we propose a simple method to find such distinctive features by comparing pooled within-cluster mean relative difference and then partition the data upon such features and give subspace of the subgroups. The applications on zoo data and soybean data illustrate the performance of the proposed method.

Combined Use of k-Mer Numerical Features and Position-Specific Categorical Features in Fixed-Length DNA Sequence Classification

To classify DNA sequences, k-mer frequency is widely used since it can convert variable-length sequences into fixed-length and numerical feature vectors. However, in case of fixed-length DNA sequence classification, subsequences starting at a specific position of the given sequence can also be used as categorical features. Through the performance evaluation on six datasets of fixed-length DNA sequences, our algorithm based on the above idea achieved comparable or better performance than other state-of-the art algorithms.

On the Matrices of Pairwise Frequencies of Categorical Attributes for Objects Classification

This paper proposes two new algorithms for classifying objects with categorical attributes. These algorithms are derived from the assumption that the attributes of different object classes have different probability distributions. One algorithm classifies objects based on the distribution of the attribute frequencies, and the other classifies objects based on the distribution of the pairwise attribute frequencies described using a matrix of pairwise frequencies. Both algorithms are based on the method of invariants, which offers the simplest dependencies for estimating the probabilities of objects in each class by an average frequency of their attributes. The estimated object class corresponds to the maximum probability. This method reflects the sensory process models of animals and is aimed at recognizing an object class by searching for a prototype in information accumulated in the brain. Because these matrices may be sparse, the solution cannot be determined for some objects. For these objects, an analog of the k-nearest neighbors method is provided in which for each attribute value, the class to which the majority of the k-nearest objects in the training sample belong is determined, and the most likely class value is calculated. The efficiencies of these two algorithms were confirmed on five databases.

Classification random forest with exact conditioning for spatial prediction of categorical variables

Machine learning methods are increasingly used for spatially predicting a categorical target variable when spatially exhaustive predictor variables are available within the study region.Even though these methods exhibit competitive spatial prediction performance,they do not exactly honor the categorical target variable's observed values at sampling locations by construction.On the other side,competitor geostatistical methods perfectly match the categorical target variable's observed values at sampling locations by essence.In many geoscience applications,it is often desirable to perfectly match the observed values of the categorical target variable at sampling locations,especially when the categorical target variable's measurements can be reasonably considered error-free.This paper addresses the problem of exact conditioning of machine learning methods for the spatial prediction of categorical variables.It introduces a classification random forest-based approach in which the categorical target variable is exactly conditioned to the data,thus having the exact conditioning property like competitor geostatistical methods.The proposed method extends a previous work dedicated to continuous target variables by using an implicit representation of the categorical target variable.The basic idea consists of transforming the ensemble of classification tree predictors'(categorical)resulting from the traditional classification random forest into an ensemble of signed distances(continuous)associated with each category of the categorical target variable.Then,an orthogonal representation of the ensemble of signed distances is created through the principal component analysis,thus allowing to reformulate the exact conditioning problem as a system of linear inequalities on principal component scores.Then,the sampling of new principal component scores ensuring the data's exact conditioning is performed via randomized quadratic programming.The resulting conditional signed distances are turned out into an ensemble of categorical outputs,which perfectly honor the categorical target variable's observed values at sampling locations.Then,the majority vote is used to aggregate the ensemble of categorical outputs.The effectiveness of the proposed method is illustrated on a simulated dataset for which ground-truth is available and showcased on a real-world dataset,including geochemical data.A comparison with geostatistical and traditional machine learning methods show that the proposed technique can perfectly match the categorical target variable's observed values at sampling locations while maintaining competitive out-of-sample predictive performance.

Validating Intrinsic Factors Informing E-Commerce: Categorical Data Analysis Demo

Statistics is a powerful tool for data measurement. Statistical techniques properly planned and executed give meaning to meaningless data. The difficulty some practitioners encounter hinges on the fact that though there are numerous statistical methods available for use in analysis, the extent of their understanding and ease of using these tools for analysis is limited. This study has twofold purpose: firstly, literature on categorical data commonly used in research was reviewed; next, we reported the results of a survey we designed and executed. Categorical data was collected via questionnaire and analyzed to serve as a backbone of the robustness of categorical data. Several conjectures about the independence of the socio-economic variables and e-commence were tested. Some of the factors influencing patronage of e-commerce were identified. It is clear from the literature that as one’s academic qualification improves, there is an associated improvement in their preference for e-commerce, but the results revealed otherwise. Size of family was found to influence e-commerce. Both income and social status positively affected patronage in e-commerce. Gender also appeared to affect patronage in e-commerce. 62.3% of staff had patronized e-commerce. This shows that e-commerce patronage was gradually increasing. It is therefore our considered view that policy documents regulating and monitoring the use of e-commerce be developed to increase e-commerce participation across the globe. It is also recommended that the bottlenecks which obstruct patronage in e-commence be addressed so that a lot more staff will develop a positive attitude towards e-commerce.

Clustering Categorical Data:A Cluster Ensemble Approach

Clustering categorical data, an integral part of data mining,has attracted much attention recently. In this paper, the authors formally define the categorical data clustering problem as an optimization problem from the viewpoint of cluster ensemble, and apply cluster ensemble approach for clustering categorical data. Experimental results on real datasets show that better clustering accuracy can be obtained by comparing with existing categorical data clustering algorithms.

Dimensional(premenstrual symptoms screening tool)vs categorical(mini diagnostic interview,module U)for assessment of premenstrual disorders

BACKGROUND Premenstrual syndrome(PMS)is the constellation of physical and psychological symptoms before menstruation.Premenstrual dysphoric disorder(PMDD)is a severe form of PMS with more depressive and anxiety symptoms.The Mini international neuropsychiatric interview,module U(MINI-U),assesses the diagnostic criteria for probable PMDD.The Premenstrual Symptoms screening tool(PSST)measures the severity of these symptoms.AIM To compare the PSST ordinal scores with the corresponding dichotomous MINI-U answers.METHODS Arab women(n=194)residing in Doha,Qatar,received the MINI-U and PSST.Receiver Operating Characteristics(ROC)analyses provided the cut-off scores on the PSST using MINI-U as a gold standard.RESULTS All PSST ratings were higher in participants with positive responses on MINI-U.In addition,ROC analyses showed that all areas under the curves were significant with the cutoff scores on PSST.CONCLUSION This study confirms that the severity measures from PSST can recognize patients with moderate/severe PMS and PMDD who would benefit from immediate treatment.

On Edge Irregular Reflexive Labeling of Categorical Product of Two Paths

Among the huge diversity of ideas that show up while studying graph theory,one that has obtained a lot of popularity is the concept of labelings of graphs.Graph labelings give valuable mathematical models for a wide scope of applications in high technologies(cryptography,astronomy,data security,various coding theory problems,communication networks,etc.).A labeling or a valuation of a graph is any mapping that sends a certain set of graph elements to a certain set of numbers subject to certain conditions.Graph labeling is a mapping of elements of the graph,i.e.,vertex and for edges to a set of numbers(usually positive integers),called labels.If the domain is the vertex-set or the edge-set,the labelings are called vertex labelings or edge labelings respectively.Similarly,if the domain is V(G)[E(G)],then the labeling is called total labeling.A reflexive edge irregular k-labeling of graph introduced by Tanna et al.:A total labeling of graph such that for any two different edges ab and a'b'of the graph their weights has wt_(x)(ab)=x(a)+x(ab)+x(b) and wt_(x)(a'b')=x(a')+x(a'b')+x(b') are distinct.The smallest value of k for which such labeling exist is called the reflexive edge strength of the graph and is denoted by res(G).In this paper we have found the exact value of the reflexive edge irregularity strength of the categorical product of two paths (P_(a)×P_(b))for any choice of a≥3 and b≥3.

Smart Approaches to Efficient Text Mining for Categorizing Sexual Reproductive Health Short Messages into Key Themes

To promote behavioral change among adolescents in Zambia, the National HIV/AIDS/STI/TB Council, in collaboration with UNICEF, developed the Zambia U-Report platform. This platform provides young people with improved access to information on various Sexual Reproductive Health topics through Short Messaging Service (SMS) messages. Over the years, the platform has accumulated millions of incoming and outgoing messages, which need to be categorized into key thematic areas for better tracking of sexual reproductive health knowledge gaps among young people. The current manual categorization process of these text messages is inefficient and time-consuming and this study aims to automate the process for improved analysis using text-mining techniques. Firstly, the study investigates the current text message categorization process and identifies a list of categories adopted by counselors over time which are then used to build and train a categorization model. Secondly, the study presents a proof of concept tool that automates the categorization of U-report messages into key thematic areas using the developed categorization model. Finally, it compares the performance and effectiveness of the developed proof of concept tool against the manual system. The study used a dataset comprising 206,625 text messages. The current process would take roughly 2.82 years to categorise this dataset whereas the trained SVM model would require only 6.4 minutes while achieving an accuracy of 70.4% demonstrating that the automated method is significantly faster, more scalable, and consistent when compared to the current manual categorization. These advantages make the SVM model a more efficient and effective tool for categorizing large unstructured text datasets. These results and the proof-of-concept tool developed demonstrate the potential for enhancing the efficiency and accuracy of message categorization on the Zambia U-report platform and other similar text messages-based platforms.

Text categorization based on fuzzy classification rules tree

To deal with the problem that arises when the conventional fuzzy class-association method applies repetitive scans of the classifier to classify new texts,which has low efficiency, a new approach based on the FCR-tree（fuzzy classification rules tree）for text categorization is proposed.The compactness of the FCR-tree saves significant space in storing a large set of rules when there are many repeated words in the rules.In comparison with classification rules,the fuzzy classification rules contain not only words,but also the fuzzy sets corresponding to the frequencies of words appearing in texts.Therefore,the construction of an FCR-tree and its structure are different from a CR-tree.To debase the difficulty of FCR-tree construction and rules retrieval,more k-FCR-trees are built.When classifying a new text,it is not necessary to search the paths of the sub-trees led by those words not appearing in this text,thus reducing the number of traveling rules.Experimental results show that the proposed approach obviously outperforms the conventional method in efficiency.

基于分类技术的搜索引擎排名算法——CategoryRank

提出了一种基于分类技术的搜索引擎新排名算法CategoryRank。该算法能够借助类别信息,更加准确地计算网页的排名得分,提高搜索引擎排名的准确性。算法基于任意两个网页之间的类别信息,对链接图进行了分析和计算,并且与PageRank等算法进行相比,该算法能够更加准确地模拟用户浏览网页的习惯。同时针对Web中的每个网页,算法计算出它的类别属性,直接体现了该页面针对不同用户的重要程度。最后,把该算法的离线模型和在线模型统一起来,阐明了算法在搜索引擎排名中的运行机制。

A New Approach of Feature Selection for Text Categorization

This paper proposes a new approach of feature selection based on the independent measure between features for text categorization. A fundamental hypothesis that occurrence of the terms in documents is independent of each other, widely used in the probabilistic models for text categorization （TC）, is discussed. However, the basic hypothesis is incom plete for independence of feature set. From the view of feature selection, a new independent measure between features is designed, by which a feature selection algorithm is given to ob rain a feature subset. The selected subset is high in relevance with category and strong in independence between features, satisfies the basic hypothesis at maximum degree. Compared with other traditional feature selection method in TC （which is only taken into the relevance account）, the performance of feature subset selected by our method is prior to others with experiments on the benchmark dataset of 20 Newsgroups.