2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献_第7页

A novel hybrid feature selection based on ReliefF and binary dragonfly for high dimensional datasets 基于ReliefF和二进制蜻蜓的高维数据混合特征选择

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965106

Atefe Asadi Karizaki, M. Tavassoli

引用次数: 3

Predicting Execution Time of CUDA Kernels with Unified Memory Capability 具有统一存储能力的CUDA内核的执行时间预测

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964952

Fatemeh Khorshahiyan, S. Shekofteh, Hamid Noori

引用次数: 1

POI Recommendation Based on Heterogeneous Graph Embedding 基于异构图嵌入的POI推荐

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964762

Sima Naderi Mighan, M. Kahani, F. Pourgholamali

{"title":"POI Recommendation Based on Heterogeneous Graph Embedding","authors":"Sima Naderi Mighan, M. Kahani, F. Pourgholamali","doi":"10.1109/ICCKE48569.2019.8964762","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964762","url":null,"abstract":"With the development and popularity of social networks, many human beings prefer to share their experiences on these networks. There are various methods proposed by the researcher which utilized user-generated content in the location-based social networks (LBSN) and recommend locations to users. However, there is a high sparsity in the user check-in information makes it tough to recommend the appropriate and accurate location to the user. To fix this issue, we put forward a proposal as a framework which utilizes a wide range of information available in these networks, each of which has its own type and provides appropriate recommendation. For this purpose, we encode the information as a number of entities and its attributes in the form of a heterogeneous graph, then graph embedding methods are used to embed all nodes in unified semantic representation space. As a result, we are able to model relations between users and venues in an efficient way and ameliorate the accuracy of the proposed method that recommends a place to a user. Our method is implemented and evaluated using Foursquare dataset, and the evaluation results depict that our work, boost performance in terms of precision, recall, and f-measure compared to the baseline work.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"188-193"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83943320","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

Resource Provisioning in IaaS Clouds; Auto-Scale RAM memory issue IaaS云中的资源配置自动缩放RAM内存问题

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964932

Zolfaghar Salmanian, Habib Izadkhah, A. Isazadeh

引用次数: 0

Recovering Causal Networks based on Windowed Granger Analysis in Multivariate Time Series 基于多变量时间序列窗口格兰杰分析的因果网络恢复

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965099

Ali Gorji Sefidmazgi, M. G. Sefidmazgi

引用次数: 0

Persian Classical Music Instrument Recognition (PCMIR) Using a Novel Persian Music Database 波斯古典乐器识别(PCMIR)使用一个新颖的波斯音乐数据库

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965166

Seyed Muhammad Hossein Mousavi, V. B. Surya Prasath

{"title":"Persian Classical Music Instrument Recognition (PCMIR) Using a Novel Persian Music Database","authors":"Seyed Muhammad Hossein Mousavi, V. B. Surya Prasath","doi":"10.1109/ICCKE48569.2019.8965166","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8965166","url":null,"abstract":"Audio signal classification is an important field in pattern recognition and signal processing. Classification of musical instruments is a branch of audio signal classification and poses unique challenges due to the diversity of available instruments. Automatic expert systems could assist or be used as a replacement for humans. The aim of this work is to classify Persian musical instruments using combination of extracted features from audio signal. We believe such an automatic system to recognize Persian musical instruments could be very useful in an educational context as well as art universities. Features like Mel-Frequency Cepstrum Coefficients (MFCCs), Spectral Roll-off, Spectral Centroid, Zero Crossing Rate and Entropy Energy are employed and work well for this purpose. These features are extracted from audio signals out of our novel database. This database contains audio samples for 7 Persian musical instrument classes: Ney, Tar, Santur, Kamancheh, Tonbak, Ud and Setar. In feature selection part, Fuzzy entropy measure is employed and classification task takes place by Multi-Layer Neural Network (MLNN). It should be mentioned that this research is one of the first researches on Persian musical instrument classification. Validation confusion matrix made of true positive and false negative rates along with true and false observations numbers. Acquired results are so promising and satisfactory.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"47 1","pages":"122-130"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84949928","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 Provably-Secure ECC-based Authentication and Key Management Protocol for Telecare Medical Information Systems 一种新的可证明安全的基于ecc的远程医疗信息系统认证与密钥管理协议

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965036

H. Amintoosi, Mahdi Nikooghadam

{"title":"A Novel Provably-Secure ECC-based Authentication and Key Management Protocol for Telecare Medical Information Systems","authors":"H. Amintoosi, Mahdi Nikooghadam","doi":"10.1109/ICCKE48569.2019.8965036","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8965036","url":null,"abstract":"Telecare medical information systems are becoming more and more popular due to the provision of delivering health services, including remote access to health profiles for doctors, staff, and patients. Since these systems are installed entirely on the Internet, they are faced with different security and privacy threats. So, a significant challenge is the establishment of a secure key agreement and authentication procedure between the medical servers and patients. Recently, an ECC-based authentication and key agreement scheme for telecare medical systems in the smart city has been proposed by Khatoon et.al. In this paper, at first, we descriptively analyze Khatoon et al.’s protocol and demonstrate that it is vulnerable against known-session-specific temporary information attacks and cannot satisfy perfect forward secrecy. Next, we propose a provably secure and efficient authentication and key agreement protocol using Elliptic Curve Cryptography (ECC). We informally analyze the security of the proposed protocol, and prove that it can satisfy perfect forward secrecy and resist known attacks such as user/server impersonation attack. We also simulate and formally analyze the security of the protocol using the Scyther tool. The results show its robustness against different types of attacks.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"5 1","pages":"85-90"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88703120","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

A Levy Flight-based Decomposition Multi-objective Optimization Based on Grey Wolf Optimizer 基于灰狼优化器的Levy飞行分解多目标优化

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965178

Masoumeh Khubroo, S. J. Mousavirad

{"title":"A Levy Flight-based Decomposition Multi-objective Optimization Based on Grey Wolf Optimizer","authors":"Masoumeh Khubroo, S. J. Mousavirad","doi":"10.1109/ICCKE48569.2019.8965178","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8965178","url":null,"abstract":"The goal of an optimization technique is to find the best solution to an optimization problem. In a single-objective problem, the best solution is the optimal value for the objective function, while in a multi-objective problem, the selection of solutions is not a straightforward task because there are several objective functions which are in conflict. There are many diverse applications such as image processing and data mining, which can be formulated as a multi-objective problem. This paper presents a new decomposition-based multi-objective optimization method using the grey wolf optimizer, which transforms the problem into several sub-problems and examines all the sub-problems simultaneously. Our proposed algorithm obtains the Pareto front using a neighborhood relation among the sub-problems. The levy flight distribution has also been used which increases the exploration and exploitation features in the algorithm in order to improve the search ability. The performance of our proposed algorithm is evaluated on UF family of benchmark functions in terms of different metric such as inverted generational distance (IGD), generational distance (GD), hyper-volume (HV), and spacing (SP). The experimental results indicate the superior performance of the proposed method.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"74 1","pages":"155-161"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88346784","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

Automated Mood Based Music Playlist Generation By Clustering The Audio Features 通过聚类音频功能自动生成基于情绪的音乐播放列表

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965190

Mahta Bakhshizadeh, A. Moeini, Mina Latifi, M. Mahmoudi

{"title":"Automated Mood Based Music Playlist Generation By Clustering The Audio Features","authors":"Mahta Bakhshizadeh, A. Moeini, Mina Latifi, M. Mahmoudi","doi":"10.1109/ICCKE48569.2019.8965190","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8965190","url":null,"abstract":"The increase of receiving attention to music recommendation and playlist generation in today’s music industry is undeniable. One of the main goals is to generate personalized playlists automatically for each user. Beyond that, an appropriate switching among these playlists to play the tracks based on the current mood of the user would certainly lead to the development of more advanced and personalized music player apps. In this paper, a data scientific approach is provided to model the music moods which are created by clustering the tracks extracted from users’ listening. Each Cluster consists of music tracks with similar audio features existing in the user’s listening history. Knowing which music track is currently being listened by users, their mood would be specified by determining the cluster of that music. It is presumed that playing the other music tracks contained in the same cluster as the next tracks will enhance their satisfaction. A suggestion for making the results visually interpretable which could help the corresponding music players with GUI design is provided as well. Experimental results of a case study from real datasets collected from Users’ listening history on Last.fm benefiting from Spotify API clarifies the framework along with supporting the mentioned presumption.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"316 1","pages":"231-237"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76143802","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}

引用次数: 5

A Prediction-Based Approach for Computing Robust Rating Scores 一种基于预测的鲁棒评分计算方法

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964992

Mohammad Allahbakhsh, R. Rafat, Fariba Layegh Rafat

{"title":"A Prediction-Based Approach for Computing Robust Rating Scores","authors":"Mohammad Allahbakhsh, R. Rafat, Fariba Layegh Rafat","doi":"10.1109/ICCKE48569.2019.8964992","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964992","url":null,"abstract":"Assessing quality of products, especially when purchased online, is always a challenge. One of the widely used approaches for addressing this challenge is to rely on the scores computed by online rating systems, based on the feedback received from other users. For several reasons, like gaining benefits, personal interests or collusion, rating systems have always been facing with challenge of dishonest feedback. Although many techniques have been proposed for collusion detection, there are still issues that need more investigations. One of these issues is dealing with the sparsity problem, i.e., small number of votes per product, which makes it easier to manipulate scores. In this paper we propose a novel technique for calculating robust rank scores which relies on feedback prediction. In our model, we improve quality of computed scores by predicting feedback, for the people who have not assessed a product. This will result in decreasing sparsity. Then, we propose an iterative technique to calculate product rating scores based on the real and predicted feedbacks. We have implemented our method and compared its performance with three well-known related works. The result of comparison shows the superiority of our model.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"96 1","pages":"116-121"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76986951","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