2016 Eighth International Conference on Information and Knowledge Technology (IKT)最新文献_第5页

A modified language modeling method for authorship attribution 一种改进的作者归属语言建模方法

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777783

S. Vazirian, M. Zahedi

{"title":"A modified language modeling method for authorship attribution","authors":"S. Vazirian, M. Zahedi","doi":"10.1109/IKT.2016.7777783","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777783","url":null,"abstract":"This paper presents an approach to a closed-class authorship attribution (AA) problem. It is based on language modeling for classification and called modified language modeling. Modified language modeling aims to offer a solution for AA problem by Combinations of both bigram words weighting and Unigram words weighting. It makes the relation between unseen text and training documents clearer with giving extra reward of training documents; training document including bigram word as well as unigram words. Moreover, IDF value multiplied by related word probability has been used, instead of removing stop words which are provided by Stop words list. we evaluate Experimental results by four approaches; unigram, bigram, trigram and modified language modeling by using two Persian poem corpora as WMPR-AA2016-A Dataset and WMPR-AA2016-B Dataset. Results show that modified language modeling attributes authors better than other approaches. The result on WMPR-AA2016-B, which is bigger dataset, is much better than another dataset for all approaches. This may indicate that if adequate data is provided to train language modeling the modified language modeling can be a good solution to AA problem.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115180817","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

Minimum spanning forest based approach for spatial-spectral hyperspectral images classification 基于最小生成森林的空间光谱高光谱图像分类方法

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777749

F. Poorahangaryan, H. Ghassemian

{"title":"Minimum spanning forest based approach for spatial-spectral hyperspectral images classification","authors":"F. Poorahangaryan, H. Ghassemian","doi":"10.1109/IKT.2016.7777749","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777749","url":null,"abstract":"In this paper, a new method for hyperspectral images classification is proposed. In particular, the notion of region-scale minimum spanning forest (RS-MSF) is introduced. In proposed scheme, hyperspectral pixels are first smoothed by the edge preserving filter and then RS-MSF is constructed. For building a RS-MSF, at first, a pre-segmentation is done by watershed, in order to divide the image into a lot of small regions. These regions will be considered as the nodes of regions of RS-MSF, instead of image pixels. “Nm” regions are randomly selected as markers. On the other hand, pixel-wise classification is performed for label assignment to selected markers. Then From this process, marker map is generated for the construction of MSF. The proposed method is tested on two different data sets of hyperspectral airborne images with different resolutions and contexts. The influences of the number of markers and parameters of filter are investigated in experiments. The performance of the proposed method is compared to those of several classification techniques (both pixel-wise and MSF based spectral-spatial method) using standard quantitative criteria and visual qualitative evaluation.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"70 11-12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131791646","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}

引用次数: 1

A feature weighting based artificial bee colony algorithm for data clustering 基于特征加权的人工蜂群数据聚类算法

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777752

Manijeh Reisi, P. Moradi, Alireza Abdollahpouri

引用次数: 5

An overview on text coherence methods 语篇连贯方法综述

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777794

Mohamad Abdolahi, M. Zahedi

引用次数: 3

Multiple human detection in images based on differential evolution and HOG-LBP 基于差分进化和HOG-LBP的图像多人检测

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777779

Zohreh Ahmadipour, Mahlagha Afrasiabi, Hassan Khotanlou

引用次数: 3

A clustering approach to schedule workflows to run on the cloud 安排工作流在云上运行的集群方法

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777750

A. Deldari, Mahmoud Naghibzadeh, Amin Rezaeian, H. Abrishami

{"title":"A clustering approach to schedule workflows to run on the cloud","authors":"A. Deldari, Mahmoud Naghibzadeh, Amin Rezaeian, H. Abrishami","doi":"10.1109/IKT.2016.7777750","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777750","url":null,"abstract":"Scientific workflows can be considered a useful modeling method to model different scientific applications. Service-oriented computing is an attractive platform for most users to execute these applications in a pay-as-you-go manner. Therefore, scheduling workflows on the cloud as the latest trend in service-oriented computing and meeting the required users' Quality of Service requirements is an important problem to be tackled. Furthermore, the scheduling algorithms must consider the available multicore processing resources on the commercial Infrastructure as a Service cloud. Hence, considering multicore resources in addition to Quality of Service constraints makes the workflow scheduling problem more challenging to be solved. In this research, a static workflow scheduling algorithm is proposed which considers the available multicore resources on the cloud and attempts to minimize the leasing costs of the processing resources while considering not violating a user-defined deadline. The proposed algorithm uses a clustering technique to divide the workflow into a number of clusters and attempts to combine the clusters in such a way to achieve the algorithms' main goals. A flexible and extendable scoring approach chooses the best combination available in each step. Extensive simulations reveal a great reduction in the leasing costs of the workflow execution while meeting the user-defined deadline.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131862052","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

A fast algorithm for overlapping community detection 一种快速的重叠社团检测算法

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777771

Mostafa Elyasi, M. Meybodi, Alireza Rezvanian, M. Haeri

{"title":"A fast algorithm for overlapping community detection","authors":"Mostafa Elyasi, M. Meybodi, Alireza Rezvanian, M. Haeri","doi":"10.1109/IKT.2016.7777771","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777771","url":null,"abstract":"Nowadays, the emergence of online social networks have empowered people to easily share information and media with friends. Interacting users of social networks with similar users and their friends form community structures of networks. Uncovering communities of the online users in social networks plays an important role in network analysis with many applications such as finding a set of expert users, finding a set of users with common activities, finding a set of similar people for marketing goals, to mention a few. Although, several algorithms for disjoint community detection have been presented in the literature, online users simultaneously interact with their friends having different interests. Also users are able to join more than one group at the same time which leads to the formation of overlapping communities. Thus, finding overlapping communities can realize a realistic analysis of networks. In this paper, we propose a fast algorithm for overlapping community detection. In the proposed algorithm, in the first phase, the Louvain method is applied to the given network and in the second phase a belonging matrix is updated where an each element of belonging matrix determines how much a node belongs to a community. Finally, some of the found communities are merged based on the modularity measure. The performance of the proposed algorithm is studied through the simulation on the popular networks which indicates that the proposed algorithm outperforms several well-known overlapping community detection algorithms.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126818969","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}

引用次数: 9

Robust image watermarking algorithm using DCT coefficients relation in YCoCg-R color space 基于ycog - r颜色空间DCT系数关系的鲁棒图像水印算法

2016 Eighth International Conference on Information and Knowledge Technology (IKT) Pub Date : 2016-09-01 DOI: 10.1109/IKT.2016.7777788

Mohammad Moosazadeh, G. Ekbatanifard

{"title":"Robust image watermarking algorithm using DCT coefficients relation in YCoCg-R color space","authors":"Mohammad Moosazadeh, G. Ekbatanifard","doi":"10.1109/IKT.2016.7777788","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777788","url":null,"abstract":"In this paper, a digital image watermarking method in YCoCg-R color space is proposed that uses YCoCg-R color space as a new working environment and coefficients Relation for watermark bits embedding. In the proposed algorithm, in order to pseudo-random selection of the blocks to watermark embedding and spread the distortions of watermarking, the Y channel of the host image is scrambled by Arnold transformation. Then in order to increase security against noise and cutting attacks, every bit of watermark is embedded in three different blocks. So in case of distortion in one block, the two other blocks can be the decision references for the watermark bits correct recognition in this way: a similar position in three different blocks are selected and corresponding coefficient in selected position is compared with DC coefficient in the same block. Then a distance in the amount of (a) is created between these two values based on the corresponding watermark bit. The results of evaluation and comparison with other algorithms show that the proposed method has high resistance against various attacks.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125874637","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}

引用次数: 9