发布求助
文献互助 智能选刊 最新文献

Int. J. Inf. Technol. Web Eng.最新文献

筛选
英文 中文
An Evolutionary Feature Clustering Approach for Anomaly Detection Using Improved Fuzzy Membership Function: Feature Clustering Approach for Anomaly Detection 基于改进模糊隶属函数的进化特征聚类异常检测方法:基于特征聚类的异常检测方法
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-10-01 DOI: 10.4018/IJITWE.2019100102
G. R. Kumar, G. Narsimha, N. Mangathayaru
{"title":"An Evolutionary Feature Clustering Approach for Anomaly Detection Using Improved Fuzzy Membership Function: Feature Clustering Approach for Anomaly Detection","authors":"G. R. Kumar, G. Narsimha, N. Mangathayaru","doi":"10.4018/IJITWE.2019100102","DOIUrl":"https://doi.org/10.4018/IJITWE.2019100102","url":null,"abstract":"Traditionally, IDS have been developed by applying machine learning techniques and followed single learning mechanisms or multiple learning mechanisms. Dimensionality is an important concern which affects classification accuracies and eventually the classifier performance. Feature selection approaches are widely studied and applied in research literature. In this work, a new fuzzy membership function to detect anomalies and intrusions and a method for dimensionality reduction is proposed. CANN could not address R2L and U2R attacks and have completely failed by showing these attack accuracies almost zero. Following CANN, the CLAPP approach has shown better classifier accuracies when compared to classifiers kNN, and SVM. This research aims at improving the accuracy achieved by CLAPP, CANN, and kNN. Experimental results show accuracies obtained using proposed approach is better when compared to other existing approaches. In particular, the detection of U2R and R2L attacks to user accuracies are recorded to be very much promising.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130340349","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}
引用次数: 14
Time-Based QoS Prediction and Rank Aggregation of Web Services 基于时间的Web服务QoS预测与排名聚合
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-10-01 DOI: 10.4018/IJITWE.2019100105
V. Mareeswari, E. Sathiyamoorthy
{"title":"Time-Based QoS Prediction and Rank Aggregation of Web Services","authors":"V. Mareeswari, E. Sathiyamoorthy","doi":"10.4018/IJITWE.2019100105","DOIUrl":"https://doi.org/10.4018/IJITWE.2019100105","url":null,"abstract":"Everyday activities are equipped with smart intellectual possessions in the modern Internet domain for which a wide range of web services are deployed in business, health-care systems, and environmental solutions. Entire services are accessed through web applications or hand-held computing devices. The recommender system is more prevalent in commercial applications. This research predicts the preference of consumers and lists the recommended services in order of ranking for consumers to choose services in a short time span. This proposed approach aims to offer the exact prediction of missing QoS (quality of service) value of web services at a specified time slice. The uncertainty of QoS value has been predicted using the cloud model theory. The focus is to give the global ranking using the aggregated ranking of the consumer's ranking list, which has been obtained through the Kemeny optimal aggregation algorithm. In this work, multidimensional QoS data of web services have experimented and given an accurate prediction and ranking in the web environment.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131497045","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}
引用次数: 0
Toward a More Robust Home Automated System: Introducing a Voice Activation Technique via Pubnub 迈向更强健的家庭自动化系统:通过Pubnub引入语音激活技术
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-07-01 DOI: 10.4018/IJITWE.2019070105
Segun Aina, S. Okegbile, A. Oluwaranti, Oghenerukome Brenda Okoro, Tayo Obasanya
{"title":"Toward a More Robust Home Automated System: Introducing a Voice Activation Technique via Pubnub","authors":"Segun Aina, S. Okegbile, A. Oluwaranti, Oghenerukome Brenda Okoro, Tayo Obasanya","doi":"10.4018/IJITWE.2019070105","DOIUrl":"https://doi.org/10.4018/IJITWE.2019070105","url":null,"abstract":"The work reported in this article developed a home automated system using voice activation. This is with a view to providing users complete control over electrical appliances using simple easy to remember voice commands on an Android mobile device. This work was implemented using the Atmega 328 microcontroller, Relays and a Wi-Fi shield. The human voice is first converted to text using a Natural language processing tool from the Android based application. Thereafter, the text is sent over the internet via the PubNub to the microcontroller. The Atmega 328 microcontroller was programmed on an Arduino using C programming language and the Android based application was developed using Android Software Development Kit. Results obtained from the testing show that the implemented system achieves the mean scores of 8, 7.6, and 7.2 for ease of use, learnability and effectiveness respectively justifying the fact that the system is capable of controlling appliances by changing their state (ON/OFF) from remote a location with a response time within the reasonable limit.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132229907","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}
引用次数: 0
A Customized Quality Model for Software Quality Assurance in Agile Environment 敏捷环境下软件质量保证的自定义质量模型
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-07-01 DOI: 10.4018/IJITWE.2019070104
Parita Jain, Arun Sharma, Laxmi Ahuja
{"title":"A Customized Quality Model for Software Quality Assurance in Agile Environment","authors":"Parita Jain, Arun Sharma, Laxmi Ahuja","doi":"10.4018/IJITWE.2019070104","DOIUrl":"https://doi.org/10.4018/IJITWE.2019070104","url":null,"abstract":"The agile approach grew dramatically over traditional approaches. The methodology focuses more on rapid development, quick evaluation, quantifiable progress and continuous delivery satisfying the customer desire. In view of this, there is a need for measurement of the agile development process. In this respect, the present research work investigates the inter-relationships and inter-dependencies between the identified quality factors (QF), thereby outlining which of these QF have high driving power and dependence power, working indirectly towards the success of agile development process. This paper proposes a new agile quality model, utilizing an interpretive structural modeling (ISM) approach and the identified factors are classifies using Matriced' Impacts Croise's Multiplication Applique´e a UN Classement (MICMAC) approach. The research findings can significantly impact agile development process by understanding how these QF related to each other and how they can be adopted.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121765135","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}
引用次数: 12
Enhanced Event Detection in Twitter Through Feature Analysis 通过特征分析增强Twitter的事件检测
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-07-01 DOI: 10.4018/IJITWE.2019070101
Dharini Ramachandran, P. Ramasubramanian
{"title":"Enhanced Event Detection in Twitter Through Feature Analysis","authors":"Dharini Ramachandran, P. Ramasubramanian","doi":"10.4018/IJITWE.2019070101","DOIUrl":"https://doi.org/10.4018/IJITWE.2019070101","url":null,"abstract":"The Digital era has the benefits in unearthing a large amount of imperative material. One such digital document is social media data, which when processed can give rise to information which can be helpful to our society. One of the many things that we can unearth from social media is events. Twitter is a very popular microblog that encompasses fruitful and rich information on real world events and popular topics. Event detection in view of situational awareness for crisis response is an important need of the current world. The identification of tweets comprising information that may assist in help and rescue operation is crucial. Most pertinent features for this process of identification are studied and the inferences are given in this article. The efficiency and practicality of the features are discussed here. This article also presents the results of experimentation carried out to assess the most relevant combination of features for improved performance in event detection from Twitter.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129708719","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
Feature Optimization in Sentiment Analysis by Term Co-occurrence Fitness Evolution (TCFE) 基于词共现适应度进化的情感分析特征优化
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-07-01 DOI: 10.4018/IJITWE.2019070102
S. S. Sonawane, S. Kolhe
{"title":"Feature Optimization in Sentiment Analysis by Term Co-occurrence Fitness Evolution (TCFE)","authors":"S. S. Sonawane, S. Kolhe","doi":"10.4018/IJITWE.2019070102","DOIUrl":"https://doi.org/10.4018/IJITWE.2019070102","url":null,"abstract":"The opinion of a target audience is a major objective for the assessing state of efficacy pertaining to reviews, business decisions surveys, and such factors that require decision making. Feature selection turns out to be a critical task for developing robust and high levels of classification while decreasing training time. Models are required for stating the scope for depicting optimal feature selection for escalating feature selection strategies to escalate maximal accuracy in opinion mining. Considering the scope for improvement, an n-gram feature selection approach is proposed where optimal features based on term co-occurrence fitness is proposed in this article. Genetic algorithms focus on determining the evolution and solution to attain deterministic and maximal accuracy having a minimal level of computational process for reflecting on the sentiment scope for sentiment. Evaluations reflect that the proposed solution is capable, which outperforms the separate filter-oriented feature selection models of sentiment classification.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129772571","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
An Adaptive Approach Towards Computation Offloading for Mobile Cloud Computing 移动云计算的自适应计算卸载方法
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-04-01 DOI: 10.4018/IJITWE.2019040104
Archana Kero, Abhirup Khanna, Devendra Kumar, A. Agarwal
{"title":"An Adaptive Approach Towards Computation Offloading for Mobile Cloud Computing","authors":"Archana Kero, Abhirup Khanna, Devendra Kumar, A. Agarwal","doi":"10.4018/IJITWE.2019040104","DOIUrl":"https://doi.org/10.4018/IJITWE.2019040104","url":null,"abstract":"The widespread acceptability of mobile devices in present times have caused their applications to be increasingly rich in terms of the functionalities they provide to the end users. Such applications might be very prevalent among users but the execution results in dissipating many of the device end resources. Mobile cloud computing (MCC) has a solution to this problem by offloading certain parts of the application to cloud. At the first place, one might find computation offloading quite promising in terms of saving device end resources but eventually may result in being the other way around if performed in a static manner. Frequent changes in device end resources and computing environment variables may lead to a reduction in the efficiency of offloading techniques and even cause a drop in the quality of service for applications involving the use of real-time information. In order to overcome this problem, the authors propose an adaptive computation offloading framework for data stream applications wherein applications are partitioned dynamically followed by being offloaded depending upon the device end parameters, network conditions, and cloud resources. The article also talks about the proposed algorithm that depicts the workflow of the offloading model. The proposed model is simulated using the CloudSim simulator. In the end, the authors illustrate the working of the proposed system along with the simulated results.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132729331","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
A Novel Scalable Signature Based Subspace Clustering Approach for Big Data 一种基于可扩展签名的大数据子空间聚类方法
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-04-01 DOI: 10.4018/IJITWE.2019040103
T. Gayathri, D. Bhaskari
{"title":"A Novel Scalable Signature Based Subspace Clustering Approach for Big Data","authors":"T. Gayathri, D. Bhaskari","doi":"10.4018/IJITWE.2019040103","DOIUrl":"https://doi.org/10.4018/IJITWE.2019040103","url":null,"abstract":"“Big data” as the name suggests is a collection of large and complicated data sets which are usually hard to process with on-hand data management tools or other conventional processing applications. A scalable signature based subspace clustering approach is presented in this article that would avoid identification of redundant clusters. Various distance measures are utilized to perform experiments that validate the performance of the proposed algorithm. Also, for the same purpose of validation, the synthetic data sets that are chosen have different dimensions, and their size will be distributed when opened with Weka. The F1 quality measure and the runtime of these synthetic data sets are computed. The performance of the proposed algorithm is compared with other existing clustering algorithms such as CLIQUE.INSCY and SUNCLU.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116841672","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
An Attribute-Based Assured Deletion Scheme in Cloud Computing 云计算中基于属性的保证删除方案
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-04-01 DOI: 10.4018/IJITWE.2019040105
Fangfang Shan, Hui Li, Fenghua Li, Yunchuan Guo, Jinbo Xiong
{"title":"An Attribute-Based Assured Deletion Scheme in Cloud Computing","authors":"Fangfang Shan, Hui Li, Fenghua Li, Yunchuan Guo, Jinbo Xiong","doi":"10.4018/IJITWE.2019040105","DOIUrl":"https://doi.org/10.4018/IJITWE.2019040105","url":null,"abstract":"With the rapid development of cloud computing, it has been increasingly attractive for individuals and groups to store and share data via cloud storage. Once stored in the third-party cloud storage service providers, the privacy and integrity of outsourced data should be attached with more attention as a challenging task. This article presents the attribute-based assured deletion scheme (AADS) which aims to protect and assuredly delete outsourced data in cloud computing. It encrypts outsourced data files with standard cryptographic techniques to guarantee the privacy and integrity, and assuredly deletes data upon revocations of attributes. AADS could be applied to solve important security problems by supporting fine-grained attribute-based policies and their combinations. According to the comparison and analysis, AADS provides efficient data encryption and flexible attribute-based assured deletion for cloud-stored data with an acceptable concession in performance cost.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132669083","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
Scalable l-Diversity: An Extension to Scalable k-Anonymity for Privacy Preserving Big Data Publishing 可扩展的l-多样性:可扩展的k-匿名在隐私保护大数据发布中的扩展
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-04-01 DOI: 10.4018/IJITWE.2019040102
U. P. Rao, Brijesh B. Mehta, Nikhil Kumar
{"title":"Scalable l-Diversity: An Extension to Scalable k-Anonymity for Privacy Preserving Big Data Publishing","authors":"U. P. Rao, Brijesh B. Mehta, Nikhil Kumar","doi":"10.4018/IJITWE.2019040102","DOIUrl":"https://doi.org/10.4018/IJITWE.2019040102","url":null,"abstract":"Privacy preserving data publishing is one of the most demanding research areas in the recent few years. There are more than billions of devices capable to collect the data from various sources. To preserve the privacy while publishing data, algorithms for equivalence class generation and scalable anonymization with k-anonymity and l-diversity using MapReduce programming paradigm are proposed in this article. Equivalence class generation algorithms divide the datasets into equivalence classes for Scalable k-Anonymity (SKA) and Scalable l-Diversity (SLD) separately. These equivalence classes are finally fed to the anonymization algorithm that calculates the Gross Cost Penalty (GCP) for the complete dataset. The value of GCP gives information loss in input dataset after anonymization.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134378508","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学术官方微信