Pub Date : 2016-10-20DOI: 10.1109/ICCKE.2016.7802134
Sayyed Mohammad Hosseini, A. Taherinia
In this paper a new method for detection of camera tampering is proposed. Some examples for camera tampering are: shaking the camera, movement of the camera, occlusion, and rotation of the camera. The tampering may be intentional or unintentional. In the proposed algorithm, in addition to detection of the exact nature of tampering, the exact amount of tampering also can be detected (i.e. the amount and direction of movement). This will help operator in diction making for management in surveillance system. The proposed algorithm detect the shaking using current and previous frames, as well as by constructing a total background based on all frames and building a temporary background based on last 10 frames. The proposed method employs the SURF feature detector to find interest points in both of two backgrounds and compare and match them using MSAC algorithm. The transformation matrix can be obtained to detect the camera movement, camera image zoom and camera rotate. Finally, using the method sobel edge detection the camera occlusion and defocus can be detected. The method also detect the sudden shut downs in camera or images loss. Another features of the algorithm is providing the information concerning the camera tampering.
{"title":"Anomaly and tampering detection of cameras by providing details","authors":"Sayyed Mohammad Hosseini, A. Taherinia","doi":"10.1109/ICCKE.2016.7802134","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802134","url":null,"abstract":"In this paper a new method for detection of camera tampering is proposed. Some examples for camera tampering are: shaking the camera, movement of the camera, occlusion, and rotation of the camera. The tampering may be intentional or unintentional. In the proposed algorithm, in addition to detection of the exact nature of tampering, the exact amount of tampering also can be detected (i.e. the amount and direction of movement). This will help operator in diction making for management in surveillance system. The proposed algorithm detect the shaking using current and previous frames, as well as by constructing a total background based on all frames and building a temporary background based on last 10 frames. The proposed method employs the SURF feature detector to find interest points in both of two backgrounds and compare and match them using MSAC algorithm. The transformation matrix can be obtained to detect the camera movement, camera image zoom and camera rotate. Finally, using the method sobel edge detection the camera occlusion and defocus can be detected. The method also detect the sudden shut downs in camera or images loss. Another features of the algorithm is providing the information concerning the camera tampering.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"697 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122970028","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}
Pub Date : 2016-10-20DOI: 10.1109/ICCKE.2016.7802145
Z. Ghanaei, H. Pourreza, T. Banaee
Implementing an automatic algorithm for classification of retinal vessel landmarks as bifurcation and crossovers will help the experts to analyze retinal images and detect the abnormalities of vascular topology in less time. It also can be used as the initial step of an automatic vessel classification system which is worthwhile in automatic screening programs. In this paper, we proposed a graph based method for automatic classification of vessel landmarks which consist of three steps: generating vasculature graph from centerline image, modifying the extracted graph to reduce the errors and finally classifying vessel landmarks as bifurcations and crossovers. We evaluated the proposed method by comparing the results with manually labeled images from DRIVE dataset. The average accuracy for detection of bifurcations and crossovers are 86.5% and 58.7% respectively.
{"title":"Automatic graph-based method for classification of retinal vascular bifurcations and crossovers","authors":"Z. Ghanaei, H. Pourreza, T. Banaee","doi":"10.1109/ICCKE.2016.7802145","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802145","url":null,"abstract":"Implementing an automatic algorithm for classification of retinal vessel landmarks as bifurcation and crossovers will help the experts to analyze retinal images and detect the abnormalities of vascular topology in less time. It also can be used as the initial step of an automatic vessel classification system which is worthwhile in automatic screening programs. In this paper, we proposed a graph based method for automatic classification of vessel landmarks which consist of three steps: generating vasculature graph from centerline image, modifying the extracted graph to reduce the errors and finally classifying vessel landmarks as bifurcations and crossovers. We evaluated the proposed method by comparing the results with manually labeled images from DRIVE dataset. The average accuracy for detection of bifurcations and crossovers are 86.5% and 58.7% respectively.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129954760","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}
As Voice over Internet Protocol (VoIP) or internet telephony became so popular, it has faced more security threats in comparison with traditional Public Switched Telephone Network (PSTN). Using IP-based infrastructures like public internet and signaling protocols such as Session Initiation Protocol (SIP), have been subjected this technology to various kinds of attacks. Denial of Service (DoS) attack, due to the flooding different kinds of SIP messages, is one of the most well-known type of these attacks. In this paper a new anomaly-based method for detecting and preventing different kinds of flooding attacks using SIP normal traffic modeling, is proposed. To reach this goal, SIP specifications are modeled and required parameters are extracted by the help of a FSM in order to use in fuzzy systems. Fuzzy systems results, put the proposed method in a predefined state. For prevention purposes, a filtering-based method using whitelist, is provided. Implementation results represent the fact that, the proposed method detects mentioned attacks more accurately in comparison with similar methods.
{"title":"Modeling SIP normal traffic to detect and prevent SIP-VoIP flooding attacks using fuzzy logic","authors":"Mahsa Hosseinpour, Seyed Amin Hosseeini Seno, M. Moghaddam, Hossein Khosravi Roshkhari","doi":"10.1109/ICCKE.2016.7802152","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802152","url":null,"abstract":"As Voice over Internet Protocol (VoIP) or internet telephony became so popular, it has faced more security threats in comparison with traditional Public Switched Telephone Network (PSTN). Using IP-based infrastructures like public internet and signaling protocols such as Session Initiation Protocol (SIP), have been subjected this technology to various kinds of attacks. Denial of Service (DoS) attack, due to the flooding different kinds of SIP messages, is one of the most well-known type of these attacks. In this paper a new anomaly-based method for detecting and preventing different kinds of flooding attacks using SIP normal traffic modeling, is proposed. To reach this goal, SIP specifications are modeled and required parameters are extracted by the help of a FSM in order to use in fuzzy systems. Fuzzy systems results, put the proposed method in a predefined state. For prevention purposes, a filtering-based method using whitelist, is provided. Implementation results represent the fact that, the proposed method detects mentioned attacks more accurately in comparison with similar methods.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122728956","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}
Pub Date : 2016-10-01DOI: 10.1109/ICCKE.2016.7802109
S. Salami, M. Shamsfard
The model size and decoding time are known issues in statistical machine translation. Especially, monotonic words order of language pairs makes the size of hierarchical models huge. Considering this fact, the rule extraction method of phrase-boundary model was changed to extract less number of rules. This paper proposes this rule extraction method as a general filter for hierarchical models. Named as monotonic filter, this filter reduces the extracted rules from phrase pairs decomposable to monotonic aligned subphrases. We apply the monotonic filter on the hierarchical phrase-based, SAMT and phrase-boundary models. Our experiments are performed in translations from Persian, German and French to English as the source and target languages with low, medium and high monotonic word order respectively. The reduction amount of the monotonic filter for the model size and decoding time is up to about 70% and 80% respectively, in most cases with no tangible impact on the translation quality.
{"title":"Monotonic filter for hierarchical translation models","authors":"S. Salami, M. Shamsfard","doi":"10.1109/ICCKE.2016.7802109","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802109","url":null,"abstract":"The model size and decoding time are known issues in statistical machine translation. Especially, monotonic words order of language pairs makes the size of hierarchical models huge. Considering this fact, the rule extraction method of phrase-boundary model was changed to extract less number of rules. This paper proposes this rule extraction method as a general filter for hierarchical models. Named as monotonic filter, this filter reduces the extracted rules from phrase pairs decomposable to monotonic aligned subphrases. We apply the monotonic filter on the hierarchical phrase-based, SAMT and phrase-boundary models. Our experiments are performed in translations from Persian, German and French to English as the source and target languages with low, medium and high monotonic word order respectively. The reduction amount of the monotonic filter for the model size and decoding time is up to about 70% and 80% respectively, in most cases with no tangible impact on the translation quality.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114911329","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}
Pub Date : 2016-10-01DOI: 10.1109/ICCKE.2016.7802147
H. Babaei, J. Karimpour, H. Oroji
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of common lecturers among departments and then minimize the loss of resources within departments. In this method, at first all departments perform their scheduling process locally; then two clustering and traversing agents are used where the former is to cluster common lecturers among departments and the latter is to find extra resources among departments. After performing the clustering and traversing processes, the mapping operation in done based on principles of common lecturers constraint in redundant resources in order to gain the objectives of the problem. The problem's evaluation metric is evaluated via using fuzzy c-means clustering algorithm on common lecturer constraints. An applied dataset is based on meeting the requirements of scheduling in real world among various departments of Islamic Azad University, Ahar Branch, Ahar, Iran.
{"title":"Using fuzzy c-means clustering algorithm for common lecturers timetabling among departments","authors":"H. Babaei, J. Karimpour, H. Oroji","doi":"10.1109/ICCKE.2016.7802147","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802147","url":null,"abstract":"University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of common lecturers among departments and then minimize the loss of resources within departments. In this method, at first all departments perform their scheduling process locally; then two clustering and traversing agents are used where the former is to cluster common lecturers among departments and the latter is to find extra resources among departments. After performing the clustering and traversing processes, the mapping operation in done based on principles of common lecturers constraint in redundant resources in order to gain the objectives of the problem. The problem's evaluation metric is evaluated via using fuzzy c-means clustering algorithm on common lecturer constraints. An applied dataset is based on meeting the requirements of scheduling in real world among various departments of Islamic Azad University, Ahar Branch, Ahar, Iran.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122675272","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}
Pub Date : 2016-10-01DOI: 10.1109/ICCKE.2016.7802111
S. Ahmadi, M. Gohari, Mona Tahmasebi
The high level of noise and vibrations in helicopters is not preventable and happens through flight operations. This high level of vibrations can produce uneasiness and may affect aircrew performance and their health. Correspondingly, their concentration on flight operation and decision making is strongly depended to comfort ability. Therefore, vibration attenuation can improve flight control, and aircrews feel better conditions. In this study, the helicopter structure was modeled in ANSYS software and natural frequencies have been obtained. The seat suspension and pilot body were modeled by Lumped modeling method. The active force control (AFC) scheme hybridized by Iterative learning (IL) to determine the estimated mass called AFCIL was used in helicopter seat suspension system to reduce the vibrations transmitted to the pilot body. The simulation was performed with sinusoidal and random disturbance signals and results demonstrated in both the time and frequency domains. Attained results were compared with the passive system, PID controller and AFCANN schemes. The AFCIL scheme had superior performance in pilot head displacement reduction compared to the classical PID controller. The results of the AFCIL and the AFCANN were similar together while AFCIL results were marginally superior to AFCANN.
{"title":"Intelligent active force control of a helicopter seat suspension using iterative learning algorithm","authors":"S. Ahmadi, M. Gohari, Mona Tahmasebi","doi":"10.1109/ICCKE.2016.7802111","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802111","url":null,"abstract":"The high level of noise and vibrations in helicopters is not preventable and happens through flight operations. This high level of vibrations can produce uneasiness and may affect aircrew performance and their health. Correspondingly, their concentration on flight operation and decision making is strongly depended to comfort ability. Therefore, vibration attenuation can improve flight control, and aircrews feel better conditions. In this study, the helicopter structure was modeled in ANSYS software and natural frequencies have been obtained. The seat suspension and pilot body were modeled by Lumped modeling method. The active force control (AFC) scheme hybridized by Iterative learning (IL) to determine the estimated mass called AFCIL was used in helicopter seat suspension system to reduce the vibrations transmitted to the pilot body. The simulation was performed with sinusoidal and random disturbance signals and results demonstrated in both the time and frequency domains. Attained results were compared with the passive system, PID controller and AFCANN schemes. The AFCIL scheme had superior performance in pilot head displacement reduction compared to the classical PID controller. The results of the AFCIL and the AFCANN were similar together while AFCIL results were marginally superior to AFCANN.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128771324","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}
Pub Date : 2016-10-01DOI: 10.1109/ICCKE.2016.7802138
Atefeh Mirzaei, M. Vali
One of the most common disorders in children with cleft palate is hypernasality that survives also after operation. To solve this problem, it is required to set many speech therapy sessions. Therefore, assessment of hypernasality is fundamental for speech therapists and could be done either by a nasometer equipment or an expert speech therapist. Recently speech processing methods are introduced as an efficient alternative tool. In this study, vowels (/a/) extracted from 392 utterances of disyllables (/pamap/) that were uttered by 22 normal subjects and 13 subjects with cleft palate have been used and are recorded by nasal and oral microphones. Some analyses are performed on Group Delay parameters as well as features of wavelet transform. The results show that extracted parameters from Group Delay spectrum of second (/a/) in (/pamap/) context, obtained from both nasal and oral signals, are better than that of the first (/a/), and in the best outcomes an accuracy of 94.1 % is achieved. In wavelet transform, statistical features are calculated from 5 sub-bands of Daubechies4 coefficients of two (la/) vowels and their transients. In the best results an accuracy of 97.1 % for transient (lma/) from combination of nasal and oral features is obtained.
{"title":"Detection of hypernasality from speech signal using group delay and wavelet transform","authors":"Atefeh Mirzaei, M. Vali","doi":"10.1109/ICCKE.2016.7802138","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802138","url":null,"abstract":"One of the most common disorders in children with cleft palate is hypernasality that survives also after operation. To solve this problem, it is required to set many speech therapy sessions. Therefore, assessment of hypernasality is fundamental for speech therapists and could be done either by a nasometer equipment or an expert speech therapist. Recently speech processing methods are introduced as an efficient alternative tool. In this study, vowels (/a/) extracted from 392 utterances of disyllables (/pamap/) that were uttered by 22 normal subjects and 13 subjects with cleft palate have been used and are recorded by nasal and oral microphones. Some analyses are performed on Group Delay parameters as well as features of wavelet transform. The results show that extracted parameters from Group Delay spectrum of second (/a/) in (/pamap/) context, obtained from both nasal and oral signals, are better than that of the first (/a/), and in the best outcomes an accuracy of 94.1 % is achieved. In wavelet transform, statistical features are calculated from 5 sub-bands of Daubechies4 coefficients of two (la/) vowels and their transients. In the best results an accuracy of 97.1 % for transient (lma/) from combination of nasal and oral features is obtained.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130150466","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}
Pub Date : 2016-10-01DOI: 10.1109/ICCKE.2016.7802139
Negar Mirderikvand, M. Naderan, A. Jamshidnezhad
Lung nodule segmentation is the first and the most difficult step in every Computer Aided Diagnosis (CAD). Difficulty arises due to the boring and time-consuming nature of the manual lung segmentation process. In this paper, we propose a novel automatic lung segmentation method for accurate localization of the lung nodules in computer tomography (CT) images. We present a combination of the Graph Cut and active contour (Snakes) modeling application for CT scan image segmentation. The first step in the automatic algorithm is the enhancement of contrast and removal of noise by the Median Filter. Subsequently, lungs are segmented by active contours as ROI and next, a graph-cut method initialized by a threshold, is used to obtain more robust results. Finally, an automatic segmentation strategy is presented. We evaluated the segmentation accuracy of our method on several real and simulated nodules. In fact, 27 CT images inside the image set of the Lung Image Database Consortium (LIDC), supplied by National Center Institute (NCI), are used in our evaluations. Experimental results showed high accuracy rate and low time consumption in automatically locating the lung nodules in comparison with two existing methods and radiologists' diagnosis.
{"title":"Accurate automatic localisation of lung nodules using Graph Cut and snakes algorithms","authors":"Negar Mirderikvand, M. Naderan, A. Jamshidnezhad","doi":"10.1109/ICCKE.2016.7802139","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802139","url":null,"abstract":"Lung nodule segmentation is the first and the most difficult step in every Computer Aided Diagnosis (CAD). Difficulty arises due to the boring and time-consuming nature of the manual lung segmentation process. In this paper, we propose a novel automatic lung segmentation method for accurate localization of the lung nodules in computer tomography (CT) images. We present a combination of the Graph Cut and active contour (Snakes) modeling application for CT scan image segmentation. The first step in the automatic algorithm is the enhancement of contrast and removal of noise by the Median Filter. Subsequently, lungs are segmented by active contours as ROI and next, a graph-cut method initialized by a threshold, is used to obtain more robust results. Finally, an automatic segmentation strategy is presented. We evaluated the segmentation accuracy of our method on several real and simulated nodules. In fact, 27 CT images inside the image set of the Lung Image Database Consortium (LIDC), supplied by National Center Institute (NCI), are used in our evaluations. Experimental results showed high accuracy rate and low time consumption in automatically locating the lung nodules in comparison with two existing methods and radiologists' diagnosis.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130254790","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}
Pub Date : 2016-10-01DOI: 10.1109/ICCKE.2016.7802136
A. Tajalli, Navid Sedigh, S. Hosseini-Seno
In recent years wireless ad hoc networks have seen a great deal of attention, especially in cases where no infrastructure is available. These networks aim to provide good data accessibility for participants. Because of the wireless nodes' continuous movement, network partitioning occurs very often. In order to subside the negative effects of this partitioning and improve data accessibility and reliability, data is replicated in nodes other than the original owner of data. This duplication is costly in terms of nodes' storage space and energy. Hence, selfish nodes in an autonomous environment may act non-cooperatively and do not replicate data. In game theory literature this situation is referred to as a strategic situation. In order to address this problem we propose a game theory data replication scheme by using the repeated game concept and prove that it is in the nodes' best interest to cooperate fully in the replication process if our mechanism is used. Our analysis shows that our scheme outperforms previous methods in terms of data accessibility, communication cost and query delay.
{"title":"A replication dilemma game for cooperative data replication in ad hoc networks","authors":"A. Tajalli, Navid Sedigh, S. Hosseini-Seno","doi":"10.1109/ICCKE.2016.7802136","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802136","url":null,"abstract":"In recent years wireless ad hoc networks have seen a great deal of attention, especially in cases where no infrastructure is available. These networks aim to provide good data accessibility for participants. Because of the wireless nodes' continuous movement, network partitioning occurs very often. In order to subside the negative effects of this partitioning and improve data accessibility and reliability, data is replicated in nodes other than the original owner of data. This duplication is costly in terms of nodes' storage space and energy. Hence, selfish nodes in an autonomous environment may act non-cooperatively and do not replicate data. In game theory literature this situation is referred to as a strategic situation. In order to address this problem we propose a game theory data replication scheme by using the repeated game concept and prove that it is in the nodes' best interest to cooperate fully in the replication process if our mechanism is used. Our analysis shows that our scheme outperforms previous methods in terms of data accessibility, communication cost and query delay.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117317109","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}
Pub Date : 2016-10-01DOI: 10.1109/ICCKE.2016.7802141
Ramin Rezvani-KhorashadiZadeh, Ramin Sayah-Mofazalli, M. Nejati
One of the important extensions of SVM is TWSVM which uses two hyperplanes to classify two classes of data. Since one hyperplane cannot efficiently model one class of data so the better choice is employing one hypersphere which covers as many data points in the corresponding class as possible and can better depict the characteristics of that class. Quarter sphere SVM uses a minimum radius centered hypersphere to describe data points such that it covers the majority of data and makes the outliers lied out of this hypersphere. In this paper inspired by the merit of QSSVM algorithm, we proposed a new two independent quarter sphere SVM (TI-QSSVM) to classify two classes of data. TI-QSSVM generates two quarter sphere with the minimum radiuses for two classes such that each one centered at the mean point of the corresponding class and covers as many data points in that class as possible. TI-QSSVM obtains these two quarter sphere by solving two linear programming problems. As can be seen in the experiment section, TI-QSSVM has significant advantages in terms of the learning speed and generalization performance compared with the other algorithms.
{"title":"TI-QSSVM: Two Independent Quarter Sphere Support Vector Machine for binary classification","authors":"Ramin Rezvani-KhorashadiZadeh, Ramin Sayah-Mofazalli, M. Nejati","doi":"10.1109/ICCKE.2016.7802141","DOIUrl":"https://doi.org/10.1109/ICCKE.2016.7802141","url":null,"abstract":"One of the important extensions of SVM is TWSVM which uses two hyperplanes to classify two classes of data. Since one hyperplane cannot efficiently model one class of data so the better choice is employing one hypersphere which covers as many data points in the corresponding class as possible and can better depict the characteristics of that class. Quarter sphere SVM uses a minimum radius centered hypersphere to describe data points such that it covers the majority of data and makes the outliers lied out of this hypersphere. In this paper inspired by the merit of QSSVM algorithm, we proposed a new two independent quarter sphere SVM (TI-QSSVM) to classify two classes of data. TI-QSSVM generates two quarter sphere with the minimum radiuses for two classes such that each one centered at the mean point of the corresponding class and covers as many data points in that class as possible. TI-QSSVM obtains these two quarter sphere by solving two linear programming problems. As can be seen in the experiment section, TI-QSSVM has significant advantages in terms of the learning speed and generalization performance compared with the other algorithms.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129737058","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：