2015 International Conference on Computing and Communications Technologies (ICCCT)最新文献_第8页

Effective data stream mining using ensemble on cloud with load balancing (E2CL) 基于负载平衡(E2CL)的集成云有效数据流挖掘

2015 International Conference on Computing and Communications Technologies (ICCCT) Pub Date : 2015-02-01 DOI: 10.1109/ICCCT2.2015.7292780

Jagadheeswaran Kathirvel, E. Parasuraman

{"title":"Effective data stream mining using ensemble on cloud with load balancing (E2CL)","authors":"Jagadheeswaran Kathirvel, E. Parasuraman","doi":"10.1109/ICCCT2.2015.7292780","DOIUrl":"https://doi.org/10.1109/ICCCT2.2015.7292780","url":null,"abstract":"Data stream is generated everywhere with ever increasing speed. There is a need for efficient stream processing systems and optimal algorithms to mine all items of these streams to accurately predict the knowledge in limited time. In the existing approaches, there are some limitations like one-pass, sampling and load shedding on processing the streams which trade-off in accuracy. There are some approaches which use the distributed computing, grid computing and cloud computing technologies to deal with these challenges. This paper proposes a new approach to reduce the overhead of processing the already processed items. In this approach there will be a central system called model aggregator that will pull the learnt knowledge from all the stream processing systems, combine those knowledge and then will push to all the cloud processing systems in certain time interval. Having this combined knowledge, the participating stream processing systems' overhead is reduced that will increase the availability of the systems to handle the additional streams. Also since the cloud systems can be provisioned in advance or on-demand when the peak streaming occurs, the window dropping can be avoided.","PeriodicalId":410045,"journal":{"name":"2015 International Conference on Computing and Communications Technologies (ICCCT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128101005","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

Efficient scheduling of independent tasks using modified heuristics 使用改进启发式的独立任务高效调度

2015 International Conference on Computing and Communications Technologies (ICCCT) Pub Date : 2015-02-01 DOI: 10.1109/ICCCT2.2015.7292778

M. Atique

{"title":"Efficient scheduling of independent tasks using modified heuristics","authors":"M. Atique","doi":"10.1109/ICCCT2.2015.7292778","DOIUrl":"https://doi.org/10.1109/ICCCT2.2015.7292778","url":null,"abstract":"In heterogeneous computing systems MinMin and MaxMin are widely used in assigning independent tasks to processors. For N tasks to be assigned to N processors these approaches are known to run in O (KN2) time. An algorithmic improvement that asymptotically decreases the running time complexity of MinMin to O(KN logN) without affecting its solution quality is proposed in [1]. The newly proposed MinMin algorithm is combined with MaxMin, resulting in two hybrid algorithms [1]. The first hybrid algorithm address the drawback of MaxMin in solving problem instances with highly skewed cost distributions while also improving the running time performance of MaxMin. The second hybrid algorithm improves the running time performance without degrading its solution quality. The proposed algorithms are easy to implement. For the large datasets used in the various experiments, MinMin and MaxMin, as well as recent state-of-the-art heuristics, require days, weeks, or even months to produce a solution, whereas the proposed algorithms in this paper produce solutions within only two or three minutes. The new modified algorithms namely MinMax and MinMax+ are proposed and implemented. These algorithms are compared with the existing algorithms MinMin and MaxMin on single objective cases.","PeriodicalId":410045,"journal":{"name":"2015 International Conference on Computing and Communications Technologies (ICCCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124338881","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

Identifying deceptive reviews using networking parameters 使用网络参数识别欺骗性评论

2015 International Conference on Computing and Communications Technologies (ICCCT) Pub Date : 2015-02-01 DOI: 10.1109/ICCCT2.2015.7292769

Tanya Gera, Deepak Thakur, Jaiteg Singh

{"title":"Identifying deceptive reviews using networking parameters","authors":"Tanya Gera, Deepak Thakur, Jaiteg Singh","doi":"10.1109/ICCCT2.2015.7292769","DOIUrl":"https://doi.org/10.1109/ICCCT2.2015.7292769","url":null,"abstract":"Nowadays, client likes to take suggestions before spending on a new product. For this they go to online item review Web page for perusing other's encounters and saying for that item. A real issue which was disregarded so far is the investigation of review spammers. However, numerous scientists gave their productive commitment in this field of exploration from 2007. The situation now asks for, conspicuous verification and ID of fake reviews and fake reviewers; as this has transformed into a colossal social issue. Those studies have the limit perceive certain sorts of spammers, e.g., the people who post various practically identical reviews around one target component. In any case, in fact, there are distinctive sorts of spammers who can control their practices to act much the same as certified users. This has transformed into a gigantic social issue. From various years, email spam and Web spam were the two essential highlighted social issues. In the meantime nowadays, on account of reputation of customers' energy to Web shopping and their dependence on the online reviews, it transformed into a true center for review spammers to misdirect customers by making sham overviews for target things. To the best of our insight, very little study is accounted for in regards to this issue reliability of online reviews. To begin with paper was distributed in 2007 by Nitin Jindal & Bing Liu in regards to review Spam detection. In the past few years, variety of techniques has been recommended by researchers to accord with this trouble. This paper intends to identify suspicious review, review spammers and their group using rule based classification methods along with networking parameters.","PeriodicalId":410045,"journal":{"name":"2015 International Conference on Computing and Communications Technologies (ICCCT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133209013","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

Designing a Bio-Capsule secure authentication system 生物胶囊安全认证系统的设计

2015 International Conference on Computing and Communications Technologies (ICCCT) Pub Date : 2015-01-12 DOI: 10.1109/ICCCT2.2015.7292740

R. Logeshwari, K. Karthikayani, A. Sindhuja, D. Ashok

引用次数: 1