A Heuristic Approach to Possibilistic Clustering for Fuzzy Data

The paper deals with the problem of the fuzzy data clustering. In other words, objects attributes can be represented by fuzzy numbers or fuzzy intervals. A direct algorithm of possibilistic clustering is the basis of an approach to the fuzzy data clustering. The paper provides the basic ideas of the method of clustering and a plan of the direct possibilistic clustering algorithm. Definitions of fuzzy intervals and fuzzy numbers are presented and distances for fuzzy numbers are considered. A concept of a vector of fuzzy numbers is introduced and the fuzzy data preprocessing methodology for constructing of a fuzzy tolerance matrix is described. A numerical example is given and results of application of the direct possibilistic clustering algorithm to a set of vectors of triangular fuzzy numbers are considered in the example. Some preliminary conclusions are stated

Semantic industrial categorisation based on search engine index

Analysis of specialist language is one of the most pressing problems when trying to build intelligent content analysis system. Identifying the scope of the language used and then understanding the relationships between the language entities is a key problem. A semantic relationship analysis of the search engine index was devised and evaluated. Using search engine index provides us with access to the widest database of knowledge in any particular field (if not now, then surely in the future). Social network analysis of keywords collection seems to generate a viable list of the specialist terms and relationships among them. This approach has been tested in the engineering and medical sectors

A conceptual approach to gene expression analysis enhanced by visual analytics

The analysis of gene expression data is a complex task for biologists wishing to understand the role of genes in the formation of diseases such as cancer. Biologists need greater support when trying to discover, and comprehend, new relationships within their data. In this paper, we describe an approach to the analysis of gene expression data where overlapping groupings are generated by Formal Concept Analysis and interactively analyzed in a tool called CUBIST. The CUBIST workflow involves querying a semantic database and converting the result into a formal context, which can be simplified to make it manageable, before it is visualized as a concept lattice and associated charts

Apex Peptide Elution Chain Selection: A New Strategy for Selecting Precursors in 2D-LC-MALDI-TOF/TOF Experiments on Complex Biological Samples

LC-MALDI provides an often overlooked opportunity to exploit the separation between LC-MS and MS/MS stages of a 2D-LC-MS-based proteomics experiment, that is, by making a smarter selection for precursor fragmentation. Apex Peptide Elution Chain Selection (APECS) is a simple and powerful method for intensity-based peptide selection in a complex sample separated by 2D-LC, using a MALDI-TOF/TOF instrument. It removes the peptide redundancy present in the adjacent first-dimension (typically strong cation exchange, SCX) fractions by constructing peptide elution profiles that link the precursor ions of the same peptide across SCX fractions. Subsequently, the precursor ion most likely to fragment successfully in a given profile is selected for fragmentation analysis, selecting on precursor intensity and absence of adjacent ions that may cofragment. To make the method independent of experiment-specific tolerance criteria, we introduce the concept of the branching factor, which measures the likelihood of false clustering of precursor ions based on past experiments. By validation with a complex proteome sample of Arabidopsis thaliana, APECS identified an equivalent number of peptides as a conventional data-dependent acquisition method but with a 35% smaller work load. Consequently, reduced sample depletion allowed further selection of lower signal-to-noise ratio precursor ions, leading to a larger number of identified unique peptides.

Rough Sets Clustering and Markov model for Web Access Prediction

Discovering user access patterns from web access log is increasing the importance of information to build up adaptive web server according to the individual user’s behavior. The variety of user behaviors on accessing information also grows, which has a great impact on the network utilization. In this paper, we present a rough set clustering to cluster web transactions from web access logs and using Markov model for next access prediction. Using this approach, users can effectively mine web log records to discover and predict access patterns. We perform experiments using real web trace logs collected from www.dusit.ac.th servers. In order to improve its prediction ration, the model includes a rough sets scheme in which search similarity measure to compute the similarity between two sequences using upper approximation