2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)最新文献

筛选
英文 中文
Using k-means clustering algorithm for handling data precision 采用k-means聚类算法处理数据精度
P. Suganthi, K. Kala, C. Balasubramanian
{"title":"Using k-means clustering algorithm for handling data precision","authors":"P. Suganthi, K. Kala, C. Balasubramanian","doi":"10.1109/ICCTIDE.2016.7725374","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725374","url":null,"abstract":"The sensitive data are patient record details, organization record which are handled only administrative member. Preservation of privacy is a major feature of data mining and individual's privacy without losing of confidential data. The objective of privacy preserving data mining is to mine significant information from large amounts of dataset. To prevent the misuse of sensitive information such as patient record by the system administrator. The database administrator collects patient's data which are maintained in secured manner. The sensitive information has patient's name, Address, Disease, Date of Visit. The privacy preservation mechanism can be carried out through anonymization techniques. In order to preserve the sensitive data, the system administrator modifying the patient details. Privacy preserving techniques used to handle the sensitive information from unsanctioned users. The proposal system is original patient record should be transformed into Anonymized table which is identified only by administrative. To keep anonymized table in cluster form using k-means clustering algorithm. To keep anonymized table in cluster form using k-means clustering algorithm. To partition anonymized table into cluster, and each cluster has similar data object which is based on anonymized data attribute. After that the grouped similar data to be protected using AES encryption algorithm. The aim of this paper is to provide more accuracy and better level of privacy of sensitive attribute.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123702466","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}
引用次数: 2
Semantic similarity based assessment of descriptive type answers 基于语义相似性的描述性答案评估
K. Meena, R. Lawrance
{"title":"Semantic similarity based assessment of descriptive type answers","authors":"K. Meena, R. Lawrance","doi":"10.1109/ICCTIDE.2016.7725366","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725366","url":null,"abstract":"The knowledge assessment and competence is an important division in an education procedure. An automatic evaluation system would be used to make sure the confidentiality and neutrality of evaluation. In this paper, proposed an algorithm called Assessment algorithm that uses semantic similarity for evaluation of detailed type answers. It will eradicate the inconsistency in the manual assessment. Also, for preprocessing proposed an algorithm for pruning and stemming which is used to reduce the size of the descriptive type answers. Stemmed words are converted to vectors using the semantic method, Latent Semantic Analysis (LSA). The vectors obtained from the semantic method are clustered using the Self-organizing map. Cosine similarity is used to measure the similarity between two vectors. Based on the value returned by the similarity measure, marks will be awarded. The proposed system will be experienced with detailed type answers written by the student. This method resulted in good precision, improved dependability of results, reduced the time and effort taken by the staff. The time complexity of the proposed algorithm is O (n).","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130532563","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}
引用次数: 6
Community formation based influence node selection for information diffusion in online social network 基于社区形成的在线社交网络信息扩散影响节点选择
P. Kumaran, S. Chitrakala
{"title":"Community formation based influence node selection for information diffusion in online social network","authors":"P. Kumaran, S. Chitrakala","doi":"10.1109/ICCTIDE.2016.7725363","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725363","url":null,"abstract":"Information diffusion is emerged as a recent trend in an online social network. In the process of information diffusion a set of k-random node is to be chosen as an initial influence node from which information to be spreaded across the network. Generally there are two issues identified in the k-random node selection method. First, the random node may not be an influence node. Second, the selection of influence node in complex structure of social network is led the scalability issue. To overcome the above two issues a new method called “Community Formation Based Influence Node Selection” has been introduced. In this method active influence node could be selected since random node selection is not needed and also community formation is helpful to handle huge complex network. In this paper, implementing the above method could help to maximize information diffusion in an online social networks.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129908427","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}
引用次数: 4
Evaluation of the performance analysis in fuzzy queueing theory 模糊排队理论中性能分析的评价
S. Geetha, V. Ramalakshmi, S. Bhuvaneeswari, B. Rameshkumar
{"title":"Evaluation of the performance analysis in fuzzy queueing theory","authors":"S. Geetha, V. Ramalakshmi, S. Bhuvaneeswari, B. Rameshkumar","doi":"10.1109/ICCTIDE.2016.7725348","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725348","url":null,"abstract":"This paper, analyze the parametric performance measures in Poisson arrival and Erlang service time with k phase queuing system the arrival rate and service rate being Triangular fuzzy numbers. Using Zaden Extension principle to estimate the uncertainty associated with the input parameters and triangular membership function. This function has been used to statistical applications to obtained the error performance of the waiting time in the Queue and in the system. The basic idea of M/Ek/1/∞/ FIFO is to transform to a fuzzy queue by applying the - cut approach, since the system performance measures are expressed by membership function rather than by crisp values. A numerical example is included.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128335563","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}
引用次数: 4
Secure communication between wireless medical sensor networks and data servers using paillier and elgamal key cryptosystem 无线医疗传感器网络和数据服务器之间的安全通信,使用paillier和电子密钥密码系统
A. Vasukidevi, M. Jayalakshmi, V. Gomathi
{"title":"Secure communication between wireless medical sensor networks and data servers using paillier and elgamal key cryptosystem","authors":"A. Vasukidevi, M. Jayalakshmi, V. Gomathi","doi":"10.1109/ICCTIDE.2016.7725333","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725333","url":null,"abstract":"A wireless sensor network is used to sense the infected person's body condition and transmits the collected data to the database. The details including temperature, heartbeat, and blood pressure are sensed using appropriate sensors and stored in the servers. The details are encrypted using Paillier and ElGamal key cryptosystems for providing high security. The server is helpful in providing querying service to users. The encrypted data is fetched from the server and decrypted before authentication. To prevent the patient data from the attackers, new protocol is proposed, where the patient details are converted into numerical form. This numerical form is difficult to understand by the attackers. Then the numerical values are sent to servers through secure channels. The patient data are securely distributed by employing the Paillier and ElGamal cryptosystems. This project focuses on secure storage and communication. The secure data will be implemented based on cryptographic principle.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"170 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134259927","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}
引用次数: 2
Features analysis of person re-identification techniques 人物再识别技术的特征分析
E. Poongothai, A. Suruliandi
{"title":"Features analysis of person re-identification techniques","authors":"E. Poongothai, A. Suruliandi","doi":"10.1109/ICCTIDE.2016.7725330","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725330","url":null,"abstract":"Person re-identification across different surveillance cameras has become one of the recent and challenging task in the area of intelligent video surveillance system. Although many methods have been introduced for re-identification, certain issues like illumination, pose variation and occlusion are unsolved. In all the existing methods, features are extracted from the image using various learning methods. The aim of this work is to analyze the importance of feature for re-identification. The colour, texture and shape features has taken for the analysis. The database images are collected from multiple benchmark databases. The analysis shows that every feature has some unique properties and works better for some issues.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130856533","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}
引用次数: 3
Fragmented query parse tree based SQL injection detection system for web applications 基于碎片查询解析树的web应用SQL注入检测系统
B. Deva Priyaa, M. Devi
{"title":"Fragmented query parse tree based SQL injection detection system for web applications","authors":"B. Deva Priyaa, M. Devi","doi":"10.1109/ICCTIDE.2016.7725367","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725367","url":null,"abstract":"Increasing use of database driven web applications every day causes attacks on those web applications are also increasing. The common web application attack is SQL Injection attack or code injection or insertion of SQL query via input data from the client to the application. There are many detection techniques focused on the SQL structure at the application level are available. Those techniques failed to detect some of the attacks at the database level. Many existing approaches were proposed to detect the attack at the database level. The existing approach uses SVM classification for classification, which is the supervised learning algorithm, uses the syntactic and semantic features of the query parse tree. It takes more time for preprocessing of the query parse tree. In this paper, we fragmented the query parse tree to increase the speed of the preprocessing. The internal query tree can be obtained from the database log. To get instances for classification, the query tree is converted to n - dimensional feature vector by using multi - dimensional sequence. The semantic features are used as the component of feature vectors. And also the syntactic and semantic features are used to generate multi - dimensional sequences. Then the extracted feature is converted into a numeric value, if the feature contains any string value. Experimental results show that the proposed approach is more accurate and fast in detecting the attacks than existing approaches.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130938043","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}
引用次数: 6
Data collection using score based load balancing algorithm in wireless sensor networks 基于分数的无线传感器网络负载均衡算法的数据采集
Vaishali S. Gattani, S. M. Haider Jafri
{"title":"Data collection using score based load balancing algorithm in wireless sensor networks","authors":"Vaishali S. Gattani, S. M. Haider Jafri","doi":"10.1109/ICCTIDE.2016.7725323","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725323","url":null,"abstract":"In wireless sensor network data collection is always a big problem, collection should be power efficient, which increase the life of the sensor. The sensor nodes which are distant from the base station take more energy and die early. To improve life of network, the score based load balancing algorithm is proposed. The sensor nodes transfer the data to the cluster head using score based load balancing algorithm. The load of a node will balance using lowest score node among the sensor node and cluster head. Cluster head compress data from the cluster nodes and forward the compressed data towards sink node. The compression on a cluster head will reduce the number of transmissions.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442223","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}
引用次数: 17
Allergy information ontology for enlightening people 过敏信息本体,为人们提供启示
A. Velmurugan, T. Ravi
{"title":"Allergy information ontology for enlightening people","authors":"A. Velmurugan, T. Ravi","doi":"10.1109/ICCTIDE.2016.7725329","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725329","url":null,"abstract":"Allergy is a rare disease in less than a half century. But today, it has become a major health issue among people. It affects the lives of probably close to one million worldwide. In India, rough estimates indicate a prevalence of between 10 percentages and 15 percentages in 5-11 year old children. In order to attain consistent results on prevention, there is the need to give more importance to research on allergy. The objective of this article is to describe the current understanding of allergy among people, the complete information about allergy by developing allergy information ontology. It leads to improving people's education on allergy to prevent allergy diseases. Because, allergy is spontaneous and it can occur anytime during the year or last year around. This allergy ontology is constructed through protégé to accomplish the system properly and to attain effective results. It covers most salient classes and their properties and restrictions to represent domain knowledge. At the end of this paper, HermiT reasoner was used to check inconsistency and SPARQL queries used to obtain required information.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"51 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132070213","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}
引用次数: 8
An intelligent similarity measure for effective text document clustering 一种用于有效文本文档聚类的智能相似度度量
M. Aishwarya, K. Selvi
{"title":"An intelligent similarity measure for effective text document clustering","authors":"M. Aishwarya, K. Selvi","doi":"10.1109/ICCTIDE.2016.7725342","DOIUrl":"https://doi.org/10.1109/ICCTIDE.2016.7725342","url":null,"abstract":"In many applications, continuous use of multiple queries has become the focal point of many researches. Various evaluations on document clustering methods reveal the need for effective methodology to capture the actual requirement of the user from the web browsers. An intelligent similarity measure with the concept of Neural Network algorithm has been proposed. Experiments show that application of Echo State Neural Network and Radial Basis Function to the training data set gives better clustering of text documents based on the stored weights in order to avoiding retrieval of irrelevant documents.","PeriodicalId":159789,"journal":{"name":"2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE'16)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132329460","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书