International Conference on Compute and Data Analysis最新文献

筛选
英文 中文
Comparative Analysis of Cross-Platform Communication Mechanisms 跨平台通信机制的比较分析
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193083
L. Atencio, Bruno Aybar, Alfredo Barrientos Padilla
{"title":"Comparative Analysis of Cross-Platform Communication Mechanisms","authors":"L. Atencio, Bruno Aybar, Alfredo Barrientos Padilla","doi":"10.1145/3193077.3193083","DOIUrl":"https://doi.org/10.1145/3193077.3193083","url":null,"abstract":"The present research aims to compare the different technologies that allow real-time communication between Android and iOS devices. We conducted a measurement-driven experiment to test the performance of each technology under different scenarios. We determine their functionality according to the environment for which they have been developed, showing competent information about their capabilities based on the communication channel they use, and their performance measured in milliseconds. The final results allow mobile application developers to determine which technologies suits them the best, based on the specific context of their projects.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125514185","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
Spatio-Temporal Recurrent Convolutional Networks for Citywide Short-term Crowd Flows Prediction 城市短期人群流量预测的时空递归卷积网络
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193082
Wenwei Jin, Youfang Lin, Zhihao Wu, Huaiyu Wan
{"title":"Spatio-Temporal Recurrent Convolutional Networks for Citywide Short-term Crowd Flows Prediction","authors":"Wenwei Jin, Youfang Lin, Zhihao Wu, Huaiyu Wan","doi":"10.1145/3193077.3193082","DOIUrl":"https://doi.org/10.1145/3193077.3193082","url":null,"abstract":"With the rapid development of urban traffic, forecasting the flows of crowd plays an increasingly important role in traffic management and public safety. However, it is very challenging as it is affected by many complex factors, including spatio-temporal dependencies of regions and other external factors such as weather and holiday. In this paper, we proposed a deep-learning-based approach, named STRCNs, to forecast both inflow and outflow of crowds in every region of a city. STRCNs combines Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) network structures to capture spatio-temporal dependencies, simultaneously. More particularly, our model can be decomposed into four components: Closeness captures the changes of instantaneous flows; Daily influence detects the changes of daily influence flows regularly; Weekly influence reacts weekly patterns of influence flows and External influence gets the influence of external factors. For the first three properties (Closeness, Daily influence and Weekly influence), we give a branch of recurrent convolutional network units to learn both spatial and temporal dependencies in crowd flows. External factors are fed into a two-layers fully connected neural network. STRCNs assigns different weights to different branches, and then merges the outputs of the four parts together. Experimental results on two data sets (MobileBJ and TaxiBJ) demonstrate that STRCNs outperforms classical time series and other deep-learning-based prediction methods.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123001573","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}
引用次数: 52
A Fast Algorithm Based on Apriori Algorithms to Explore the Set of Repetitive Items of Large Transaction Data 基于Apriori算法的大交易数据重复项集快速挖掘算法
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193089
Javad Ghofrani, Arezoo Bozorgmehr, Amir Panah
{"title":"A Fast Algorithm Based on Apriori Algorithms to Explore the Set of Repetitive Items of Large Transaction Data","authors":"Javad Ghofrani, Arezoo Bozorgmehr, Amir Panah","doi":"10.1145/3193077.3193089","DOIUrl":"https://doi.org/10.1145/3193077.3193089","url":null,"abstract":"Parallel data mining is utilized to improve the performance of analyzing large databases within a reasonable time frame. Exploring associative rules is an important task in data mining with various practical applications that can be used to explore knowledge in the form of a set of repetitive items or associative rules. Parallel algorithms divide the data superficially and then using different distribution approach, like data distribution, candidate and numerical candidate distribution, extract the set of repetitive items, and ultimately explore strong association laws.\u0000 In this paper, a parallel algorithm is proposed to explore the collection of repetitive items from big and dense transaction databases. In this algorithm, the numerical candidate distribution together with the using of two processes at each level of parallel processing increases the speed of extraction of data patterns. Two steps, extracting the repetitive items, which include generating a set of candidate counts, and computing a set of repetitive items, are performed simultaneously using both processes at each level.\u0000 The proposed algorithm by us is compared in terms of runtime and accelerated with basic Apriori algorithms and numerical distribution on four datasets. Experimental results prove that the proposed algorithm has better optimization in terms of maximizing the performance and has better run time than the two other algorithms for transactional data in different scales and dense data.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133793869","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 Qualitative Investigation of Landmarks in Software Code Navigation 软件代码导航中路标的定性研究
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193091
S. Reddivari, Tanmay Bhowmik
{"title":"A Qualitative Investigation of Landmarks in Software Code Navigation","authors":"S. Reddivari, Tanmay Bhowmik","doi":"10.1145/3193077.3193091","DOIUrl":"https://doi.org/10.1145/3193077.3193091","url":null,"abstract":"A large body of research is available on software clustering and many tools have been developed to assist software programmers to navigate and easily comprehend large software systems. However, minimal attention has been paid to the area of visual clustering to support code navigation. In this paper, we leverage clustering-based visualization to explore static-dependency-based landmarks present in the code base. Landmarks are important legibility features that developers use as reference points. Our qualitative investigation of a java project reveals developers' reliance on the landmarks during code navigation and shows the promise of using static dependencies to uncover the landmarks in the software space.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127733607","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
An Empirical Study on Detecting Deception and Cybercrime Using Artificial Neural Networks 基于人工神经网络的欺骗与网络犯罪检测实证研究
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193080
Alex V. Mbaziira, Diane R. Murphy
{"title":"An Empirical Study on Detecting Deception and Cybercrime Using Artificial Neural Networks","authors":"Alex V. Mbaziira, Diane R. Murphy","doi":"10.1145/3193077.3193080","DOIUrl":"https://doi.org/10.1145/3193077.3193080","url":null,"abstract":"Ubiquity of the Internet and wide adoption of the computing and mobile devices is driving explosion of data. Interestingly, cybercriminals are also leveraging these popular technologies to cash in on cybercrime in form of scams, fraud and fake online reviews. Existing content filtering techniques, which have been successful in containing spam, are failing to filter these new types of cybercrime because cybercriminals generate text messages to bypass content filters. In this paper, we use natural language processing and a deception-detection discourse to build hybrid models for detecting these forms of text-based cybercrime. Since we have four datasets each of which contains deceptive text messages representing a specific type of cybercrime and truthful text messages, we combine 2 datasets and 3 datasets together to generate training sets for the hybrid models with more than one type of cybercrime. The hybrid cybercrime detection models are trained using Artificial Neural Networks (ANN), Naïve Bayes (NB), Support Vector Machines (SVM) and kth Nearest Neighbor (kNN). The models are then evaluated on test sets containing instances that were not part of the training sets. The results for model performance of NB, kNN and SVM classifiers are compared against those of ANN. Most the models generalize well in detecting cybercrime. ANN model performance on the test sets ranges from 70% to 90% accuracy compared to model performance range of 60% to 80% for the other three classifiers. The best performance is in detecting unfavorable fake reviews and fraud.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134443405","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
Analyze and Predict Student Dropout from Online Programs 分析和预测学生从网上课程退学
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193090
Kyehong Kang, Sujing Wang
{"title":"Analyze and Predict Student Dropout from Online Programs","authors":"Kyehong Kang, Sujing Wang","doi":"10.1145/3193077.3193090","DOIUrl":"https://doi.org/10.1145/3193077.3193090","url":null,"abstract":"Increasing student retention rates in higher education is an important goal because of its pertinence to the institution's core mission and its financial well-being. However, the consistent low graduation rates during the past half-century demonstrate the persistence of this challenge. Online programs in higher educations are generally afflicted with even lower retention rates than on-campus programs. With increasing availability of institutional data in the past decade, we can apply data mining approaches to analyze those data to help with the retention problems. In the context of retaining more students in online programs, we develop an educational data mining framework to analyze the institutional data and predict the potential students who might leave online programs before the new term begins. Our goal of this project is to provide our administrators, instructors, and staff members an opportunity to take actions to intervene in the students' dropout process before it takes place to improve the online program retention rate. The performance evaluations of the proposed predictive models are discussed. Performance comparison with other methods in the literature is conducted as well. The outcome of this project has been adopted by our institution to increase the retention rate for distance education.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123427707","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
Automated Mining of Approximate Periodicity on Numeric Data: A Statistical Approach 数值数据近似周期性的自动挖掘:一种统计方法
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3194509
Ran He, Sen Yang, Jingyuan Yang, Jin Cao
{"title":"Automated Mining of Approximate Periodicity on Numeric Data: A Statistical Approach","authors":"Ran He, Sen Yang, Jingyuan Yang, Jin Cao","doi":"10.1145/3193077.3194509","DOIUrl":"https://doi.org/10.1145/3193077.3194509","url":null,"abstract":"As an active subfield of Automated Machine Learning, automated structural analysis focuses on extracting the structural information, such as periodicity, from the data automatically, enabling automated data cleaning and feature extraction. Little research, however, has been done on the periodicity mining from numeric data that contain noises and missing points. In this paper, we present a practical and innovative framework to close this gap. To validate our approach, we carry out detailed simulation studies and real data analyses. The experimental results show that our framework is more robust to data granularity with better accuracy and computational efficiency when comparing with baseline methods. Moreover, the results imply that our proposed method is insensitive to data jitters, noise points and missing signal points.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125032769","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
Overlapping Community Detection by Node-Weighting 基于节点加权的重叠社区检测
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193086
Xiangtao Chen, Juan Li
{"title":"Overlapping Community Detection by Node-Weighting","authors":"Xiangtao Chen, Juan Li","doi":"10.1145/3193077.3193086","DOIUrl":"https://doi.org/10.1145/3193077.3193086","url":null,"abstract":"Community detection is an important task with great practical value for understanding the structure and function of complex networks. However, in many social networks, a node may belong to more than one community. Thus, the detection of overlapping community is more significant. The local expansion algorithm using seeds to find overlapping communities is becoming increasingly popular, but how to choose suitable seeds and expand the local communities effectively is still a great challenge. In this paper, we propose a new overlapping community detection algorithm based on node-weighting (OCDNW). The main idea of the algorithm is to find a good seed and then greedily expand it based on an improved community quality metric. Finally it optimizes the community structure to ensure the quality of community partitioning. Experimental results on synthetic and real world networks prove that the proposed algorithm can detect overlapping communities successfully and outperform other state-of-the-art methods.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116167965","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
A Non-Algorithmic Forensic Approach for Hiding Data in Image Files 图像文件中隐藏数据的非算法取证方法
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193087
M. Sabir, James H. Jones, Hang Liu, Alex V. Mbaziira
{"title":"A Non-Algorithmic Forensic Approach for Hiding Data in Image Files","authors":"M. Sabir, James H. Jones, Hang Liu, Alex V. Mbaziira","doi":"10.1145/3193077.3193087","DOIUrl":"https://doi.org/10.1145/3193077.3193087","url":null,"abstract":"Digital evidence continues to be an integral component in investigative and judicial processes. In digital files, information is stored in structured containers to enable software applications to process and render it for use. In this work, we extend prior research into non-algorithmic approaches to data hiding in files whose structural and physical properties are based on Office Extensible Markup Language (OOXML) by extending and applying our approach to digital image files. The file structure and properties of digital images is inherently different from OOXML files. In this paper, we propose a technique for creating persistent, stealthy, and benign tagging data in digital files. Our approach differs from current steganographic and cryptographic methods because we use a black box approach to find patterns of candidate file locations for inserting our digital tagging data. The results in this paper demonstrate that it is possible to empirically find locations suitable for storing data without knowledge of the files' internal structure, and to essentially hide persistent and benign tagging data in JPEG files. We observed that 31% of the inserted tagging data survives when our test image files are modified and saved or when opened and saved without modifying. Additional experiments revealed that hidden data in identified locations persists when operations like opening, closing, terminating, copying are performed on the image files.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116045741","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
Identifying and Categorising Profane Words in Hate Speech 仇恨言论中亵渎词的识别和分类
International Conference on Compute and Data Analysis Pub Date : 2018-03-23 DOI: 10.1145/3193077.3193078
P. Teh, Chi-Bin Cheng, Weng Mun Chee
{"title":"Identifying and Categorising Profane Words in Hate Speech","authors":"P. Teh, Chi-Bin Cheng, Weng Mun Chee","doi":"10.1145/3193077.3193078","DOIUrl":"https://doi.org/10.1145/3193077.3193078","url":null,"abstract":"This study attempts to explore the different types of Hate Speech appearing in social media by identifying profane words used in hate speech. This study also compares the profane words used in different generations to assist in identifying the user's profile. Five-hundred (500) comments posted on YouTube on the abusive topics were collected. Profane words are classified into eight different types of hate speech. The finding shows 35% of profane words found in our sample are words related to sexual orientation. Comparison of the terms between 1970 and 2017 also show a high percentage of profane words are sexual orientation. Though the results are found based on only 500 comments collected from YouTube link in the current study, they are useful in establishing the list of profane words which will serve as the base for automatic hate speech identification in our future study. The originality of this research is the development of a training list of profane words for each category and comparison of the type of the words used in 1970 century with today's social media platform.","PeriodicalId":343224,"journal":{"name":"International Conference on Compute and Data Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130402689","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}
引用次数: 28
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学术官方微信
小红书