2018 IEEE International Conference on Data Mining Workshops (ICDMW)最新文献

筛选
英文 中文
A Study on Customer Churn of Commercial Banks Based on Learning from Label Proportions 基于标签比例学习的商业银行客户流失研究
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00177
Yue Li, Bo Wang
{"title":"A Study on Customer Churn of Commercial Banks Based on Learning from Label Proportions","authors":"Yue Li, Bo Wang","doi":"10.1109/ICDMW.2018.00177","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00177","url":null,"abstract":"In this paper, we study the problem of predicting customer churn of commercial banks by using the historical transaction data of customers. In churn prediction, an important yet challenging problem is the enormous costs of labeling sample labels. In this paper, we use a learning method to predict customer churn, called learning from label proportions in which the training data is provided in groups and only the proportion of each class in each group is known. In other words, we use only the proportions of the churners in each group to predict the latent customer churn. The proportion information in each group can be estimated by the experience of the commercial bank's customer manager, so it can greatly reduce the costs caused by labeling sample churn labels. In the experimental section, we construct the problems of supervised learning and learning from label proportions respectively. We adopt Logistic Regression (LR) and Support Vector Machine (SVM) for supervised learning and proportion-SVM (Alter - ∝SVM) for learning from label proportions respectively. In addition, we use genetic algorithm to solve the non-convex integer programming problem in the problem of learning from label proportions.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116951231","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
On Using Clustering for the Optimization of Hydrological Simulations 基于聚类的水文模拟优化研究
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00215
E. Azmi
{"title":"On Using Clustering for the Optimization of Hydrological Simulations","authors":"E. Azmi","doi":"10.1109/ICDMW.2018.00215","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00215","url":null,"abstract":"Accurate water-related predictions and decision-making require a simulation of hydrological systems in high spatio-temporal resolution. However, the simulation of such a large-scale dynamical system is compute-intensive, and hence time consuming. One approach to circumvent these issues is to use landscape properties to reduce model redundancies and computation complexities. This work shows an ongoing project that applies existing clustering methods to identify functionally similar model units and runs the model only on representative model units. The proposed approach consists of several steps, in particular the reduction of dimensionality of the hydrological time series, application of clustering methods, choice of cluster representative, and study of the balance between the uncertainty of the simulation output and the computational effort.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116971934","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
AutoClustering: A Feed-Forward Neural Network Based Clustering Algorithm 自动聚类:一种前馈神经网络聚类算法
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00102
M. Kimura
{"title":"AutoClustering: A Feed-Forward Neural Network Based Clustering Algorithm","authors":"M. Kimura","doi":"10.1109/ICDMW.2018.00102","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00102","url":null,"abstract":"Since a clustering process can be regarded as a map of data to cluster labels, it should be natural to employ a deep learning technique, especially a feed-forward neural network, to realize the clustering method. In this study, we discussed a novel clustering method realized only by a feed-forward neural network. Unlike self-organizing maps and growing neural gas networks, the proposed method is compatible with deep learning neural networks. The proposed method has three parts: a map of records to clusters (encoder), a map of clusters to their exemplars (decoder), and a loss function to measure positional closeness between the records and the exemplars. In order to accelerate clustering performance, we proposed an improved activation function at the encoder, which migrates a soft-max function to a max function continuously. Though most of the clustering methods require the number of clusters in advance, the proposed method naturally provides the number of clusters as the number of unique one-hot vectors obtained as a result. We also discussed the existence of local minima of the loss function and their relationship to clusters.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115780624","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
Detecting Outliers in Streaming Time Series Data from ARM Distributed Sensors ARM分布式传感器流时间序列数据异常点检测
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00117
Yuping Lu, J. Kumar, N. Collier, Bhargavi Krishna, M. Langston
{"title":"Detecting Outliers in Streaming Time Series Data from ARM Distributed Sensors","authors":"Yuping Lu, J. Kumar, N. Collier, Bhargavi Krishna, M. Langston","doi":"10.1109/ICDMW.2018.00117","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00117","url":null,"abstract":"The Atmospheric Radiation Measurement (ARM) Data Center at ORNL collects data from a number of permanent and mobile facilities around the globe. The data is then ingested to create high level scientific products. High frequency streaming measurements from sensors and radar instruments at ARM sites require high degree of accuracy to enable rigorous study of atmospheric processes. Outliers in collected data are common due to instrument failure or extreme weather events. Thus, it is critical to identify and flag them. We employed multiple univariate, multivariate and time series techniques for outlier detection methods and studied their effectiveness. First, we examined Pearson correlation coefficient which is used to measure the pairwise correlations between variables. Singular Spectrum Analysis (SSA) was applied to detect outliers by removing the anticipated annual and seasonal cycles from the signal to accentuate anomalies. K-means was applied for multivariate examination of data from collection of sensors to identify any deviation from expected and known patterns and identify abnormal observation. The Pearson correlation coefficient, SSA and K-means methods were later combined together in a framework to detect outliers through a range of checks. We applied the developed method to data from meteorological sensors at ARM Southern Great Plains site and validated against existing database of known data quality issues.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116284964","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
Multidimensional Data Mining Based on Tensor 基于张量的多维数据挖掘
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00164
Ryohei Yokobayashi, T. Miura
{"title":"Multidimensional Data Mining Based on Tensor","authors":"Ryohei Yokobayashi, T. Miura","doi":"10.1109/ICDMW.2018.00164","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00164","url":null,"abstract":"In this paper, we propose a data manipulation method to extract multidimensional association rules in the framework of Tensor Data Model (TDM). By using the TDM, high order data structure and naive description for information retrieval are possible. Among others, we discuss multidimensional association rule mining here. Usually, association rule mining (or extraction of association rules) concerns about co-related transaction records of single predicate, and hard to examine the ones over multiple predicates since it takes heavy time-and space-complexities. Here, several operations specific to multidimensional data mining to reduce amount of description can be modeled by using TDM.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122019867","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
Road Speed Profiling for Upfront Travel Time Estimation 道路速度分析的前期旅行时间估计
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00100
Abhinav Sunderrajan, Jagannadan Varadarajan, Kong-wei Lye
{"title":"Road Speed Profiling for Upfront Travel Time Estimation","authors":"Abhinav Sunderrajan, Jagannadan Varadarajan, Kong-wei Lye","doi":"10.1109/ICDMW.2018.00100","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00100","url":null,"abstract":"Accurate travel time estimation is crucial for several service based industries such as ride hailing, food delivery, logistics etc. Promises made to the passengers in terms of cab allocation, waiting times and food delivery times need to be kept to avoid passenger churn given the number of competing start-ups in these sectors. Further, travel times impact the cost of the cab rides and delivery charges which are shown upfront to the passengers and drivers. Trip time estimations must thus be very accurate to avoid both passenger and driver disenchantment. In this paper we present a solution for accurate upfront TTE based on RSP and a corrective ML model using data from around 9.5 million taxi trips in two (each) mega-cities in S.E Asia.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187578","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
Joint Classification Model of Topic and Polarity: Finding Satisfaction and Dissatisfaction Factors from Airport Service Review 主题与极性联合分类模型:从机场服务评价中寻找满意与不满意因素
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00126
Kosuke Mizufune, Sotaro Katsumata
{"title":"Joint Classification Model of Topic and Polarity: Finding Satisfaction and Dissatisfaction Factors from Airport Service Review","authors":"Kosuke Mizufune, Sotaro Katsumata","doi":"10.1109/ICDMW.2018.00126","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00126","url":null,"abstract":"This paper proposes a model developed based on Latent Dirichlet Allocation (LDA). It incorporates both a document dataset and the polarity of the document, for example, a positive and negative evaluation, as input data. In the empirical analysis, it was applied to international airport user reviews, in which the quality of services is evaluated. The results show that the proposed model can classify reviews into topics as effectively as the original topic model, and that its user evaluation forecasting ability is also good. Furthermore, this study examined the automatic generation of a polarity dictionary by the model.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126389567","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
Collaborative Anomaly Detection on Blockchain from Noisy Sensor Data 基于噪声传感器数据的区块链协同异常检测
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00024
T. Idé
{"title":"Collaborative Anomaly Detection on Blockchain from Noisy Sensor Data","authors":"T. Idé","doi":"10.1109/ICDMW.2018.00024","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00024","url":null,"abstract":"This paper proposes a framework for collaborative anomaly detection on Blockchain. Taking condition-based management of industrial asset as a practical example, we extend the notion of Smart Contract, which has been implicitly assumed to be deterministic, to be able to handle noisy sensor data. By formalizing the task of collaborative anomaly detection as that of multi-task probabilistic dictionary learning, we show that major technical issues of validation, consensus building, and data privacy are naturally addressed within a statistical machine learning algorithm. We envision Blockchain as a platform for collaborative learning rather than just a traceable, immutable, and decentralized data management system, suggesting the direction towards \"Blockchain 3.0\".","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125239887","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
On the Sustainability of Blockchain Funding 关于区块链融资的可持续性
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00020
Bingsheng Zhang, Hamed Balogun
{"title":"On the Sustainability of Blockchain Funding","authors":"Bingsheng Zhang, Hamed Balogun","doi":"10.1109/ICDMW.2018.00020","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00020","url":null,"abstract":"Blockchain technology has pioneered a new consensus approach to building a distributed public ledger globally. A key feature expected from cryptocurrencies and blockchain systems is the absence of a centralized control over the operation process. That is, blockchain solutions should neither rely on \"trusted parties or powerful minority\" for their operations nor introduce such centralisation tendencies into blockchain systems. On the other hand, real-world blockchain systems require steady funding for continuous development and maintenance of the systems. Given that blockchain systems are decentralized systems, their maintenance and developmental funding should also be void of centralization risks. Therefore, secure and \"community-inclusive\" long-term sustainability of funding is critical for the health of blockchain platforms. In this work, for the first time, we provide a systematic exposition of blockchain development funding, planning, manage-ment, and disbursement mechanisms aka \"treasury systems\" (for cryptocurrencies and blockchain systems). Drawing from existing literature, we identify and categorise various treasury models, thereby enabling an exploration of their properties, benefits and drawbacks. Particularly, we perform an evaluation of real-world cryptocurrency treasury system of top cryptocurrencies e.g., Dash governance system, and ZCash Foundation. Finally, we briefly discuss desired properties of decentralised treasury systems and provide suggestions for improvement or alternative solutions to existing systems or implementations.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124394290","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
Attend2trend: Attention Model for Real-Time Detecting and Forecasting of Trending Topics 趋势:趋势话题实时检测和预测的注意力模型
2018 IEEE International Conference on Data Mining Workshops (ICDMW) Pub Date : 2018-11-01 DOI: 10.1109/ICDMW.2018.00222
Ahmed Saleh, A. Scherp
{"title":"Attend2trend: Attention Model for Real-Time Detecting and Forecasting of Trending Topics","authors":"Ahmed Saleh, A. Scherp","doi":"10.1109/ICDMW.2018.00222","DOIUrl":"https://doi.org/10.1109/ICDMW.2018.00222","url":null,"abstract":"Knowing what is increasing in popularity is important to researchers, news organizations, auditors, government entities and more. In particular, knowledge of trending topics provides us with information about what people are attracted to and what they think is noteworthy. Yet detecting trending topics from a set of texts is a difficult task, requiring detectors to learn trending patterns while simultaneously making predictions. In this paper, we propose a deep learning model architecture for the challenging task of trend detection and forecasting. The model architecture aims to learn and attend to the trending values' patterns. Our preliminary results show that our model detects the trending topics with a high accuracy.","PeriodicalId":259600,"journal":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124445455","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
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学术官方微信