{"title":"Opinion Mining Using Frequent Pattern Growth Method from Unstructured Text","authors":"Tanvir Ahmad, M. Doja","doi":"10.1109/ISCBI.2013.26","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.26","url":null,"abstract":"In the last one decade, the area of opinion mining has experienced a major growth because of the increase in online unstructured data which are contributed by reviewers over different topics and subjects. These data sometimes become important for users who want to take their decision based on opinions of actual users of the product. In this paper, we present the FP-growth method for frequent pattern mining from review documents which act as a backbone for mining the opinion words along with their relevant features by experimental data over two different domains which are very different in their nature.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114447172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Syntactic and Structural Divergence in English-to-Marathi Machine Translation","authors":"S. Kulkarni, P. Deshmukh, K. Kale","doi":"10.1109/ISCBI.2013.46","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.46","url":null,"abstract":"The translation divergence is a challenging problem in the area of machine translation. Language divergence arises when lexically and syntactically similar sentences of the source language do not translate into sentences that are similar in lexical and syntactic structure in the target language. A detailed study of divergence issues in machine translation is required for their proper classification and detection. Though a number of Machine Translation developers have given attention to this problem, it is difficult to derive general strategies which can be used for any language pair. In this paper, we discuss the translation pattern between English to Marathi and Marathi to English of various constructions to identify the structural and syntactic divergences in English-Marathi language pair.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126209040","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}
Khalid Mohiuddin, A. Mohammad, Srinivas Sivarathri, Juma Abdulkhader Lackshe
{"title":"Digital Intellectual Property as a Service (DIPaaS): For Mobile Cloud Users","authors":"Khalid Mohiuddin, A. Mohammad, Srinivas Sivarathri, Juma Abdulkhader Lackshe","doi":"10.1109/ISCBI.2013.15","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.15","url":null,"abstract":"With the integration of cloud computing, smart phones enormously improved in processing power, storage, communication efficiency, and reliability. The technical architecture of Cloud strongly supports the efficient delivery of services in mobile environment. Whereas the mobile cloud users can access all the resources as a service dynamically in elastic mode. Accessing Digital Intellectual Property as a Service (DIPaaS) on flexible economic basis is a major interest among the mobile users. DIP is the piece of work of human intellectual in digital form such as eBook, software program, e-painting, movie, song, computer game, and etc. The DIP services complex in nature, involves creator, manufacturer, distributor, licensing agencies, and service providers. However, the service limitations exist, shall be overcome with an understanding approach to Service Level Agreement (SLA). DIP applications consume a large of local resources and could not be implemented on standalone mobile phones. Therefore, we realize increasing demand for an efficient service-model which satisfies the mobile cloud users at large. We proposed the first service-model includes both technical and service architecture to encourage the stakeholders for DIP access in mobile cloud environment. Eventually we present an efficient access to Digital Intellectual Property as a Service in Mobile Cloud Environment (DIPaaSMCE).","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125633566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Overlapping Social Network Communities and Viral Marketing","authors":"S. Y. Bhat, M. Abulaish","doi":"10.1109/ISCBI.2013.56","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.56","url":null,"abstract":"Social networks have highly been used to understand the behavior and activities of individuals in nature and society. They are being used as a means to communicate, diffuse information, and to control the spread of diseases and computer viruses, in addition to many other tasks. Business organizations look upon social networks as an opportunity to spread the word-of-mouth for viral marketing and this task has gained significance with the popularity of Online Social Networks (OSNs). However, an important characteristic of social networks, including OSNs, which is the existence of overlapping communities of users, has not been exploited yet for the task of viral marketing even though it seems promising. This paper aims to present the importance of identifying overlapping communities for the task of viral marketing in social networks and also provides some experimental results on an email network to back the claims.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134211029","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}
Jhunu Debbarma, M. Debbarma, Sudipta Roy, N. Debbarma, R. Pal
{"title":"An Efficient Energy Protocol for Power Conservation in Mobile Ad-Hoc Networks","authors":"Jhunu Debbarma, M. Debbarma, Sudipta Roy, N. Debbarma, R. Pal","doi":"10.1109/ISCBI.2013.28","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.28","url":null,"abstract":"The challenging factors in mobile ad-hoc communication are energy resource; hence energy expended for data transmission across the network has to be minimized. MANETs are constrained by limited power so energy management is to be focused. The challenging factors for energy efficient communication is determining energy efficient communication strategies between source and destination nodes through multi-hop networks. The energy efficient strategies need to consider the best route, power associated with each route and the slots during which the routes are to be chosen. In this paper an efficient energy management protocol E-power is proposed. The objectives are to reduce end-to-end delay, increase packet delivery ratio and throughput. E-power is based on IEEE 802.11 power saving techniques. It is proposed to reduce power consumption and reduce transmission latency on useless tasks. The simulations have been done by changing the initial energy, transmission power and receiving power level parameters using NS 2.34 simulators.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132405070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Data Blocks' Signature in Cloud Computing","authors":"Shuang Tan, Zhi-Kun Chen, Jian-Feng Zhang","doi":"10.1109/ISCBI.2013.18","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.18","url":null,"abstract":"Several trends are opening up the era of cloud computing. It moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. This work studies the problem of ensuring the integrity of data storage in cloud computing. We use RSA's homomorphic property to construct the provable data integrity. In our protocol, we can aggregate mutiple provable data integrity into one, and reduce the overhead of communication. While prior work on ensuring remote data integrity often lacks the specific implementations, this paper achieves an effective proof of storage protocol. Extensive security and performance analysis show that the proposed scheme is highly efficient and provably secure.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114413269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic Set-Point Weighted Fuzzy PID Controller","authors":"P. Mitra, C. Dey, R. Mudi","doi":"10.1109/ISCBI.2013.29","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.29","url":null,"abstract":"A fuzzy PID controller with dynamic set-point weighting technique is proposed. Fuzzy PID controller is realized by combining the control actions produced by a fuzzy PI and fuzzy PD controllers with suitable output scaling factors. Input to the fuzzy controllers i.e., error and change of error are calculated from the dynamically weighted set-point for each sampling instant. The dynamic weighting factor is calculated online from a simple relation consisting of normalized change of error and normalized process dead time. The proposed dynamic set-point weighted fuzzy PID controller provides a significant amount of performance enhancement for higher order processes with dead time, verified through simulation as well as real time implementation. Unlike to the conventional fixed set-point weighting which offers only improved set-point response, our proposed dynamic set-point weighting is capable to provide simultaneous improvement during both the set-point tracking as well as load variation with considerable robustness in close-loop behavior.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116383149","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}
Anukriti, Sushant Tiwari, T. Chatterjee, M. Bhattacharya
{"title":"Speaker Independent Speech Recognition Implementation with Adaptive Language Models","authors":"Anukriti, Sushant Tiwari, T. Chatterjee, M. Bhattacharya","doi":"10.1109/ISCBI.2013.9","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.9","url":null,"abstract":"Speech recognition system is the method of implementing protocols and codes to enable a machine to take sound waves in the form of input, interpret it and formulate the desired output. In this paper, a method has been proposed to build up a speech recognition system which could interpret in any language (tested with Hindi and Bengali language) and implement it on Windows 7 platform which could be speaker independent i.e. recognition of voice irrespective of any random speaker.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124485780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Discrete Invasive Weed Optimization Algorithm for Graph Based Combinatorial Road Network Management Problem","authors":"C. Sur, A. Shukla","doi":"10.1109/ISCBI.2013.58","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.58","url":null,"abstract":"Invasive Weed Optimization (IWO) Algorithm is a nature inspired swarm based continuous domain optimization meta-heuristics which mimicry the expansion-cum-survival strategy of the weeds in favorable, rich and unwanted regions which happens to be the best solution in terms of optimization with respect to competition, growth and nutrition. These unwanted plants are in consistent competition and opposition from the other members of the nature either directly or indirectly and as a result their way of living, foraging and sustaining are the most robust and challenging. This optimization technique has been proven to be successful in many continuous parameter domains due to their unique spreading characteristics and optimization search methods. In this work we have extended the utility of the invasive weed optimization algorithm for graph based combinatorial optimization for path search and planning for vehicle routing from a source to destination. The problem can be viewed as a multimodal optimization problem where selection of a certain sequence of multimodal solutions would be best solution. For this we have modified the classical IWO to suit the graph based situation and made necessary change in implications to cope up with the graph parameters. The convergence rate of the Discrete Invasive Weed Optimization (DIWO) Algorithm is being compared with Ant Colony Optimization (ACO) and Intelligent Water Drop (IWD) algorithm with an application on a road graph model for route optimization for vehicles with respect to multi-objective of travelling and waiting time.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhancing the Accuracy of Case-Based Estimation Model through Early Prediction of Error Patterns","authors":"Ekbal Rashid, S. Patnaik, V. Bhattacharya","doi":"10.1109/ISCBI.2013.49","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.49","url":null,"abstract":"The paper tries to explore the importance of software fault prediction and to minimize them thoroughly with the advanced knowledge of the error-prone modules, so as to enhance the software quality. For estimating a new project effort, case-based reasoning is used to predict software quality of the system by examining a software module and predicting whether it is faulty or non faulty. In this research we have proposed a model with the help of past data which is used for prediction. Two different similarity measures namely, Euclidean and Manhattan are used for retrieving the matching case from the knowledge base. These measures are used to calculate the distance of the new record set or case from each record set stored in the knowledge base. The matching case(s) are those that have the minimum distance from the new record set. This can be extended to variety of system like web based applications, real time system etc. In this paper we have used the terms errors and faults, and no explicit distinction made between errors and faults. In order to obtain results we have used MATLAB 7.10.0 version as an analyzing tool.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121569944","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}