Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
|
|
- Theodore Ford
- 5 years ago
- Views:
Transcription
1 Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University, Khouzestan, Iran Sattar Hashei Departent of Coputer Science & Engineering, Shiraz University, Shiraz, Iran Mohaad Hossein Yektaei Departent of Coputer Abadan Branch, Islaic Azad University, Abadan, Iran Abstract: Clustering is an unsupervised categorization technique and also a highly used operation in data ining, in which, the data sets are divided into certain clusters according to siilarity or dissiilarity criterions so that the assigned objects to each cluster would be ore siilar to each other coparing to the objects of other clusters. The k-eans algorith is one of the ost well-known algoriths in clustering that is used in various odels of data ining. The k-eans categorizes a set of objects into certain nuber of clusters. One of the ost iportant probles of this algorith occurs when encountering to outliers. The outliers in the data set lead to getting away fro the real cluster centers and consequently a reduction in the clustering algorith accuracy. In this paper, we separate outliers fro noral objects using a echanis based on dissiilarity of objects. Then, the noral objects are clustered using k- eans algorith process and finally, the outliers are assigned to the closest cluster. The experiental results show the accuracy and efficiency of the proposed ethod. Keywords: clustering, k-eans, outliers, outlier detection 1. INTRODUCTION Clustering is one of the highly used ethods in data ining [12], wireless sensor networks [8,13], pattern recognition [14] and achine learning [7], which is used to detect the groups that are different enough fro each other and contain siilar objects [4,5]. The iportance of clustering in various fields and also the type of data being used, clustering speed, accuracy and lots of other paraeters, leads to introduce various ethods and algoriths in data clustering. Clustering is an unsupervised technique in which the data sets which are K-eans algorith Input: Data set D = { d 1, d 2, d n }, where d i =data points, n= nuber of data points K = nuber of cluster centers Output: Clusters : K clusters with their centers Step 1: usually vectors in ulti-diension space are divided into a Randoly select k data object fro dataset D as initial cluster certain nuber of clusters based on a siilarity or centers. dissiilarity criterions. For exaple, if the nuber of clusters Step 2: is K, and there exist n nuber of -diension data, the Repeat step 3 to step 4 till no new cluster centers are found clustering algorith will assign each one of these data to a Step 3: cluster. This assignent takes place according to this rule that Calculate the distance between each data object di (1<=i<=n) the assigned data to a certain cluster are ore siilar to each and all K cluster centers Cj (1<=j<=K) and assign data object other rather than the other clusters. The k-eans algorith is di to the nearest cluster. one of the ost well-known clustering algoriths and is being Step 4: used in various types of data ining. The k-eans categorizes For each cluster j (1<=j<=K), recalculate the cluster center. data set objects in certain nubers of clusters [10,3]. This ethod is one of the ost attractive and highly used operations in clustering techniques, because it is siple and Figure 1. The pseudo-code of k-eans algorith understandable and its tie coplexity is linear. In general, this algorith consists of two phases. In the first phase, k The distance to the cluster center is calculated in the following nubers of objects are selected fro data set in a rando ethod: anner and are considered as the initial centers of clusters. In the second phase, the distance between objects and the clusters centers is deterined and each object is placed in the (1) Dis tan( ce d,) i C j d ip C ip p 1 nearest cluster. To deterine the distance between objects, the Euclidean distance criterion is used, generally. When all of Where, d i denotes the i-th vector of data, C j is the center of j- the objects have been placed in the corresponding clusters, the th cluster and denotes the nuber of attributes and cluster clusters centers are calculated using repetitive averaging of centers. objects of each cluster. The second phase continues until satisfying the algorith ending condition. The Pseudo-code of The cluster centers are updated according to the following k-eans algorith is shown in figure 1. equation: 552
2 (2) 1 C j d n i j d i Cluster j Where n j denotes the nuber of vectors in the j-th cluster and cluster j is a subset of all vectors which for the j-th cluster. Figure 2 illustrates the clustering steps of a anual data set. This dataset is divided into two clusters using the k-eans algorith. At first, two clusters are fored by rando selection of objects (figure 2 -a), then the clusters centers are deterined by averaging of objects of each cluster (figure 2- b) and the clustering process continues using the new cluster centers (figure 2-c). For this dataset, the clustering is finished after two iterations of the algorith (figure 2-d). neighbors based that are not suitable for outlier detection in data streas due to their high tie coplexity. He et al in [6] presented new definition of outlier which they naed as cluster-based local outlier, which provides iportance to the local data behavior. They defined Cluster-Based Local Outlier Factor (CBLOF), a easure for identifying the physical significance of an outlier and an algorith for discovering outliers is also proposed by the. After that Duan et al in [9] proposed a cluster based outlier detection algorith which can detect both single point outliers and cluster-based outliers, and can assign each outlier a degree of being an outlier. Zhuo et al in [15] presented an outlier ining algorith based on dissiilarity (OMABD), which detected outliers by coparing the dissiilarity degree with dissiilarity threshold. A dissiilarity based ethod is used for iproving the efficiency of k-eans algorith in this study. Figure 2. clustering of anual data using the k-eans algorith The k-eans algorith has soe pitfalls. For instance, it stops in local optius and is sensitive to the initial values of clusters centers and outliers in dataset. In each dataset, an outlier is an object which its distance is not noral coparing to the other objects. In other words, an outlier is an object that has less siilarity than the other objects. The existence of these objects in dataset has an undesirable effect on the efficiency and accuracy of the clustering algoriths such as the k-eans. 2. RELATED WORK Outlier detection has been a very interesting topic for research counity [11,1,6,2,9]. Raasway et al proposed a distance based outlier detection ethod in [11]. According to which, given paraeters k and n, an object is an outlier if no ore than n-1 other object in the dataset have higher value for D k than object o, where D k (o) denotes the distance of k-th nearest neighbor of object o. This idea is further extended in [14], where each data point is ranked by the su of distance fro its k-th nearest neighbors. Breunig et al introduced the notion of the Local Outlier Factor (LOF) in [1] which captures the relative degree of outlierness of an object. It is local in sense that the degree of outlierness depends on how isolated an object is with respect to surrounding neighborhood. Above described ethods are either distance based or nearest 3. presented odel To iprove the efficiency of the K-eans algorith, at first the dataset should be investigated for specifying and detecting the outliers. After that, the dataset should be divided into two subsets of noral object and outliers. Then, the clustering process should be perfored separately for noral object and outliers. The noral object are clustered using the entioned steps of the k-eans algorith shown in figure 1, and finally, the outliers are assigned to the nearest cluster according to the Euclidean distance criterion and calculated cluster centers fro the previous steps. 3.1 Outlier detection in dataset In this paper, the ODBD algorith is presented for specifying and detecting the outliers which is based on the dissiilarity of objects. According to this algorith, a value is calculated for all of the dataset objects which is called the dissiilarity degree. The objects that their degree is higher than the threshold value are considered as the outlier objects. Assue that a data set DS is defined in the for of: DS= (D,A) in which D={d 1,d 2, d n } is the set of n objects and A={a 1,a 2, a } is the set of attributes with the order of. The dissiilarity degree of two objects d i, d j D on the attribute of fa is calculated as following: (3) d if d f d jf d f ad f ij d ax f d in f Where dif and d jf are the values of attribute f in the objects i and j, respectively. d f, d ax and d in are the average, the axiu and the iniu value of attribute f on all objects of the dataset, respectively. The dissiilarity degree of two objects can be obtained fro the average of these objects dissiilarity on each of attributes, as following: (4) od ( i,) j ak 1 Where ak ad ij the a k -th attribute. ak ad ij 2 is the dissiilarity value of the objects i, j on
3 According to the relations (3) and (4), the dissiilarity atrix d, which is an order N square atrix, is created to calculate the dissiilarity of each object with respect to the other objects. By adding the row eleents of this atrix, the objects synergic dissiilarity atrix is ade which shows the dissiilarity degree of each object with respect to all other objects of the data set. For the sake of siplicity and siplification of coparisons, the synergic dissiilarity degree atrix is noralized and then, the average of eleents of this atrix with an ipact factor value in the range of [0,1] is considered as the threshold siilarity value. The ODBD pseudo-code algorith is shown in figure 3. noral process of k-eans algorith is used to cluster the noral object. In this phase, because of data set being pruned by the ODBD algorith and the use of noral object, the centers and the objects are deterined in a ore accurate way. In the second phase, we use the centers obtained fro the previous phase and with iteration, we calculate the distance between each of outliers and these centers. Then, each outlier is assigned to the nearest cluster. The Euclidean distance criterion is used for the calculation of this distance. The presented algorith pseudo-code is illustrated in figure 4. ODBD-K-Means algorith ODBD algorith input: data set D = { d 1, d 2, d n }, where d i =data points, n= nuber of data points ipact factor value IFV [0,1] output: outlier and noral objects step 1: step 1-1: for each data object d i fro D for each data object d j fro D calculate od(i,j) by using equation (3) and (4) d(i,j)=od(i,j) step 1-2: for each row r i in d calculate su of eleents and assign in sd i calculate d ax = axiu value in sd step 1-3: for each data value sd i in sd dd i = (d ax - sd i ) / d ax td=ean(dd) *IFV step 2: for each data object d i fro D if dd i < td assign d i to outlier objects else assign d i to noral objects end if Figure 3. The pseudo-code of ODBD algorith 3.2 Iproving the Clustering process with the ODBD-k-eans algorith Selecting the initial values in the noral k-eans algorith is copletely rando. Thus, the existence of the outliers results in the cluster centers getting distance fro real position and consequently decreasing the accuracy of this algorith. In the presented algorith it is attepted that the outliers do not affect the process of selecting the clusters center. For this purpose, after separating the data set objects using ODBD, the clustering is done during two phases. In the first phase, the input: data set D = { d 1, d 2, d n }, where d i =data points, n= nuber of data points k = nuber of cluster centers output: k clusters with their centers step 1: find outliers and noral objects by using ODBD algorith step2: step 2-1: randoly select k data object fro noral objects as initial cluster centers. step 2-2: repeat step 2-3 to step 2-4 till no new cluster centers are found step 2-3: calculate the distance between each data object d i (1<=i<=size(noral object)) and all k cluster centers C j (1<=j<=k) and assign data object d i to the nearest cluster. step 2-4: for each cluster j (1<=j<=k), recalculate the cluster center. step 3: for each data object d i fro outliers step 3-1 calculate the distance of d i to all k final cluster centers C fro step 2 by using euclidean distance step 3-2 find the closest center c j and assign d i to the cluster with nearest center C j Figure 4. The pseudo-code of ODBD-k-eans algorith 4. Results and discussion To evaluate the algorith presented in this study, the algorith is ipleented using MATLAB 2010 prograing software and the results are copared with the k-eans algorith. The Iris, Bupa and Glass data sets fro UCI are used in the experients. The Iris data set is a categorization of iris flowers in which, there exists three different classes of iris and each class contains 50 objects. Each object has 4 attributes. In the Bupa data set, 345 objects exist each having 6 attributes. The attributes are gathered fro blood tests concerning the diagnosis of liver hapering caused by irregular drink of alcohol. Each object of this data set is the record of a ale person. In the glass data set, 214 objects exist and each object has 9 attributes and this set has 6 classes. The properties of these data sets are listed in table
4 Table 1. The datasets and their properties dataset #objects #features #clusters Iris Bupa Glass Selecting the ipact factor and consequently the siilarity threshold value is very iportant to detect and deterine the nuber of outliers. This factor value ight be different for each data set. According to the ODBD algorith, if the ipact factor assued to be zero, the nuber of outliers would be zero. This eans that the ODBD-k-eans algorith changes to the noral k-eans algorith. For calculating the algorith accuracy, we can use accuracy indicator which is obtained using to the following relation: According to this table, it is obvious that the algorith accuracy is dependent to the nuber of outliers. If we select zero as the value of the ipact factor, the presented algorith would be equivalent to the noral k-eans algorith. The real outliers of the Iris data set are the points that are separated with an ipact factor of 0.4. By running the ODBD algorith and selecting the ost suitable ipact factor for data set, the nuber of outliers in each data set is obtained. The results are shown in table 3. Table 3. The nuber of outliers in data sets dataset Ipact factor #outlier objects Iris Bupa (5) Accuracy True Positive TruePositive False Postive Glass Because the nuber of noral object affects the selection of cluster centers and also the proposed algorith like the k- eans algorith calculates the initial centers by rando selection of objects, the results of each execution of this algorith ay not the sae. For different values of ipact factor in the range [0,1], the presented algorith is executed for 100 ties and according to the relevant nuber of outliers, the average value of results is considered as the algorith accuracy. These results are presented in table 2, for Iris data set. Results of algorith accuracy on the data sets are shown in table 4. Table 4. The results of algoriths on datasets Dataset Iris Bupa K-eans ODBD-K-eans Table 2. Results of ODBD-k-eans algorith on the iris Glass Ipact factor #outlier Accuracy Figure 5 depicts the algorith accuracy results on a diagra. According to this diagra, effect of the presented algorith on the standard data sets can be observed Figure 5. The results of algoriths on standard datasets The k-eans algorith has a good accuracy on the Iris data set, because of a suitable distribution and structure of objects in data set. The existence of the outliers in the Bupa and Glass 555
5 data sets, has an undesirable effect on the selection of centers and objects and it consequently leads to reduction in the accuracy of the k-eans algorith. After teporarily reoving this objects and using the presented algorith, the retrieval accuracy on these three data sets have been iproved. 5. Conclusion In this paper, a new algorith is presented based on the k- eans algorith and dissiilarity of the objects. In the presented odel, the data sets were analyzed to specify the outliers. By detecting these objects, the data set pruned and the outliers and noral objects were separated fro each other. Then, the noral objects were grouped using the k- eans algorith. Finally, using of the final cluster centers of previous stage and by calculating the distances between the outliers and the final cluster centers, these objects were assigned to the nearest cluster center, separately. The experiental results on the standard data sets showed that the presented algorith probes the data sets with a better accuracy for finding better results. Despite the good results of the presented algorith, different results were observed at different executions of the algorith and that is due to the rando selection of the initial points. In the future studies, it is possible to present better solutions for this challenge. 6. REFERENCES [1] Breuing, M., Kriegel, H., Ng, R., and Sander J LOF: identifying density-based local outlier factor. In Proceedings of ACM SIGMOD International Conference on anageent of Data., 29(2), pp [2] Fabrizio, A., Stefano B., and Clara P Distancebased detection and prediction of outliers. IEEE Transaction on Knowledge. And data Engineering., 18(2), pp [3] Frogy, E Cluster analysis of ultivariate data: efficiency vs interpretability of classification. Bioetrics., 21(3), pp [4] Guha, S., Rastogi, R., and Shi, K An efficient clustring algorith for large database. In Proceedings of the ACM SIGMOD Conference., 27(2), pp [5] Guha, S., Rastogi R., and Shi K A Robust clustring algorith for categorical attributes. In Proceedings of the third IEEE International Conference on Data Mining., 25(5), pp [6] He, Z., Xu X., and Deng, S Discovering clusterbased local outlier. Pattern Recognization Letters., 24(9), pp [7] Kao, Y., and Lee S.Y Cobining k-eans and particle swar optiization for dyneic data clustring probles. IEEE, International Conference on Intelligent Coputing and Intelligent Systes., Shanghai, pp [8] Kuar, M., and Vera, S Data clustring in sensor network using art. 4th International Conference on Wireless Counication and Sensor Network, Allahabad, pp [9] Lian D., Lida, X., Ying, L., and Jun, L Clusterbased otlier detection. Annals of Operation Research, 68(11), pp [10] Pelleg, D., and Moore, A X-eans: extending k- eans with efficient estiation of the nuber of clusters. In Proceedings of ICML the Seventeenth International Conference on Machine Learning., San Francisco, pp [11] Roaswany, S., Rastogi R., and Shi K Efficient algorith for ining outliers fro large data set. In Proceedings of the ACM SIGMOD International Conference on Manageent of Data., Texas, ACM press, pp [12] Tsai, C. F., Tsai, C. W., Wu, H. C. and Yang, T A new data clustering approach for data ining in large databases. The 6th IEEE International Syposiu on Parallel Architectures, Algoriths, and Networks., pp [13] Wang, T., and Yang, Z. A location-aware-based data clustring algorith in wireless sensor networks IEEE, 11th International Conference on Counication Systes., pp [14] Wong, A. K. C., and Li, G. C. L siultaneous pattern and data clustring for pattern cluster analysis. IEEE Transaction on Knowledge and Data Engineering., 20(8), pp [15] Zhou, M., and Chen, X an outlier ining algorith based on dissiilarity. International Conference on Environental Science and Engineering., pp
Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationCLUSTERING OF AE SIGNAL AMPLITUDES BY MEANS OF FUZZY C-MEANS ALGORITHM
The 12 th International Conference of the Slovenian Society for Non-Destructive Testing»Application of Conteporary Non-Destructive Testing in Engineering«Septeber 4-6, 213, Portorož, Slovenia More info
More informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization
More informationIdentifying Converging Pairs of Nodes on a Budget
Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering
More informationAn Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation
Algoriths 2015, 8, 234-247; doi:10.3390/a8020234 Article OPEN ACCESS algoriths ISSN 1999-4893 www.dpi.co/journal/algoriths An Optiization Clustering Algorith Based on Texture Feature Fusion for Color Iage
More informationBrian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi
A Hierarchical Application of ICA-based Feature Etraction to Iage Classification Introduction Iage classification poses one of the greatest challenges in the achine vision and achine learning counities.
More informationNews Events Clustering Method Based on Staging Incremental Single-Pass Technique
News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2
More informationStructural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.
Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable
More informationResearch on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm
roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua,
More informationThe Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network
The Flaw Attack to the RTS/CTS Handshake Mechanis in Cluster-based Battlefield Self-organizing Network Zeao Zhao College of Counication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China National
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationLeveraging Relevance Cues for Improved Spoken Document Retrieval
Leveraging Relevance Cues for Iproved Spoken Docuent Retrieval Pei-Ning Chen 1, Kuan-Yu Chen 2 and Berlin Chen 1 National Taiwan Noral University, Taiwan 1 Institute of Inforation Science, Acadeia Sinica,
More informationA Novel 2D Texture Classifier For Gray Level Images
2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationSummary. Reconstruction of data from non-uniformly spaced samples
Is there always extra bandwidth in non-unifor spatial sapling? Ralf Ferber* and Massiiliano Vassallo, WesternGeco London Technology Center; Jon-Fredrik Hopperstad and Ali Özbek, Schluberger Cabridge Research
More informationMinimax Sensor Location to Monitor a Piecewise Linear Curve
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner
More informationMassive amounts of high-dimensional data are pervasive in multiple domains,
Challenges of Feature Selection for Big Data Analytics Jundong Li and Huan Liu, Arizona State University Massive aounts of high-diensional data are pervasive in ultiple doains, ranging fro social edia,
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More informationA Study of the Relationship Between Support Vector Machine and Gabriel Graph
A Study of the Relationship Between Support Vector Machine and Gabriel Graph Wan Zhang and Irwin King {wzhang, king}@cse.cuhk.edu.hk Departent of Coputer Science & Engineering The Chinese University of
More informationTheoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem
Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The
More informationPerformance Analysis of RAID in Different Workload
Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,
More informationGrid Density Based Clustering Algorithm
Grid Density Based Clustering Algorith Aandeep Kaur Mann, Navneet Kaur Abstract Clustering is the one of the ost iportant task of the data ining. Clustering is the unsupervised ethod to find the relations
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More informationDefining and Surveying Wireless Link Virtualization and Wireless Network Virtualization
1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,
More informationRedundancy Level Impact of the Mean Time to Failure on Wireless Sensor Network
(IJACSA) International Journal of Advanced Coputer Science and Applications Vol. 8, No. 1, 217 Redundancy Level Ipact of the Mean Tie to Failure on Wireless Sensor Network Alaa E. S. Ahed 1 College of
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationVerdict Accuracy of Quick Reduct Algorithm using Clustering, Classification Techniques for Gene Expression Data
Verdict Accuracy of Quick Reduct Algorith using Clustering, Classification Techniques for Gene Expression Data T.Chandrasekhar 1, K.Thangavel 2 and E.N.Sathishkuar 3 1 Departent of Coputer Science, eriyar
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationSecure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals
Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract
More informationA Periodic Dynamic Load Balancing Method
2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation
More informationDerivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router
Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of
More information3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric
More informationAdaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN
Proceedings of the nd International onference on oputer Science and Electronics Engineering (ISEE 3) Adaptive Paraeter Estiation Based ongestion Avoidance Strategy for DTN Qicai Yang, Futong Qin, Jianquan
More informationReconstruction of Time Series using Optimal Ordering of ICA Components
Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu
More informationA Model Free Automatic Tuning Method for a Restricted Structured Controller. by using Simultaneous Perturbation Stochastic Approximation
28 Aerican Control Conference Westin Seattle Hotel, Seattle, Washington, USA June -3, 28 WeC9.5 A Model Free Autoatic Tuning Method for a Restricted Structured Controller by Using Siultaneous Perturbation
More informationA Discrete Spring Model to Generate Fair Curves and Surfaces
A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa
More informationEvaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds
Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles
More information1 Extended Boolean Model
1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationA Spectral Framework for Detecting Inconsistency across Multi-Source Object Relationships
A Spectral Fraework for Detecting Inconsistency across Multi-Source Object Relationships Jing Gao, Wei Fan, Deepak Turaga, Srinivasan Parthasarathy, and Jiawei Han University of Illinois at Urbana-Chapaign,
More informationA wireless sensor network for visual detection and classification of intrusions
A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang
More informationNON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH
NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.
More informationPOSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang
IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering
More informationMGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor
International Journal of Coputer Theory and Engineering, Vol 5, No, February 0 MGS-SIFT: A New Illuination Invariant Feature Based on SIFT Descriptor Reza Javanard Alitappeh and Fariborz Mahoudi Abstract
More informationEfficient Learning of Generalized Linear and Single Index Models with Isotonic Regression
Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression Sha M. Kakade Microsoft Research and Wharton, U Penn skakade@icrosoft.co Varun Kanade SEAS, Harvard University
More informationCOMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT
COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT B.BOOBA 1 Dr. T.V.GOPAL 2 1 Research Scholar, Assist. Professor(Sl.Gr),Departent of Coputer Applications, Easwari
More informationAn Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints
519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka
More informationHeterogeneous Radial Basis Function Networks
Proceedings of the International Conference on Neural Networks (ICNN ), vol. 2, pp. 23-2, June. Heterogeneous Radial Basis Function Networks D. Randall Wilson, Tony R. Martinez e-ail: randy@axon.cs.byu.edu,
More informationAN INTEGRATED APPROACH TO MUSIC BOUNDARY DETECTION
10th International Society for Music Inforation Retrieval Conference (ISMIR 2009) AN INTEGRATED APPROACH TO MUSIC BOUNDARY DETECTION Min-Yian Su, Yi-Hsuan Yang, Yu-Ching Lin, Hoer Chen National Taiwan
More informationMULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou
MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou Departent of Coputer Science and Inforation Engineering, National Chiayi
More informationThe Internal Conflict of a Belief Function
The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of
More informationClosing The Performance Gap between Causal Consistency and Eventual Consistency
Closing The Perforance Gap between Causal Consistency and Eventual Consistency Jiaqing Du Călin Iorgulescu Aitabha Roy Willy Zwaenepoel EPFL ABSTRACT It is well known that causal consistency is ore expensive
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More information2013 IEEE Conference on Computer Vision and Pattern Recognition. Compressed Hashing
203 IEEE Conference on Coputer Vision and Pattern Recognition Copressed Hashing Yue Lin Rong Jin Deng Cai Shuicheng Yan Xuelong Li State Key Lab of CAD&CG, College of Coputer Science, Zhejiang University,
More informationCS 361 Meeting 8 9/24/18
CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages
More informationAN APPROACH ON BIMODAL BIOMETRIC SYSTEMS
AN APPROACH ON BIODAL BIOETRIC SYSTES Eugen LUPU, Siina EERICH Technical University of Cluj-Napoca, 26-28 Baritiu str. Cluj-Napoca phone: +40-264-40-266; fax: +40-264-592-055; e-ail: Eugen.Lupu @co.utcluj.ro
More informationScheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We
More informationMinimax Sensor Location in the Plane
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location in the Plane To M. Cavalier The Pennsylvania State University University Par, PA 680 Enrique del Castillo The Pennsylvania
More informationNovel Image Representation and Description Technique using Density Histogram of Feature Points
Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos
More informationA Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem
IE Vol. 7, No. 2, pp. 84-92, Septeber 2008. A Coparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Proble Ji Ung Sun School of Industrial and Managent Engineering Hankuk University
More informationImprove Peer Cooperation using Social Networks
Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding
More informationDistributed Multicast Tree Construction in Wireless Sensor Networks
Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,
More informationFeature Selection to Relate Words and Images
The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University
More informationClassification and Segmentation of Glaucomatous Image Using Probabilistic Neural Network (PNN), K-Means and Fuzzy C- Means(FCM)
IJSRD - International Journal for Scientific Research & Developent Vol., Issue 7, 03 ISSN (online): 3-063 Classification and Segentation of Glaucoatous Iage Using Probabilistic Neural Network (PNN), K-Means
More informationGenetic-Based EM Algorithm for Learning Gaussian Mixture Models
1344 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 27, NO. 8, AUGUST 2005 Genetic-Based EM Algorith for Learning Gaussian Mixture Models Franz Pernkopf, Meber, IEEE, and Djael Bouchaffra,
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationDYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION
www.arpnjournals.co DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION N. Snehalatha 1 and Paul Rodrigues 2 1 School of Coputing, SRM University, Chennai, Tail Nadu, India 2 Departent
More informationDepth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method
Aerican Journal of Applied Sciences 1 (3): 209-214, 2004 ISSN 1546-9239 Science Publications, 2004 Depth Estiation of 2-D Magnetic Anoalous Sources by Using Euler Deconvolution Method 1,3 M.G. El Dawi,
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More informationAN IMPROVED DENSITY BASED k-means ALGORITHM
AN IMPROVED DENSITY BASED k-means ALGORITHM Kabiru Dalhatu 1 and Alex Tze Hiang Sim 2 1 Department of Computer Science, Faculty of Computing and Mathematical Science, Kano University of Science and Technology
More informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More informationProblem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm
Proble Solving of graph correspondence using Genetics Algorith and ACO Algorith Alireza Rezaee, 1, Azizeh Ajalli 2 Assistant professor,departent of Mechatronics Engineering, Faculty of New Sciences and
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationGenerating Mechanisms for Evolving Software Mirror Graph
Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror
More informationBoosted Detection of Objects and Attributes
L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly
More informationResearch on the Classification and Selection of Archive Texts with the Improved C4.5 Algorithm
INTERNATIONAL JOURNAL OF IRUITS, SYSTEMS AND SIGNAL PROESSING Volue 2, 208 Research on the lassification and Selection of Archive Texts with the Iproved 4.5 Algorith Xianbin Lv Abstract In the age of inforation
More informationPredicting x86 Program Runtime for Intel Processor
Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given
More informationA Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction
MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao
More informationAscending order sort Descending order sort
Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract
More informationRelief shape inheritance and graphical editor for the landscape design
Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru
More informationPrivacy-preserving String-Matching With PRAM Algorithms
Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,
More informationAbstract. 2. Segmentation Techniques. Keywords. 1. Introduction. 3. Threshold based Image Segmentation
International Journal of Advanced Coputer Research (ISSN (print): 49-777 ISSN (online): 77-7970) Volue-3 Nuber- Issue-8 March-03 MRI Brain Iage Segentation based on hresholding G. Evelin Sujji, Y.V.S.
More informationKnowledge Discovery Applied to Agriculture Economy Planning
Knowledge Discovery Applied to Agriculture Econoy Planning Bing-ru Yang and Shao-un Huang Inforation Engineering School University of Science and Technology, Beiing, China, 100083 Eail: bingru.yang@b.col.co.cn
More informationI-0 Introduction. I-1 Introduction. Objectives: Quote:
I-0 Introduction Objectives: Explain necessity of parallel/ultithreaded algoriths Describe different fors of parallel processing Present coonly used architectures Introduce a few basic ters Coents: Try
More informationDesign Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems
Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se
More informationEnhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue
Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade
More informationMAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer
MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer Departent of Coputer Science and Engineering University of South Florida Tapa, FL 33620 Abstract -- The
More informationData Caching for Enhancing Anonymity
Data Caching for Enhancing Anonyity Rajiv Bagai and Bin Tang Departent of Electrical Engineering and Coputer Science Wichita State University Wichita, Kansas 67260 0083, USA Eail: {rajiv.bagai, bin.tang}@wichita.edu
More information