Medoids-based fuzzy relational clustering generates clusters of objects based on relational data, which records pairwise similarity or dissimilarities among objects. Compared with single-medoid based approaches, multi...
详细信息
The main purpose of this paper is to investigate the connection between the Painlev′e property and the integrability of polynomial dynamical systems. We show that if a polynomial dynamical system has Painlev′e prope...
详细信息
The main purpose of this paper is to investigate the connection between the Painlev′e property and the integrability of polynomial dynamical systems. We show that if a polynomial dynamical system has Painlev′e property, then it admits certain class of first integrals. We also present some relationships between the Painlev′e property and the structure of the differential Galois group of the corresponding variational equations along some complex integral curve.
This paper presents a biologically inspired local image descriptor that combines color and shape features. Compared with previous descriptors, red-cyan cells associated with L, M, and S cones （L for long, M for mediu...
详细信息
This paper presents a biologically inspired local image descriptor that combines color and shape features. Compared with previous descriptors, red-cyan cells associated with L, M, and S cones （L for long, M for medium, and S for short） are used to indicate one of the opponent color channels. Stepping forward from state-of-the-art color feature extraction, we exploit a new approach to compute the color orientation and magnitudes of three opponent color channels, namely, red-green, blue-yellow, and red-cyan, in two-dimensional space. Color orientation is calculated in histograms with magnitude weighting. We linearly concatenate the four-color-opponent-channel histogram and scale-invariant-feamre-transform histogram in the final step. We apply our biologically inspired descriptor to describe the local image feature. Quantitative comparisons with state-of-the-art descriptors demonstrate the significant advantages of maintaining invariance to photometric and geometric changes in image matching, particularly in cases, such as illumination variation and image blurring, where more color contrast information is observed.
In this paper, we investigate the problem of evaluating the performance of classification models. First of all we propose the concept of weighted correct pair map. Then based on the weighted correct pair map, we propo...
详细信息
In this paper, we investigate the problem of evaluating the performance of classification models. First of all we propose the concept of weighted correct pair map. Then based on the weighted correct pair map, we proposed a new evaluation measure. The attractive features of the measure are that it is insensitive to imbalanced class distributions and discriminating enough. Experimental results demonstrate that the proposed measure is reliable. The work presented in this paper may stimulate new research in classification model designing, such as designing new optimization-based classification or ranking models.
With high expansibility and efficient power usage, tiered wireless sensor networks are widely deployed in many fields as an important part of Internet of Things (IoTs). It is challenging to process range query while p...
详细信息
With high expansibility and efficient power usage, tiered wireless sensor networks are widely deployed in many fields as an important part of Internet of Things (IoTs). It is challenging to process range query while protecting sensitive data from adversaries. Moreover, most existing work focuses on privacy-preserving range query neglecting collusion attacks and probability attacks, which are more threatening to network security. In this paper, we first propose a secure range query protocol called secRQ, which not only protects data privacy, but also resists collusion attacks and probability attacks in tiered wireless sensor networks. Generalized inverse matrices and distance-based range query mechanism are used to guarantee security as well as high efficiency and accuracy. Besides, we propose the mutual verification scheme to verify the integrity of query results. Finally, both theoretical analysis and experimental results confirm the security, efficiency and accuracy of secRQ.
In this paper, we propose an iris recognition algorithm based on probabilistic features. At the image preprocessing step, we do many experiments on iris segmentation in order to minimize the negative influence on reco...
详细信息
In this paper, we propose an iris recognition algorithm based on probabilistic features. At the image preprocessing step, we do many experiments on iris segmentation in order to minimize the negative influence on recognition caused by eyelash and eyelid. As different segmentation angle has different results, we have determined an ideal angle for further recognition. At the recognition step, iris is transformed into frequency domain by using Log Gabor filters. Then raw features are extracted. Probabilistic features, with two forms of distribution, random distribution and normal distribution, are set of vectors generated from these raw features. At the matching step, the raw features are replaced by the property features. KNN algorithm is used to decide the final result. Experiment results showed that the proposed method can make further improvement of recognition rates and reduce the time consumption significantly.
Density-based clustering over huge volumes of evolving data streams is critical for many modern applications ranging from network traffic monitoring to moving object management. In this work, we propose an efficient d...
详细信息
The rapid developments of chip-based technology have greatly improved human genetics and made routine the access of thousands of single nucleotide polymorphisms (SNPs) contributing to an informatics challenge. The cha...
详细信息
ISBN:
(纸本)9781450328104
The rapid developments of chip-based technology have greatly improved human genetics and made routine the access of thousands of single nucleotide polymorphisms (SNPs) contributing to an informatics challenge. The characterization and interpretation of genes and gene-gene interactions that affect the susceptibility of common, complex multifactorial diseases is a computational and statistical challenge in genome-wide association studies (GWAS). Various methods have been proposed, but they have dificulty to be directly applied to GWAS caused by excessive search space and intensive computational burden. In this paper, we propose an ant colony optimization (ACO) based algorithm by combining the pheromone updating rule with the heuristic information. We tested power performance of our algorithm by conducting suficient experiments including a wide range of simulated datasets experiments and a real genome-wide dataset experiment. Experimental results demonstrate that our algorithm is time efficient and gain good performance in the term of the power of prediction accuracy. Copyright 2014 ACM.
Extensive studies have shown that many complex diseases are influenced by interaction of certain genes, while due to the limitations and drawbacks of adopting logistic regression (LR) to detect epistasis in human Geno...
详细信息
Due to the limited computing resource on mobile devices, it is more difficult to get semantically relevant results from a large dataset in time in a mobile image retrieving system, compared with normal content based i...
详细信息
暂无评论