Abstract: Biclustering is the way of two-dimensional data
analysis. For several years it became possible to express such issue
in terms of Boolean reasoning, for processing continuous, discrete
and binary data. The mathematical backgrounds of such approach —
proved ability of induction of exact and inclusion–maximal biclusters
fulfilling assumed criteria — are strong advantages of the method.
Unfortunately, the core of the method has quite high computational
complexity. In the paper the basics of Boolean reasoning approach
for biclustering are presented. In such context the problems of
computation parallelization are risen.
Abstract: In this work, we begin with the presentation of the
Tθ family of usual similarity measures concerning multidimensional
binary data. Subsequently, some properties of these measures are
proposed. Finally the impact of the use of different inter-elements
measures on the results of the Agglomerative Hierarchical Clustering
Methods is studied.
Abstract: This paper presents a designed algorithm involves improvement of transferring data over Simple Object Access Protocol (SOAP). The aim of this work is to establish whether using SOAP in exchanging XML messages has any added advantages or not. The results showed that XML messages without SOAP take longer time and consume more memory, especially with binary data.
Abstract: Feature selection plays an important role in applications with high dimensional data. The assessment of the stability of feature selection/ranking algorithms becomes an important issue when the dataset is small and the aim is to gain insight into the underlying process by analyzing the most relevant features. In this work, we propose a graphical approach that enables to analyze the similarity between feature ranking techniques as well as their individual stability. Moreover, it works with whatever stability metric (Canberra distance, Spearman's rank correlation coefficient, Kuncheva's stability index,...). We illustrate this visualization technique evaluating the stability of several feature selection techniques on a spectral binary dataset. Experimental results with a neural-based classifier show that stability and ranking quality may not be linked together and both issues have to be studied jointly in order to offer answers to the domain experts.
Abstract: In social network analysis the mean nodal degree and
density of the graph can be considered as a measure of the activity of
all actors in the network and this is an important property of a graph
and for making comparisons among networks. Since subjects in a
family or organization are subject to common environment factors, it
is prime interest to study the association between responses.
Therefore, we study the distribution of the mean nodal degree and
density of the graph under correlated binary units. The cross product
ratio is used to capture the intra-units association among subjects.
Computer program and an application are given to show the benefits
of the method.