Pub Date : 2016-12-01DOI: 10.1109/IC3I.2016.7917944
Shubham Awasthi, A. Pathak, Lovekesh Kapoor
With emergence in cloud computing there was a huge demand for the data center technology and the operating system which can handle the data center. Increasing demand of infrastructure services leading the organizations to move towards Cloud. The aim is to provide an opportunity to the industry to build a hosting architecture, massively scalable which is completely open source, and to provide a solution to manage their on premises datacenters or private cloud and public cloud data centers simultaneously. When we talk about the combination of private as well as public cloud workloads, here term comes into existence i.e. Hybrid Cloud. To build and manage the Hybrid cloud, Openstack is the open source solution available in market. Here we will be discussing the whole concept of OpenStack in detail, It's architecture, functionalities and how we setup it in our environment tested different use cases.
{"title":"Openstack-paradigm shift to open source cloud computing & its integration","authors":"Shubham Awasthi, A. Pathak, Lovekesh Kapoor","doi":"10.1109/IC3I.2016.7917944","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7917944","url":null,"abstract":"With emergence in cloud computing there was a huge demand for the data center technology and the operating system which can handle the data center. Increasing demand of infrastructure services leading the organizations to move towards Cloud. The aim is to provide an opportunity to the industry to build a hosting architecture, massively scalable which is completely open source, and to provide a solution to manage their on premises datacenters or private cloud and public cloud data centers simultaneously. When we talk about the combination of private as well as public cloud workloads, here term comes into existence i.e. Hybrid Cloud. To build and manage the Hybrid cloud, Openstack is the open source solution available in market. Here we will be discussing the whole concept of OpenStack in detail, It's architecture, functionalities and how we setup it in our environment tested different use cases.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128036586","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-12-01DOI: 10.1109/IC3I.2016.7918043
A. Rao, S. Ramakrishna
In the unsuprevised learning method of text mining process that is in prevalence, the issues pertaining to multi dimensionality is turning out to be a major factor, as the clustering is not focusing on optimal evaluation of concept, context and semantic relevancy, which are also very essential in terms of clustering process. In majority of the models that are proposed earlier, the factors like the term frequency, were considered and the clustering has been focusing only on one factor of Semantic, whereas as context and conceptual factors also play a significant importance. In extension to the earlier model of MODC, and DC3SR, the proposed model of Multi-objective Distance based Optimal Document Clustering (MODC) by GA has been proposed in the study. Among the lessons that are learnt from the review of earlier models., the scope for fuzzy guided multi-objective optimal document clustering (FMODC) approach which shall support in more effective computation and clustering using the Genetic Algorithm is discussed in the case scenario. From the experimentation process that is focused in the study, using the meta-text data gathered from the same publisher, the model has been tested in comparative analysis to other two models, BADC and AC-DCO and the outcome in terms of optimum clustering that has been achieved with FMODC model depicts the kind of accuracy in the model and the system. An unsupervised learning approach to form the initial clusters that estimates similarity between any two documents by concept, context and semantic relevance score and further optimizes by fuzzy genetic algorithm is proposed. This novel method represents the concept as correlation between arguments and activities in given documents, context as correlation between meta-text of the documents and the semantic relevance is assessed by estimating the similarity between documents through the hyponyms of the arguments. The meta-text of the documents considered for context assessment contains the authors list, keywords list and list of document versioning time schedules. The experiments were conducted to assess the significance of the proposed model.
{"title":"FMODC: Fuzzy guided multi-objective document clustering by GA","authors":"A. Rao, S. Ramakrishna","doi":"10.1109/IC3I.2016.7918043","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7918043","url":null,"abstract":"In the unsuprevised learning method of text mining process that is in prevalence, the issues pertaining to multi dimensionality is turning out to be a major factor, as the clustering is not focusing on optimal evaluation of concept, context and semantic relevancy, which are also very essential in terms of clustering process. In majority of the models that are proposed earlier, the factors like the term frequency, were considered and the clustering has been focusing only on one factor of Semantic, whereas as context and conceptual factors also play a significant importance. In extension to the earlier model of MODC, and DC3SR, the proposed model of Multi-objective Distance based Optimal Document Clustering (MODC) by GA has been proposed in the study. Among the lessons that are learnt from the review of earlier models., the scope for fuzzy guided multi-objective optimal document clustering (FMODC) approach which shall support in more effective computation and clustering using the Genetic Algorithm is discussed in the case scenario. From the experimentation process that is focused in the study, using the meta-text data gathered from the same publisher, the model has been tested in comparative analysis to other two models, BADC and AC-DCO and the outcome in terms of optimum clustering that has been achieved with FMODC model depicts the kind of accuracy in the model and the system. An unsupervised learning approach to form the initial clusters that estimates similarity between any two documents by concept, context and semantic relevance score and further optimizes by fuzzy genetic algorithm is proposed. This novel method represents the concept as correlation between arguments and activities in given documents, context as correlation between meta-text of the documents and the semantic relevance is assessed by estimating the similarity between documents through the hyponyms of the arguments. The meta-text of the documents considered for context assessment contains the authors list, keywords list and list of document versioning time schedules. The experiments were conducted to assess the significance of the proposed model.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114004209","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-12-01DOI: 10.1109/IC3I.2016.7917999
Anshuman Agarwal, Shivam Gupta, D. Singh
Object detection in a video is a challenging task in the field of image processing. Some applications of the domain are Human Machine Interaction (HMI), Security and Surveillance, Supplemented Authenticity, Traffic Monitoring on Roads, Medicinal Imaging etc. There happens to be a number of methods available for object detection. Each of the method has some constraints on the kind of application it has been used for. This paper presents one of such method which is termed as Optical Flow technique. This technique is found to be more robust and efficient for moving object detection and the same has been shown by an experiment in the paper. Applying optical flow to an image gives flow vectors of the points corresponding to the moving objects. Next part of marking the required moving object of interest counts to the post processing. Post processing is the legitimate contribution of the paper for moving object detection problem. This here is discussed as Blob Analysis. It is tested on datasets available online, real time videos and also on videos recorded manually. The results show that the moving objects are successfully detected using optical flow technique and the required post processing.
{"title":"Review of optical flow technique for moving object detection","authors":"Anshuman Agarwal, Shivam Gupta, D. Singh","doi":"10.1109/IC3I.2016.7917999","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7917999","url":null,"abstract":"Object detection in a video is a challenging task in the field of image processing. Some applications of the domain are Human Machine Interaction (HMI), Security and Surveillance, Supplemented Authenticity, Traffic Monitoring on Roads, Medicinal Imaging etc. There happens to be a number of methods available for object detection. Each of the method has some constraints on the kind of application it has been used for. This paper presents one of such method which is termed as Optical Flow technique. This technique is found to be more robust and efficient for moving object detection and the same has been shown by an experiment in the paper. Applying optical flow to an image gives flow vectors of the points corresponding to the moving objects. Next part of marking the required moving object of interest counts to the post processing. Post processing is the legitimate contribution of the paper for moving object detection problem. This here is discussed as Blob Analysis. It is tested on datasets available online, real time videos and also on videos recorded manually. The results show that the moving objects are successfully detected using optical flow technique and the required post processing.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123641646","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-12-01DOI: 10.1109/IC3I.2016.7917954
B. K. Joshi, Megha Soni
A MANet a is set of wireless mobile nodes that share a common wireless channel without any centralized unit. In recent years many routing protocols have been proposed for application of MANets in government, commercial and military area. MANets have some qualities such as dynamic nature, decentralized support and infrastructure-less which make it extremely prone to attacks. Security becomes a major issue in the design of routing protocols in MANets. In this paper, we present security analysis of routing protocol in general and Ad-hoc On demand Distance Vector in particular under different type of attacks.
{"title":"Security assessment of AODV protocol under Wormhole and DOS attacks","authors":"B. K. Joshi, Megha Soni","doi":"10.1109/IC3I.2016.7917954","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7917954","url":null,"abstract":"A MANet a is set of wireless mobile nodes that share a common wireless channel without any centralized unit. In recent years many routing protocols have been proposed for application of MANets in government, commercial and military area. MANets have some qualities such as dynamic nature, decentralized support and infrastructure-less which make it extremely prone to attacks. Security becomes a major issue in the design of routing protocols in MANets. In this paper, we present security analysis of routing protocol in general and Ad-hoc On demand Distance Vector in particular under different type of attacks.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122473349","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-12-01DOI: 10.1109/IC3I.2016.7917926
Viral Nagori
The back propagation algorithm has wide range of applications for training of feed forward neural networks. Over the years, many researchers have used back propagation algorithm to train their neural network based systems without emphasizing on how to fine tune the parameters of the algorithm. The paper throws the light on how researchers can manipulate and experiment with the parameters of the back propagation algorithm to achieve the optimum learning performance. The paper presents the results of the laboratory experiments of fine tuning the parameters of the back propagation algorithm. The process of fine tuning the parameters was applied on the neural network based expert system prototype. The prototype aims to analyze and design customized motivational strategies based on employees' perspective. The laboratory experiments were conducted on the following parameters of back propagation algorithm: learning rate, momentum rate and activation functions. Learning performance are measured and recorded. At the same time, the impact of activation function on the final output is also measured. Based on the results, the values of the above parameters which provide the optimum learning performance is chosen for the full scale system implementation.
{"title":"Fine tuning the parameters of back propagation algorithm for optimum learning performance","authors":"Viral Nagori","doi":"10.1109/IC3I.2016.7917926","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7917926","url":null,"abstract":"The back propagation algorithm has wide range of applications for training of feed forward neural networks. Over the years, many researchers have used back propagation algorithm to train their neural network based systems without emphasizing on how to fine tune the parameters of the algorithm. The paper throws the light on how researchers can manipulate and experiment with the parameters of the back propagation algorithm to achieve the optimum learning performance. The paper presents the results of the laboratory experiments of fine tuning the parameters of the back propagation algorithm. The process of fine tuning the parameters was applied on the neural network based expert system prototype. The prototype aims to analyze and design customized motivational strategies based on employees' perspective. The laboratory experiments were conducted on the following parameters of back propagation algorithm: learning rate, momentum rate and activation functions. Learning performance are measured and recorded. At the same time, the impact of activation function on the final output is also measured. Based on the results, the values of the above parameters which provide the optimum learning performance is chosen for the full scale system implementation.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125103322","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-12-01DOI: 10.1109/IC3I.2016.7918800
Sonia Chhabra, Harvir Singh
Accurate estimation of the cost of a software minimizes the risk for the software development process. Applicability of the different cost estimation models is very crucial as the information required for the implementation of such models is imprecise and vague. In order to increase the accuracy of the model, it is proposed to introduce the concept of fuzzification for calculating the value of effort multiplier corresponding to different of cost drivers used in COCOMO model. The proposed model is designed using the MATLAB and is modeled in SIMULINK. The results are validated using the COCOMO dataset and it has been observed that by fuzzifying the cost drivers the model generated the results more closer to the actual values and thus enhances the accuracy of the estimation process.
{"title":"Simulink based fuzzified COCOMO","authors":"Sonia Chhabra, Harvir Singh","doi":"10.1109/IC3I.2016.7918800","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7918800","url":null,"abstract":"Accurate estimation of the cost of a software minimizes the risk for the software development process. Applicability of the different cost estimation models is very crucial as the information required for the implementation of such models is imprecise and vague. In order to increase the accuracy of the model, it is proposed to introduce the concept of fuzzification for calculating the value of effort multiplier corresponding to different of cost drivers used in COCOMO model. The proposed model is designed using the MATLAB and is modeled in SIMULINK. The results are validated using the COCOMO dataset and it has been observed that by fuzzifying the cost drivers the model generated the results more closer to the actual values and thus enhances the accuracy of the estimation process.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125176649","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-12-01DOI: 10.1109/IC3I.2016.7917958
Ruchi Varma, J. Ghosh
In this paper, a compact dual band planar inverted-F antenna (PIFA) has been proposed. Dual band is achieved by inserting slots on the top radiating patch. The dimension of the patch is 15 × 12 mm2 and finite ground plane size is 44×40mm2 which can easily be integrated inside the mobile phone. Further, a hybrid neural network (HNN) is used for the design of dual band PIFA. This method is more accurate and requires less time. The HNN results are compared with the CST simulation results and are found to be in good accord.
{"title":"Modeling of a compact dual band PIFA using hybrid neural network","authors":"Ruchi Varma, J. Ghosh","doi":"10.1109/IC3I.2016.7917958","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7917958","url":null,"abstract":"In this paper, a compact dual band planar inverted-F antenna (PIFA) has been proposed. Dual band is achieved by inserting slots on the top radiating patch. The dimension of the patch is 15 × 12 mm2 and finite ground plane size is 44×40mm2 which can easily be integrated inside the mobile phone. Further, a hybrid neural network (HNN) is used for the design of dual band PIFA. This method is more accurate and requires less time. The HNN results are compared with the CST simulation results and are found to be in good accord.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127199705","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-12-01DOI: 10.1109/IC3I.2016.7917963
Sanjoy Mitra, Debaprasad Das
Power density for digital circuits is increasing by leaps and bounds with the progress of technology and increased integration. Higher spatial power density contemplates heat generation which raises peak temperature affecting flawless system behavior. The situation is worsened further during testing and this rise in temperature during test can permanently spoil the chip. To resolve this problem, significant efforts are rendered by the academia and industry for controlling temperature rise during test mode operation and peak temperature reduction is viewed as a sub problem in this context. Controlling of temperature divergence is also needed to bring temperature distribution homogeneity across the chip. Heat generated inside a chip under test can be dropped down by lowering inter test cube switching activity. Controlling of peak temperature and temperature divergence with in a safe legitimate threshold may be accomplished by an intelligent don't care bit filling approach which especially takes care of thermal effect and drops down switching activity inside a circuit block. In this paper, a thermal effect aware don't care (X) filling approach is put forwarded which controls peak temperature and temperature divergence within a predefined threshold during testing. This proposal is verified by extensive simulation on ITC'99 benchmark circuits and exhibits a satisfactory level of efficacy.
{"title":"Thermal effect aware X-bit filling technique for peak temperature reduction during VLSI testing","authors":"Sanjoy Mitra, Debaprasad Das","doi":"10.1109/IC3I.2016.7917963","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7917963","url":null,"abstract":"Power density for digital circuits is increasing by leaps and bounds with the progress of technology and increased integration. Higher spatial power density contemplates heat generation which raises peak temperature affecting flawless system behavior. The situation is worsened further during testing and this rise in temperature during test can permanently spoil the chip. To resolve this problem, significant efforts are rendered by the academia and industry for controlling temperature rise during test mode operation and peak temperature reduction is viewed as a sub problem in this context. Controlling of temperature divergence is also needed to bring temperature distribution homogeneity across the chip. Heat generated inside a chip under test can be dropped down by lowering inter test cube switching activity. Controlling of peak temperature and temperature divergence with in a safe legitimate threshold may be accomplished by an intelligent don't care bit filling approach which especially takes care of thermal effect and drops down switching activity inside a circuit block. In this paper, a thermal effect aware don't care (X) filling approach is put forwarded which controls peak temperature and temperature divergence within a predefined threshold during testing. This proposal is verified by extensive simulation on ITC'99 benchmark circuits and exhibits a satisfactory level of efficacy.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114711818","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-12-01DOI: 10.1109/IC3I.2016.7917977
Mamta Jain, Rishabh Choudhary, A. D. Sivarama Kumar
In this article, a novel technique about secure medical information transmission of patient inside medical cover image is presented by concealing data using decision tree concept. Decision tree shows a robust mechanism by providing decisions for secret information concealing location in medical carrier image using secret information mapping concept. RSA encryption algorithm is being used for patient's unique information enciphering. The outcome of the RSA is structured into various equally distributed blocks. In steganography, secret cipher blocks are assigned to carrier image for data inserting by mapping mechanism using breadth first search. Receiver gets hidden secret medical information of patient using RSA decryption, so only authorized recipient can recognize the plain text. Performance is analyzed and measured using numerous parameters between medical stego and carrier images. Results are analyzed and compared with many of existing algorithms.
{"title":"Secure medical image steganography with RSA cryptography using decision tree","authors":"Mamta Jain, Rishabh Choudhary, A. D. Sivarama Kumar","doi":"10.1109/IC3I.2016.7917977","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7917977","url":null,"abstract":"In this article, a novel technique about secure medical information transmission of patient inside medical cover image is presented by concealing data using decision tree concept. Decision tree shows a robust mechanism by providing decisions for secret information concealing location in medical carrier image using secret information mapping concept. RSA encryption algorithm is being used for patient's unique information enciphering. The outcome of the RSA is structured into various equally distributed blocks. In steganography, secret cipher blocks are assigned to carrier image for data inserting by mapping mechanism using breadth first search. Receiver gets hidden secret medical information of patient using RSA decryption, so only authorized recipient can recognize the plain text. Performance is analyzed and measured using numerous parameters between medical stego and carrier images. Results are analyzed and compared with many of existing algorithms.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122161452","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-12-01DOI: 10.1109/IC3I.2016.7918005
S. Asopa, Pooja Asopa, Iti Mathur, Nisheeth Joshi
In this research paper, a rule based chunker is developed and evaluated. For the development of the chunker, handcrafted linguistic rules for mainly noun, adverb, verb, adjective phrases and conjuncts were generated. Indian Languages Chunk Tagset is used for annotations. In order to evaluate, 500 sentences of Hindi language tagged by HMM tagger were considered and given as an input to our chunker. Precision, Recall and F-Measure for the system were calculated and found to be 79.68, 69.36 and 74.16 respectively.
{"title":"Rule based chunker for Hindi","authors":"S. Asopa, Pooja Asopa, Iti Mathur, Nisheeth Joshi","doi":"10.1109/IC3I.2016.7918005","DOIUrl":"https://doi.org/10.1109/IC3I.2016.7918005","url":null,"abstract":"In this research paper, a rule based chunker is developed and evaluated. For the development of the chunker, handcrafted linguistic rules for mainly noun, adverb, verb, adjective phrases and conjuncts were generated. Indian Languages Chunk Tagset is used for annotations. In order to evaluate, 500 sentences of Hindi language tagged by HMM tagger were considered and given as an input to our chunker. Precision, Recall and F-Measure for the system were calculated and found to be 79.68, 69.36 and 74.16 respectively.","PeriodicalId":305971,"journal":{"name":"2016 2nd International Conference on Contemporary Computing and Informatics (IC3I)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129933171","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
扫码关注我们
求助内容：
应助结果提醒方式：