{"title":"Predicting tumor location from prone to supine breast MRI using a simulation of breast deformation","authors":"Hong Song, Xiangbin Zhu, Xiangfei Cui","doi":"10.1109/GrC.2013.6740419","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740419","url":null,"abstract":"Breast cancer is one of the biggest killers to women, and early diagnosis is essential for improved prognosis. The shape of the breast varies hugely between the scenarios of magnetic resonance (MR) imaging (patient lies prone, breast hanging down under gravity) and ultrasound (patient lies supine). Matching between such pairs of images is considered essential by radiologists for more reliable diagnosis of early breast cancer. In this paper, a method to predict tumor location by simulating the breast deformation from breast in the prone position to the compressed breast in the supine position was developed, which is based on a 3-D patient-specific breast model constructed from MR images with the use of the finite-element method and nonlinear elasticity. The performance was assessed by the mean distance between corresponding lesion locations for three cases. A mean accuracy of 4.94mm in Euclidean distance was achieved by using the proposed method. Experiments using actual images show that the method gives good predictions which can be used to find exact correspondences between tumors location in prone and supine breast images.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116987335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Protein function prediction based on physiochemical properties and protein granularity","authors":"Wanlu Wang, Xin Zhang, Jun Meng, Yushi Luan","doi":"10.1109/GrC.2013.6740433","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740433","url":null,"abstract":"Assigning biological function to uncharacterized proteins is a fundamental problem in the post-genomic age. The increasing availability of large amounts of data on protein sequences has led to the emergence of developing effective computational methods for quickly and accurately predicting their functions. In this work, we extract 353 numerical features from sequences based not only on physiochemical properties but also on protein granularity. A tool in exploratory data analysis, Principal Component Analysis (PCA), is applied to obtain an optimized feature set by excluding poor-performed or redundant features, resulting in 204 remaining features. Then the optimized 204-feature subset is used to predict protein function with k-nearest neighbors algorithm (KNN). This prediction model achieves an overall accurate prediction rate of 84.6%. The experiment results show that our approach is quite efficient to predict functional class of unknown proteins.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122346378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-agent comprehensive evaluation on inland port production efficiency based on arrtibute theory","authors":"Xueyan Duan, Siqin Yu, Guanglin Xu","doi":"10.1109/GrC.2013.6740386","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740386","url":null,"abstract":"Multi-agent Attribute Coordinate Comprehensive Evaluation Method(MACCEM) simulates Multi-agent psychological curve by structuring multi-agent barycentric coordinate points so as to realize the multi-agent evaluation function. Based on MACCEM index system of inland port production efficiency evaluation is established. Then 22 China inland port production efficiency are evaluated and sorted through computer simulation. The results show that MACCEM is feasible and effective in multi-agent comprehensive evaluation.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121145709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Definability of approximations in reflexive relations","authors":"Yu-Ru Syau, Lixing Jia, E. Lin","doi":"10.1109/GrC.2013.6740421","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740421","url":null,"abstract":"Considering a reflexive relation R on a fixed nonempty set U, four different constructions of lower and upper approximations are described by using the so-called R-successor or/and R-predecessor sets of each object of the set U. The first two of the four constructions of lower and upper approximations are well known, and one pair is presented in this paper for the first time. The lower and upper approximations in each pair are mutually dual, and all the four upper approximations discussed in this paper are extensive and monotonic. If the reflexive relation R is further assumed to be symmetric, the four constructions of lower and upper approximations are induced to the commonly used lower and upper approximations. The primary goal of this paper is to study definability of approximations in reflexive relations via a special kind of neighborhood systems, called total pure reflexive neighborhood systems. It is shown that such neighborhood systems give a unified framework for definability of the four constructions.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115828967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Knowledge mining in big data — A lesson from algebraic geometry","authors":"Jun Xie, Zehua Chen, Gang Xie, T. Lin","doi":"10.1109/GrC.2013.6740437","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740437","url":null,"abstract":"A granular computing (GrC) approach of a mathematical framework for “knowledge mining in Big Data” is illustrated by using some idea from algebraic geometry: (1) For example, the ring of the integers, denoted by Z, is a model U of `Big Data' (the discourse of universe of `Big Data'). (2) The selection of the set of prime ideals is an example of granulating (MAPping) the “Big Data” U into granular structure. (3) To compute the hidden geometric structure of Spec(Z) (e.g., Zariski topology) is to compute (to REDUCE) the quotient structure and and to interpret into knowledge structure. The transformation of algebraic structure of Z to geometric structure of Spec(Z) is the GrC framework of “knowledge mining in Big Data”.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Specific-to-general approach for rule induction using discernibility based dissimilarity","authors":"Y. Kusunoki, T. Tanino","doi":"10.1109/GrC.2013.6740403","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740403","url":null,"abstract":"In this study, we propose a new decision rule induction approach. Conventional rule induction methods are often based on sequential covering with the general-to-specific approach in which to generate a premise of a rule, the premise is initialized to be empty and conditions are added to it until no or few negative objects are covered by the premise. While, in this study, we propose a rule induction method using the specific-to-general approach by applying discernibility based clustering to positive objects. In our approach, positive objects are clustered using a similarity measure which is related to discernibility of clusters. From an obtained cluster, we can generate a premise of a decision rule by taking common condition values of objects in the cluster.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130820308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GN: A privacy preserving data publishing method based on generalization and noise techniques","authors":"Yeling Ma, Jiyi Wang, Jianmin Han, Lixia Wang","doi":"10.1109/GrC.2013.6740411","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740411","url":null,"abstract":"Generalization is a popular technique to realize k-anonymity. However, when the distribution of original data is uneven, generalization will distort the data greatly, which makes the anonymous data low utility. To address the problem, we propose a GN method, which limits the degree of generalization by adding noise tuples during anonymization. We also propose a GN-Bottom-up algorithm to achieve k-anonymity based on GN method. Experiments show that the GN method can generate anonymous data with less distortion and higher classification accuracy than generalization method.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134455721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-features prostate tumor aided diagnoses based on ensemble-svm","authors":"T. Zhou, Huiling Lu","doi":"10.1109/GrC.2013.6740425","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740425","url":null,"abstract":"In order to realize prostate cancer aided diagnosis, an ensemble SVM which based on kernel functions and feature selection is proposed. Firstly statistical, texture and invariant moment features of the prostate ROI in the MRI images are extracted. Secondly SVM parameters are disturbed by different kernel functions in different features space, and the first integration is carried out by relative majority voting. Thirdly the first results of ensemble are integrated by relative majority voting again; Finally, MRI images of prostate patients are regarded as original data, and the new ensemble SVM is utilized to aided diagnosis. Experimental results show that the proposed algorithm can effectively improve the recognition accuracy of prostate cancer.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133838463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Algorithms of crisp, fuzzy, and probabilistic clustering with semi-supervision or pairwise constraints","authors":"S. Miyamoto, Nobuhiro Obara","doi":"10.1109/GrC.2013.6740412","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740412","url":null,"abstract":"An overview of several algorithms of semi-supervised clustering or constrained clustering based on crisp, fuzzy, or probabilistic framework is given with new results. First, equivalence between an EM algorithm for a semi-supervised mixture distribution model and an extended version of KL-information fuzzy c-means is shown. Second, algorithms of constrained clustering are compared, where an extended COP K-means is considered. Third class of algorithms is a two-stage version of a combination of COP K-means and agglomerative clustering. Numerical examples are shown to observe characteristics of the algorithms discussed herein.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133003759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaodong Yue, D. Miao, Yue Wu, Caiming Zhong, Yufei Chen
{"title":"Scale selection in roughness based color quantization","authors":"Xiaodong Yue, D. Miao, Yue Wu, Caiming Zhong, Yufei Chen","doi":"10.1109/GrC.2013.6740446","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740446","url":null,"abstract":"Color quantization is an important operation with many applications in image compression and image analysis. Through color quantization, millions of colors in original images are compressed to a limited palette while guaranteeing the display quality. Synthesizing color spatial distribution into the traditional histogram, rough set theory is utilized to design the roughness measure for color quantization. Although the superiority of the roughness-based color quantization has been proved, the basic roughness measure tends to over focus on the homogeneity of noisy points and is still not precise enough to represent the homogeneous color regions. To weaken the interference of noise, we improve the existing roughness measure through filtering the local color differences with the linear scale-space kernel. The filtering process actually forms a group of multi-scale approximations of color components and leads to the multilevel roughness. Therefore it is required to decide the reasonable scales for roughness-based quantization. A strategy of scale selection based on the information measurement is also proposed in this paper, which uses the change of the generalized entropies in linear scale-spaces to interpret the varying region homogeneity and detect the optimal scales for color quantization. Abundant experimental results demonstrate the validity of the scale selection strategy. Under the selected scales, the color quantization induced from the roughness measure has good performances on most testing images.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131323217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}