2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)最新文献

筛选
英文 中文
Extended Methods to Handle Classification Biases 处理分类偏差的扩展方法
Emma Beauxis-Aussalet, L. Hardman
{"title":"Extended Methods to Handle Classification Biases","authors":"Emma Beauxis-Aussalet, L. Hardman","doi":"10.1109/DSAA.2017.52","DOIUrl":"https://doi.org/10.1109/DSAA.2017.52","url":null,"abstract":"Classifiers can provide counts of items per class, but systematic classification errors yield biases (e.g., if a class is often misclassified as another, its size may be under-estimated). To handle classification biases, the statistics and epidemiology domains devised methods for estimating unbiased class sizes (or class probabilities) without identifying which individual items are misclassified. These bias correction methods are applicable to machine learning classifiers, but in some cases yield high result variance and increased biases. We present the applicability and drawbacks of existing methods and extend them with three novel methods. Our Sample-to-Sample method provides accurate confidence intervals for the bias correction results. Our Maximum Determinant method predicts which classifier yields the least result variance. Our Ratio-to-TP method details the error decomposition in classifier outputs (i.e., how many items classified as class C_y truly belong to C_x, for all possible classes) and has properties of interest for applying the Maximum Determinant method. Our methods are demonstrated empirically, and we discuss the need for establishing theory and guidelines for choosing the methods and classifier to apply.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783860","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}
引用次数: 7
Discovering Community Structure in Multilayer Networks 发现多层网络中的社区结构
Soumajit Pramanik, Raphael Tackx, Anchit Navelkar, Jean-Loup Guillaume, Bivas Mitra
{"title":"Discovering Community Structure in Multilayer Networks","authors":"Soumajit Pramanik, Raphael Tackx, Anchit Navelkar, Jean-Loup Guillaume, Bivas Mitra","doi":"10.1109/DSAA.2017.71","DOIUrl":"https://doi.org/10.1109/DSAA.2017.71","url":null,"abstract":"Community detection in single layer, isolated networks has been extensively studied in the past decade. However, many real-world systems can be naturally conceptualized as multilayer networks which embed multiple types of nodes and relations. In this paper, we propose algorithm for detecting communities in multilayer networks. The crux of the algorithm is based on the multilayer modularity index Q_M, developed in this paper. The proposed algorithm is parameter-free, scalable and adaptable to complex network structures. More importantly, it can simultaneously detect communities consisting of only single type, as well as multiple types of nodes (and edges). We develop a methodology to create synthetic networks with benchmark multilayer communities. We evaluate the performance of the proposed community detection algorithm both in the controlled environment (with synthetic benchmark communities) and on the empirical datasets (Yelp and Meetup datasets); in both cases, the proposed algorithm outperforms the competing state-of-the-art algorithms.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126037758","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}
引用次数: 19
Predictive Classification of Water Consumption Time Series Using Non-homogeneous Markov Models 用水时间序列的非齐次马尔可夫模型预测分类
Milad Leyli-Abadi, A. Samé, L. Oukhellou, Nicolas Cheifetz, Pierre Mandel, C. Féliers, O. Chesneau
{"title":"Predictive Classification of Water Consumption Time Series Using Non-homogeneous Markov Models","authors":"Milad Leyli-Abadi, A. Samé, L. Oukhellou, Nicolas Cheifetz, Pierre Mandel, C. Féliers, O. Chesneau","doi":"10.1109/DSAA.2017.32","DOIUrl":"https://doi.org/10.1109/DSAA.2017.32","url":null,"abstract":"The analysis of time series data issued from smart meters has been studied relatively extensively in the electricity domain. Meanwhile, analysis of medium resolution water consumption data collected via smart meters has become possible recently, and the research has tried to develop statistical and machine learning tools in order to respond to different requirements of the domain, e.g., better understanding of water consumption behaviors and prediction of consumption. In the present paper, we propose a new predictive approach based on Non-homogeneous Markov Models in order to learn the dynamics of water consumption behavior and be able to predict future consumption behaviors with a daily time-step based on different relevant exogenous covariates. The data used for this purpose are categorical time series, where each series corresponds to a smart meter and each category corresponds to a specific daily consumption behavior. The experiments are performed on a real data set provided by a water utility in France. Prediction results obtained with the proposed model are compared to those provided by two models, namely, the state independent model and homogeneous Markov model. This predictive classification can be helpful for water utilities in order to better manage the water resources and respond to consumer requirements.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133835134","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}
引用次数: 21
A Study of Stochastic Mixed Membership Models for Link Prediction in Social Networks 社会网络中链接预测的随机混合隶属度模型研究
A. Dulac, Éric Gaussier, C. Largeron
{"title":"A Study of Stochastic Mixed Membership Models for Link Prediction in Social Networks","authors":"A. Dulac, Éric Gaussier, C. Largeron","doi":"10.1109/DSAA.2017.58","DOIUrl":"https://doi.org/10.1109/DSAA.2017.58","url":null,"abstract":"We assess here whether standard stochastic mixed membership models are adapted for link prediction in social networks by studying how they handle homophily and preferential attachment. According to the homophily hypothesis, two vertices are more likely to be connected if they share common characteristics whereas preferential attachment states that a vertex prefers to join the more connected nodes existing in the network. To study these properties, we first introduce formal definitions of these phenomena; we then study how stochastic mixed membership models relate to these definitions. Our theoretical analysis reveals that standard stochastic mixed membership models comply with homophily with the similarity that underlies them. For preferential attachment, the situation is more contrasted: if these models do not comply with global preferential attachment, their compliance to local preferential attachment depends on whether the memberships to latent factors are hard or soft, and in the latter case on whether the underlying latent factor distribution is bursty or not. We illustrate these elements on synthetic and real networks by using the generative properties of Bayesian model.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130823159","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
Learning Low-Rank Document Embeddings with Weighted Nuclear Norm Regularization 基于加权核范数正则化的低秩文档嵌入学习
Lukas Pfahler, K. Morik, Frederik Elwert, Samira Tabti, Volkhard Krech
{"title":"Learning Low-Rank Document Embeddings with Weighted Nuclear Norm Regularization","authors":"Lukas Pfahler, K. Morik, Frederik Elwert, Samira Tabti, Volkhard Krech","doi":"10.1109/DSAA.2017.46","DOIUrl":"https://doi.org/10.1109/DSAA.2017.46","url":null,"abstract":"Recently, neural embeddings of documents have shown success in various language processing tasks. These lowdimensional and dense feature vectors of text documents capture semantic similarities better than traditional methods. However, the underlying optimization problem is non-convex and usually solved using stochastic gradient descent. Hence solutions are most-likely sub-optimal and not reproducible, as they are the result of a randomized algorithm. We present an alternative formulation for learning lowrank representations based on convex optimization. Instead of explicitly learning low-dimensional features, we compute a lowrank representation implicitly by regularizing full-dimensional solutions. Our approach uses the weighted nuclear norm, a regularizer that penalizes singular values of matrices. We optimize the regularized objective using accelerated proximal gradient descent. We apply the approach to learn embeddings of documents. These embeddings are guaranteed to converge to a global optimum in a deterministic manner. We show that our convex approach outperforms traditional convex approaches in a numerical study. Furthermore we demonstrate that the embeddings are useful for detecting similarities on a standard dataset. Then we apply our approach in an interdisciplinary research project to detect topics in religious online discussions. The topic descriptions obtained from a clustering of embeddings are coherent and insightful. In comparison to existing approaches, they are also reproducible.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127297666","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 Comparative Study of Different Approaches for Tracking Communities in Evolving Social Networks 发展中的社会网络中不同社区跟踪方法的比较研究
Ziwei He, Etienne Gael Tajeuna, Shengrui Wang, M. Bouguessa
{"title":"A Comparative Study of Different Approaches for Tracking Communities in Evolving Social Networks","authors":"Ziwei He, Etienne Gael Tajeuna, Shengrui Wang, M. Bouguessa","doi":"10.1109/DSAA.2017.62","DOIUrl":"https://doi.org/10.1109/DSAA.2017.62","url":null,"abstract":"In real-world social networks, there is an increasing interest in tracking the evolution of groups of users and detecting the various changes they are liable to undergo. Several approaches have been proposed for this. In studying these approaches, we observed that most of them use a two-stage process. In the first stage, they run an algorithm to identify groups of users at each timestamp. In the second stage, a pairwise comparison based on a similarity measure is employed to track groups of users and detect changes they may undergo. While the majority of existing approaches use a two-stage process, they all run different algorithms to identify communities and rely on different similarity measures to track groups of users over time. Noting that the different approaches may perform differently depending on the dynamic social network under investigation, we decided to make a high level survey of some existing tracking approaches and then do a comparative analysis of some of them. In our analysis, we compared the algorithms in two main situations: (1) when groups of users do not overlap and (2) when the groups are overlapping. The study was done on three different testbeds extracted from the DBLP, Autonomous System (AS) and Yelp datasets.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123703244","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}
引用次数: 7
Where are You Going? Next Place Prediction from Twitter 你要去哪里?来自Twitter的下一个位置预测
C. Comito
{"title":"Where are You Going? Next Place Prediction from Twitter","authors":"C. Comito","doi":"10.1109/DSAA.2017.56","DOIUrl":"https://doi.org/10.1109/DSAA.2017.56","url":null,"abstract":"On line social networks (e.g., Facebook, Twitter) allow users to tag their posts with geographical coordinates collected through the GPS interface of smart phones. The time- and geo-coordinates associated with a sequence of tweets manifest the spatial-temporal movements of people in real life. This paper aims to analyze such movements to predict the next location of an individual based on the observations of his mobility behavior over some period of time and the recent locations that he has visited. To this end, we defined a prediction methodology based on a set of spatio-temporal features characterizing locations and movements among them. We then combined the features in a supervised learning approach based on M5 model trees. The experimental results obtained by using a real-world dataset show that the supervised method is effective in predicting the users next places achieving a remarkable accuracy.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116565176","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
Convolutional Neural Networks Based Multi-task Deep Learning for Movie Review Classification 基于卷积神经网络的多任务深度学习电影评论分类
Xuanyi Li, Weimin Wu, H. Su
{"title":"Convolutional Neural Networks Based Multi-task Deep Learning for Movie Review Classification","authors":"Xuanyi Li, Weimin Wu, H. Su","doi":"10.1109/DSAA.2017.54","DOIUrl":"https://doi.org/10.1109/DSAA.2017.54","url":null,"abstract":"Deep learning has achieved impressive success in natural language processing. However, most previous models are learned on the specific single tasks, suffering from insufficient training set. Multi-task deep learning can solve this dilemma by sharing the part of parameters, improving generalization. The common multi-task deep learning model consists of the shared layer and the task specific layer. In this paper, we attempt to enhance the performance of shared layer and proposed two variants based on convolutional neural networks. The first model is Agent Model-Direct Concatenate, where each task is assigned with a separate convolutional neural network for extracting the common and task specific features simultaneously. The second model is Agent Model-Gating Concatenation, where the task specific layer could automatically decide the information flow of each element of the output of shared layer. The two networks are trained jointly over three pair-wise groups of movie review data sets. Experiments show the effectiveness of our two networks, inspiring a potential direction for the related research of multi-task deep learning.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129863156","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 Collaborative Filtering-Based Two Stage Model with Item Dependency for Course Recommendation 基于协同过滤的课程推荐项目依赖两阶段模型
Eric L. Lee, Tsung-Ting Kuo, Shou-de Lin
{"title":"A Collaborative Filtering-Based Two Stage Model with Item Dependency for Course Recommendation","authors":"Eric L. Lee, Tsung-Ting Kuo, Shou-de Lin","doi":"10.1109/DSAA.2017.18","DOIUrl":"https://doi.org/10.1109/DSAA.2017.18","url":null,"abstract":"Recommender systems have been studied for decades with numerous promising models been proposed. Among them, Collaborative Filtering (CF) models are arguably the most successful one due to its high accuracy in recommendation and elimination of privacy-concerned personal meta-data from training. This paper extends the usage of CF-based model to the task of course recommendation. We point out several challenges in applying the existing CF-models to build a course recommendation engine, including the lack of rating and meta-data, the imbalance of course registration distribution, and the demand of course dependency modeling. We then propose several ideas to address these challenges. Eventually, we combine a two-stage CF model regularized by course dependency with a graph-based recommender based on course-transition network, to achieve AUC as high as 0.97 with a real-world dataset.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128456617","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
Copula-Based High Dimensional Cross-Market Dependence Modeling 基于copula的高维跨市场依赖模型
Jia Xu, Wei Wei, Longbing Cao
{"title":"Copula-Based High Dimensional Cross-Market Dependence Modeling","authors":"Jia Xu, Wei Wei, Longbing Cao","doi":"10.1109/DSAA.2017.67","DOIUrl":"https://doi.org/10.1109/DSAA.2017.67","url":null,"abstract":"Dependence across multiple financial markets, such as stock and foreign exchange rate markets, is high-dimensional, contains various relationships, and often presents complicated dependence structures and characteristics such as asymmetrical dependence. Modelling such dependence structures is very challenging. Although copula has been demonstrated to be effective in describing dependence between variables in recent studies, building effective dependence structures to address the above complexities significantly challenges existing copula models. In this paper, we propose a new D vine-based model with a bottom up strategy to construct high-dimensional dependence structures. The new modelling outcomes are applied to trade 15 stock market indices and 10 currency rates over 16 years as a case study. Extensive experimental results show that this model and its intrinsic design significantly outperform typical models and industry baselines, as shown by the log-likelihood and Vuong test, and Value at Risk - a widely used industrial benchmark. Our model provides interpretable knowledge and profound insights into the high-dimensional dependence structures across data sources.","PeriodicalId":240627,"journal":{"name":"2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132048155","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}
引用次数: 8
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学术官方微信
小红书