Pub Date : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496492
P. Kadam, Mangesh Nawale, Akash Kandhare, M. Patil
The field steganography is very much popular technique for sending secrete message and lots of research are going in it. To overcome the limitation of previous work we proposed separable and reversible encrypted data hiding in encrypted image using AES Algorithm and Lossy technique as solution. In this sender encrypt data and image separately using AES algorithm, hides encrypted data in encrypted image using LSB technique, system auto generate the all 3 respective keys. Sender sends the file through existing mail system. Receiver can perform operation as per respective keys like if he has only data hiding and image decryption key then he can only get the image in original form or if he have data hiding and data decryption key then he can get original data, system also provides protection for auto generated keys and system auto generate mail if user fail to perform any operation.
{"title":"Separable reversible encrypted data hiding in encrypted image using AES Algorithm and Lossy technique","authors":"P. Kadam, Mangesh Nawale, Akash Kandhare, M. Patil","doi":"10.1109/ICPRIME.2013.6496492","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496492","url":null,"abstract":"The field steganography is very much popular technique for sending secrete message and lots of research are going in it. To overcome the limitation of previous work we proposed separable and reversible encrypted data hiding in encrypted image using AES Algorithm and Lossy technique as solution. In this sender encrypt data and image separately using AES algorithm, hides encrypted data in encrypted image using LSB technique, system auto generate the all 3 respective keys. Sender sends the file through existing mail system. Receiver can perform operation as per respective keys like if he has only data hiding and image decryption key then he can only get the image in original form or if he have data hiding and data decryption key then he can get original data, system also provides protection for auto generated keys and system auto generate mail if user fail to perform any operation.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126556323","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496470
R. Anitha, P. Kamalakkannan
Mobile Wireless Sensor Networks (MWSNs) are a current encouraged technology which is used to help many civilian, military and industrial services. Energy saving is the critical issue while designing the wireless sensor networks. In order to enhance the network life time there are many routing protocols have been developed. One of these is clustering based in which network is partitioned into small clusters and each cluster is examined and controlled by a single node called Cluster Head (CH). In this paper, we propose an enhanced algorithm for Low Energy Adaptive Clustering Hierarchy-Mobile (LEACH-M) protocol called ECBR-MWSN which is Enhanced cluster based routing protocol for mobile nodes in wireless sensor network. ECBR-MWSN protocol selects the CHs using the parameters of highest residual energy, lowest Mobility and least Distance from the Base Station. The BS periodically runs the proposed algorithm to select new CHs after a certain period of time. It is aimed to prolonging the lifetime of the sensor networks by balancing the energy consumption of the nodes. Then compare the performance of our proposed algorithm with the cluster based protocols using ns2 simulator. The simulation result indicates that the proposed algorithm gives better performance in terms of higher packet delivery ratio, throughput, energy consumption, routing overhead, and delay.
{"title":"Enhanced cluster based routing protocol for mobile nodes in wireless sensor network","authors":"R. Anitha, P. Kamalakkannan","doi":"10.1109/ICPRIME.2013.6496470","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496470","url":null,"abstract":"Mobile Wireless Sensor Networks (MWSNs) are a current encouraged technology which is used to help many civilian, military and industrial services. Energy saving is the critical issue while designing the wireless sensor networks. In order to enhance the network life time there are many routing protocols have been developed. One of these is clustering based in which network is partitioned into small clusters and each cluster is examined and controlled by a single node called Cluster Head (CH). In this paper, we propose an enhanced algorithm for Low Energy Adaptive Clustering Hierarchy-Mobile (LEACH-M) protocol called ECBR-MWSN which is Enhanced cluster based routing protocol for mobile nodes in wireless sensor network. ECBR-MWSN protocol selects the CHs using the parameters of highest residual energy, lowest Mobility and least Distance from the Base Station. The BS periodically runs the proposed algorithm to select new CHs after a certain period of time. It is aimed to prolonging the lifetime of the sensor networks by balancing the energy consumption of the nodes. Then compare the performance of our proposed algorithm with the cluster based protocols using ns2 simulator. The simulation result indicates that the proposed algorithm gives better performance in terms of higher packet delivery ratio, throughput, energy consumption, routing overhead, and delay.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121967935","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496500
A. N. Kumar, P. S. Vanthana, V. Vishnupriya, S. Vigneswari
Multi-camera applications are numerous and each application has its specific means of acquisition representation and display. The quality of the perceived multi view video image is dependent on the means of presentation. The most of the fundamental problem in MIQM (Multi-camera Image Quality Measure) is finding the image quality measure. A multi-camera image quality measure MIQM is distortions in multi-camera system can be classified into geometric and photometric distortions. Geometric distortion in multi-camera system is defined as structural disparity such as discontinuity and misalignment in the observed image due to geometric error. Geometric error can occur during mapping which may include rotation and translation. Photometric distortion in single camera is defined as the degradation in perceptual feature that are known to attract visual attention such as noise blur and blocking artifacts. We propose multi-camera image quality measure is combination of the three index measure is necessary to capture the impact of three distortions on multi view perception. The measure was designed to capture the visual effects of artifacts introduced at the acquisition and pre compositing process to predict the composed image quality.
{"title":"Reducing image distortions and measuring the excellence in multi-camera images","authors":"A. N. Kumar, P. S. Vanthana, V. Vishnupriya, S. Vigneswari","doi":"10.1109/ICPRIME.2013.6496500","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496500","url":null,"abstract":"Multi-camera applications are numerous and each application has its specific means of acquisition representation and display. The quality of the perceived multi view video image is dependent on the means of presentation. The most of the fundamental problem in MIQM (Multi-camera Image Quality Measure) is finding the image quality measure. A multi-camera image quality measure MIQM is distortions in multi-camera system can be classified into geometric and photometric distortions. Geometric distortion in multi-camera system is defined as structural disparity such as discontinuity and misalignment in the observed image due to geometric error. Geometric error can occur during mapping which may include rotation and translation. Photometric distortion in single camera is defined as the degradation in perceptual feature that are known to attract visual attention such as noise blur and blocking artifacts. We propose multi-camera image quality measure is combination of the three index measure is necessary to capture the impact of three distortions on multi view perception. The measure was designed to capture the visual effects of artifacts introduced at the acquisition and pre compositing process to predict the composed image quality.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121542395","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496502
D. A. Kumar, R. Rengasamy
Information science plays a vital role in each and every field of science and technology, but it is facing several difficulties to handle the data and information, a main problem is data uncertainty, several theories are dealing with uncertainty, soft set theory also do vital role to handle this uncertainty problem. This paper analysed soft set reduction and how a sample dataset is converted into binary valued information system, and also analysed how binary valued information can be used to reduce dimension of data to take better decisions.
{"title":"Parameterization reduction using soft set theory for better decision making","authors":"D. A. Kumar, R. Rengasamy","doi":"10.1109/ICPRIME.2013.6496502","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496502","url":null,"abstract":"Information science plays a vital role in each and every field of science and technology, but it is facing several difficulties to handle the data and information, a main problem is data uncertainty, several theories are dealing with uncertainty, soft set theory also do vital role to handle this uncertainty problem. This paper analysed soft set reduction and how a sample dataset is converted into binary valued information system, and also analysed how binary valued information can be used to reduce dimension of data to take better decisions.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133793358","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496498
K. Karthikeyan, V. Karthikeyani
Anaphora is one of the mostly attractive phenomenons in computational linguistics for resolving anaphora with preceding and succeeding referent. The ability to perform Anaphora Resolution is important in NLP application. Traditional research focus on resolving particular type of anaphora only, no one integrates methods or procedure to resolve all type of anaphora. In this paper, we identify all type of anaphora with layered or step by step approach so that everyone utilize anaphora paradigm in their application. We proposed a new enhanced framework in which all required rules of resolution are perform, the new system extract most accuracy antecedents of anaphora.
{"title":"Understanding text using Anaphora Resolution","authors":"K. Karthikeyan, V. Karthikeyani","doi":"10.1109/ICPRIME.2013.6496498","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496498","url":null,"abstract":"Anaphora is one of the mostly attractive phenomenons in computational linguistics for resolving anaphora with preceding and succeeding referent. The ability to perform Anaphora Resolution is important in NLP application. Traditional research focus on resolving particular type of anaphora only, no one integrates methods or procedure to resolve all type of anaphora. In this paper, we identify all type of anaphora with layered or step by step approach so that everyone utilize anaphora paradigm in their application. We proposed a new enhanced framework in which all required rules of resolution are perform, the new system extract most accuracy antecedents of anaphora.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130959190","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496477
R. Arulmurugan, N. Suthanthira Vanitha
A maximum power point tracking (MPPT) algorithm using fuzzy controller was considered. MPPT method was implemented based on the voltage and current reference of PV value was obtained from of PV modules. Therefore, measuring both the PV module voltage and current is adequate for MPPT operation. Fuzzy controller is used to directly control the design of dc-dc new buck converter. The simulation results have been used to verify the effectiveness of the algorithm. The proposed method is produce good efficiency with low switching loss. The nonlinearity and adaptiveness of fuzzy controller provided good performance under parameter variations such as solar irradiation. Tracking of the maximum power point (MPPT) plays an important role in photovoltaic(PV) power systems because they maximize the power output from a PV system for a given set of conditions, and therefore maximize they module efficiency. This work presents a fuzzy logic controller based MPPT algorithms using design of dc to dc new buck converter for photovoltaic applications. The introduction of fuzzy controller as a solution has given very good performance and whatever the parametric variation of the system.
{"title":"Intelligent fuzzy MPPT controller using analysis of DC to DC novel buck converter for photovoltaic energy system applications","authors":"R. Arulmurugan, N. Suthanthira Vanitha","doi":"10.1109/ICPRIME.2013.6496477","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496477","url":null,"abstract":"A maximum power point tracking (MPPT) algorithm using fuzzy controller was considered. MPPT method was implemented based on the voltage and current reference of PV value was obtained from of PV modules. Therefore, measuring both the PV module voltage and current is adequate for MPPT operation. Fuzzy controller is used to directly control the design of dc-dc new buck converter. The simulation results have been used to verify the effectiveness of the algorithm. The proposed method is produce good efficiency with low switching loss. The nonlinearity and adaptiveness of fuzzy controller provided good performance under parameter variations such as solar irradiation. Tracking of the maximum power point (MPPT) plays an important role in photovoltaic(PV) power systems because they maximize the power output from a PV system for a given set of conditions, and therefore maximize they module efficiency. This work presents a fuzzy logic controller based MPPT algorithms using design of dc to dc new buck converter for photovoltaic applications. The introduction of fuzzy controller as a solution has given very good performance and whatever the parametric variation of the system.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132213271","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496440
D. Karthikeyan, M. Dharmalingam
Mobile ad hoc network (MANET) is a group of mobile nodes which communicates with each other without any supporting infrastructure. Routing in MANETs. is extremely challenging because of MANETs. dynamic features, its limited bandwidth and power energy. MANET nodes operating on battery try to pursue the energy efficiency heuristically by reducing the energy they consumed. Literature shows though they maintain acceptable performance of certain tasks, for multi-hop routing this is not optimal strategy. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. Swarm intelligence is a computational intelligence technique that involves collective behavior of autonomous agents that locally interact with each other in a distributed environment to solve a given problem in the hope of finding a global solution to the problem. We propose an energy efficient routing algorithm for MANETs based on ACO for minimizing energy consumption of the nodes and prolong the life of the overall communication system. The performance of the proposed algorithm is simulated on the network tool NS2 and is also compared with existing algorithm's performance.
{"title":"Ant based intelligent routing protocol for MANET","authors":"D. Karthikeyan, M. Dharmalingam","doi":"10.1109/ICPRIME.2013.6496440","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496440","url":null,"abstract":"Mobile ad hoc network (MANET) is a group of mobile nodes which communicates with each other without any supporting infrastructure. Routing in MANETs. is extremely challenging because of MANETs. dynamic features, its limited bandwidth and power energy. MANET nodes operating on battery try to pursue the energy efficiency heuristically by reducing the energy they consumed. Literature shows though they maintain acceptable performance of certain tasks, for multi-hop routing this is not optimal strategy. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. Swarm intelligence is a computational intelligence technique that involves collective behavior of autonomous agents that locally interact with each other in a distributed environment to solve a given problem in the hope of finding a global solution to the problem. We propose an energy efficient routing algorithm for MANETs based on ACO for minimizing energy consumption of the nodes and prolong the life of the overall communication system. The performance of the proposed algorithm is simulated on the network tool NS2 and is also compared with existing algorithm's performance.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116215353","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496444
K. Madhu, R. Minu
Multi-class image semantic segmentation (MCISS) is one of the most crucial steps toward many applications such as image editing and content-based image retrieval. It's a very efficient method that include top down and bottom up approaches. In the top down approach model based segmentation is done. Semantic segmentation of image is one which groups the pixels together having common semantic meaning. This is done by applying semantic rules on the image pixels. Semantic texton forest (STF) is used for implementing this approach. In the bottom up approach using JSEG a region based segmentation is performed. To segment an input image, it heuristically groups the pixels in the input image according to their spatial adjacency, boundary continuity etc, and thus have no knowledge about the correspondence between pixels or regions to semantic categories, but will get more accurate boundaries than top down approach. But for some class of images JSEG showing reduced quality segmentation. To solve this FRACTAL JSEG method uses local fractal dimension of pixels as a homogeneity measure. This method showing improved result comparing to JSEG in boundary detection and hence segmentation. Another approach called I-FRAC also showing better results for some class of images where variation of colours is too low. Hence in this work an approach that uses both algorithms based on a selection criteria is proposed. This work is based on the assumption that by improving the bottom up approach using fractal dimension concept segmentation accuracy of MCISS can be improved. Here in the bottom up approach an improved version of JSEG is implemented to focus on how to find out a class specific value for region merging parameter that will increase the accuracy of segmentation.
{"title":"Image segmentation using improved JSEG","authors":"K. Madhu, R. Minu","doi":"10.1109/ICPRIME.2013.6496444","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496444","url":null,"abstract":"Multi-class image semantic segmentation (MCISS) is one of the most crucial steps toward many applications such as image editing and content-based image retrieval. It's a very efficient method that include top down and bottom up approaches. In the top down approach model based segmentation is done. Semantic segmentation of image is one which groups the pixels together having common semantic meaning. This is done by applying semantic rules on the image pixels. Semantic texton forest (STF) is used for implementing this approach. In the bottom up approach using JSEG a region based segmentation is performed. To segment an input image, it heuristically groups the pixels in the input image according to their spatial adjacency, boundary continuity etc, and thus have no knowledge about the correspondence between pixels or regions to semantic categories, but will get more accurate boundaries than top down approach. But for some class of images JSEG showing reduced quality segmentation. To solve this FRACTAL JSEG method uses local fractal dimension of pixels as a homogeneity measure. This method showing improved result comparing to JSEG in boundary detection and hence segmentation. Another approach called I-FRAC also showing better results for some class of images where variation of colours is too low. Hence in this work an approach that uses both algorithms based on a selection criteria is proposed. This work is based on the assumption that by improving the bottom up approach using fractal dimension concept segmentation accuracy of MCISS can be improved. Here in the bottom up approach an improved version of JSEG is implemented to focus on how to find out a class specific value for region merging parameter that will increase the accuracy of segmentation.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116218337","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496463
N. Karthikeyan, B. Bharathi, S. Karthik
Mobile Ad hoc Network (MANET) is a collection of wireless mobile devices such as laptops, handheld digital devices, personal digital assistants and wearable computers forming a temporary network without the aid of any infrastructure or centralized administration. In MANET, the task of routing is distributed among network nodes which act as both end points and routers in a wireless multi-hop network environment. To discover a route to a specific destination node, existing on-demand routing protocols employ a broadcast scheme referred to as simple flooding. Broadcasting is a means of diffusing a control message such as route request (RREQ) for route discovery in MANET environment. In on-demand routing protocols such as DSR and AODV, route request (RREQ) packets are propagated throughout the MANET to determine a route from source to destination. This paper presents the analysis of the impact of broadcast mechanism in proactive routing protocol (DSDV) and reactive routing protocols (DSR and AODV) on network performance with respect to broadcast overhead, network load, MAC load, and throughput.
{"title":"Performance analysis of the impact of broadcast mechanisms in AODV, DSR and DSDV","authors":"N. Karthikeyan, B. Bharathi, S. Karthik","doi":"10.1109/ICPRIME.2013.6496463","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496463","url":null,"abstract":"Mobile Ad hoc Network (MANET) is a collection of wireless mobile devices such as laptops, handheld digital devices, personal digital assistants and wearable computers forming a temporary network without the aid of any infrastructure or centralized administration. In MANET, the task of routing is distributed among network nodes which act as both end points and routers in a wireless multi-hop network environment. To discover a route to a specific destination node, existing on-demand routing protocols employ a broadcast scheme referred to as simple flooding. Broadcasting is a means of diffusing a control message such as route request (RREQ) for route discovery in MANET environment. In on-demand routing protocols such as DSR and AODV, route request (RREQ) packets are propagated throughout the MANET to determine a route from source to destination. This paper presents the analysis of the impact of broadcast mechanism in proactive routing protocol (DSDV) and reactive routing protocols (DSR and AODV) on network performance with respect to broadcast overhead, network load, MAC load, and throughput.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131856092","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496722
V. Diviya Prabha, R. Rathipriya
In this paper, an efficient and new algorithm for biclustering of web usage data is presented, which is based on gravitational search algorithm. In the proposed algorithm, called BIC-GSA, the gravitational search algorithm is used to find a near optimal solution for biclustering problem. The benchmark clickstream dataset from UCI repository is used to evaluate and to study the performance of the presented algorithm. The results show that the proposed algorithm can find high quality biclusters in the tested dataset.
{"title":"Biclustering of web usage data using gravitational search algorithm","authors":"V. Diviya Prabha, R. Rathipriya","doi":"10.1109/ICPRIME.2013.6496722","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496722","url":null,"abstract":"In this paper, an efficient and new algorithm for biclustering of web usage data is presented, which is based on gravitational search algorithm. In the proposed algorithm, called BIC-GSA, the gravitational search algorithm is used to find a near optimal solution for biclustering problem. The benchmark clickstream dataset from UCI repository is used to evaluate and to study the performance of the presented algorithm. The results show that the proposed algorithm can find high quality biclusters in the tested dataset.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128427101","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
扫码关注我们
求助内容：
应助结果提醒方式：