{"title":"A More Private & Secure E-Mail System using Image Steganography (EPS) and Data Mining","authors":"Ruchi Sharma, Nidhi Sharma","doi":"10.1145/2979779.2979827","DOIUrl":"https://doi.org/10.1145/2979779.2979827","url":null,"abstract":"Data mining is a practice of automatically exploring and analysis of large quantities of data in order to discover valid, potentially useful and understandable patterns in data [1]. The data provided may contain private and user sensitive data leads to increasing concern about privacy and how to preserve it? Basically privacy preserving is an important issue in the field of data mining which deals with hiding individual's sensitive identity against unsolicited disclosure. There is also need of privacy preserving methods of communication which we are using regularly such as E-mail. E-mail is one of the most popular mode of communication due to its low cost, better usage of mails and business potentials. In order to discover user need and knowledge in mailing various data mining techniques have been applied on e-mail data to find unknown pattern. As email data also contains sensible information. In today's world people have become well aware of the privacy threats on their personal and sensitive data which is kept on e-mail is viewed anywhere. In this paper, we present a brief model for privacy and security on e-mail mining using a new designed steganography approach EPS(E-mail Privacy Steganography).","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124616468","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 Structure for Web Graphs with Extended Functionalities","authors":"Shruti Goyal, P. Bindu, P. S. Thilagam","doi":"10.1145/2979779.2979825","DOIUrl":"https://doi.org/10.1145/2979779.2979825","url":null,"abstract":"The hyperlink structure of World Wide Web is modeled as a directed, dynamic, and huge web graph. Web graphs are analyzed for determining page rank, fighting web spam, detecting communities, and so on, by performing tasks such as clustering, classification, and reachability. These tasks involve operations such as graph navigation, checking link existence, and identifying active links, which demand scanning of entire graphs. Frequent scanning of very large graphs involves more I/O operations and memory overheads. To rectify these issues, several data structures have been proposed to represent graphs in a compact manner. Even though the problem of representing graphs has been actively studied in the literature, there has been much less focus on representation of dynamic graphs. In this paper, we propose Tree-Dictionary-Representation (TDR), a compressed graph representation that supports dynamic nature of graphs as well as the various graph operations. Our experimental study shows that this representation works efficiently with limited main memory use and provides fast traversal of edges.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129631447","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":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","authors":"S. Bishnoi, M. Kuri, V. Goar","doi":"10.1145/2979779","DOIUrl":"https://doi.org/10.1145/2979779","url":null,"abstract":"","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116011081","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":"Implementing an Authentication Mechanism for Machine Deletion on the Cloud","authors":"P. Dubey, Vineeta Tiwari, Shweta A Chawla","doi":"10.1145/2979779.2979878","DOIUrl":"https://doi.org/10.1145/2979779.2979878","url":null,"abstract":"Digital Investigation on the cloud platform is a challenging task. In the Virtual Scenario, Virtual Machines contain evidences. If once VMDK (Virtual Machine Disk file) is destroyed (deleted), it is impossible to recover your VM. At present there does not exist any mechanism that can recover a destroyed VM again which is the flaw in VM itself. All the activities on the VM is logged in VM, whereas activities of CSP (Cloud Service Provider) is logged on the server. So even if someone deleted the VM, all the evidences will be lost. This creates a disaster for the user and acts as a barrier for a forensic investigator to dig out the sensitive data of user that was stored in the Virtual Machine sometime. Thus, through this paper, we explore the existing mechanisms and challenges in the current cloud scenario and implement a mechanism to prevent the unauthorized deletion of the Virtual Machines.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114210293","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":"A Novel Hybrid Ant Colony Optimization Approach to Terminal Assignment Problem","authors":"M. Prasad, Alok Singh","doi":"10.1145/2979779.2979808","DOIUrl":"https://doi.org/10.1145/2979779.2979808","url":null,"abstract":"Terminal Assignment (TA) problem is a well-known NP-hard problem in the domain of telecommunication networks. This problem deals with assignment of a given collection of terminals to a given collection of concentrators subject to some constraints. Each terminal is assumed to have a positive weight and each concentrator is assumed to have fixed capacity. TA problem assigns terminals to concentrators in such a way that each terminal is assigned to exactly one concentrator, and the aggregate weight of terminals assigned to any concentrator should not exceed its capacity. The objective of the TA problem is to minimize the weighted sum of distances of terminals from their assigned concentrators and the unbalance in loads on different concentrators as measured by a balance function. We have developed a hybrid ant colony optimization approach for the TA problem. Our approach is a combination of Vogel approximation method, an Ant Colony optimization algorithm, and a local search. Computational results on standard benchmark instances show that our proposed approach has performance comparable with other state-of-the-art metaheuristic approaches.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129533323","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":"Rationale of Class and Feature size on Face Recognition","authors":"H. S. Jagadeesh, B. K. Suresh, K. Raja","doi":"10.1145/2979779.2979810","DOIUrl":"https://doi.org/10.1145/2979779.2979810","url":null,"abstract":"Multidimensional problems associated with face recognition needs to be analyzed in debris form. In this paper, an efficient algorithm is proposed using Basic Local Phase Quantization (BLPQ), Scaled Gray Level Co-occurrence Matrix (SGLCM) and Singular Value Decomposition (SVD) with two mask processing techniques. Preprocessing crops faces from input images using a face detection method. One hundred features each of BLPQ histogram; SGLCM and SVD are fused to obtain final significant features. Euclidean Distance (ED) measure is used for computing the results. Performance of the proposed algorithm on CMU-PIE face dataset outperforms for different cases considered.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132315465","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}
A. Rawat, A. K. Singh, J. Jithin, N. Jeyanthi, R. Thandeeswaran
{"title":"RSJ Approach for User Authentication","authors":"A. Rawat, A. K. Singh, J. Jithin, N. Jeyanthi, R. Thandeeswaran","doi":"10.1145/2979779.2979880","DOIUrl":"https://doi.org/10.1145/2979779.2979880","url":null,"abstract":"Some of the common works like, upload and retrieval of data, buying and selling things, earning and donating or transaction of money etc., are the most common works performed in daily life through internet. For every user who is accessing the internet regularly, their highest priority is to make sure that there data is secured. Users are willing to pay huge amount of money to the service provider for maintaining the security. But the intention of malicious users is to access and misuse others data. For that they are using zombie bots. Always Bots are not the only malicious, legitimate authorized user can also impersonate to access the data illegally. This makes the job tougher to discriminate between the bots and boots. For providing security form that threats, here we are proposing a novel RSJ Approach by User Authentication. RSJ approach is a secure way for providing the security to the user form both bots and malicious users.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130598678","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":"Analysis of Users' Comments on Political Portal for Extraction of Suggestions and Opinion Mining","authors":"Swati Verma, A. Ramamurthy","doi":"10.1145/2979779.2979870","DOIUrl":"https://doi.org/10.1145/2979779.2979870","url":null,"abstract":"Online political portals contain a huge volume of users' comments. These comments express whether writer's attitude is positive, negative, or neutral towards the subject. In most of the comments, we find that there are suggestions or feedback also hidden along with the opinion. These suggestions or feedbacks from the mind of different people on various topics can potentially coin new fruitful idea or provide solution to a given problem. So, it is beneficial to determine the opinion and filter out the suggestions from comments. This helps greatly in social issues' analysis and development of people centric governance. Till date, most of the researches on sentiment analysis and suggestion mining have been done for comments related to product or services. Very less work has been done for analysis of comments related to social issues. Even recent algorithms give accuracy of 60 to 65 percent for opinion mining of social issues and a maximum of 73% accuracy for suggestion extraction. This paper focuses on evaluating the polarity of sentiment and extracting actionable key suggestions in users' comments on political portal. Current work gives 88% accuracy for suggestion extraction and approx 86% accuracy for Opinion Mining.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132567381","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":"Web Service Selection using Semantic Matching","authors":"Dr. Lalit Purohit, Sandeep Kumar","doi":"10.1145/2979779.2979795","DOIUrl":"https://doi.org/10.1145/2979779.2979795","url":null,"abstract":"Web services are becoming a common and convenient means of doing business over the Internet. More-and-more web services are kept on arriving over the Internet, offering the same set of services to the end users. The availability of similar web services increases the complexity of discovery as well as the selection process of web services. The traditional way of discovery of web service involves keyword based searching followed by manual selection. The keyword based search is not efficient. In this paper, we have used an improved mechanism for web service selection based on Input as well as Output(IO) information of web services. The IO information of web services is obtained from OWL-S ontology. The results obtained by conducting experiments, indicate that there is a notable improvement in the search of the desired Web Service, using IO based matchmaking over keyword based search. This subsequently leads to better end user satisfaction and automation of web service selection task.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129735530","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":"A Feature Based Approach for Medical Databases","authors":"Ritu Chauhan, Harleen Kaur, Sukrati Sharma","doi":"10.1145/2979779.2979873","DOIUrl":"https://doi.org/10.1145/2979779.2979873","url":null,"abstract":"Medical data mining is an emerging field employed to discover hidden knowledge within the large datasets for early medical diagnosis of disease. Usually, large databases comprise of numerous features which may have missing values, noise and outliers. However, such features can mislead to future medical diagnosis. Moreover to deal with irrelevant and redundant features among large databases, proper pre processing data techniques needs be applied. In, past studies data mining technique such as feature selection is efficiently applied to deal with irrelevant, noisy and redundant features. This paper explains application of data mining techniques using feature selection for pancreatic cancer patients to conduct machine learning studies on collected patient records. We have evaluated different feature selection techniques such as Correlation-Based Filter Method (CFS) and Wrapper Subset Evaluation using Naive Bayes and J48 (an implementation of C4.5) classifier on medical databases to analyze varied data mining algorithms which can effectively classify medical data for future medical diagnosis. Further, experimental techniques have been used to measure the effectiveness and efficiency of feature selection algorithms. The experimental analysis conducted has proven beneficiary to determine machine learning methods for effective analysis of pancreatic cancer diagnosis.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130534088","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}