{"title":"An OWL Ontology for Supporting Semantic Services in Big Data Platforms","authors":"Domenico Redavid, Roberto Corizzo, D. Malerba","doi":"10.1109/BigDataCongress.2018.00039","DOIUrl":"https://doi.org/10.1109/BigDataCongress.2018.00039","url":null,"abstract":"In the last years, there was a growing interest in the use of Big Data models to support advanced data analysis functionalities. Many companies and organizations lack IT expertise and adequate budget to have benefits from them. In order to fill this gap, a model-based approach for Big Data Analytics-as-a-service (MBDAaaS) can be used. The proposed model, composed by declarative, procedural and deployment (sub) models, can be used to select a deployable set of services based on a set of user preferences shaping a Big Data Campaign (BDC). The deployment of a BDC requires that the selection of services has to be carried out on the basis of coherent and non conflictual user preferences. In this paper we propose an OWL ontology in order to solve this issue.","PeriodicalId":177250,"journal":{"name":"2018 IEEE International Congress on Big Data (BigData Congress)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130030818","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}
{"title":"Categorical Models for BigData","authors":"Laurent Thiry, Heng Zhao, M. Hassenforder","doi":"10.1109/BigDataCongress.2018.00049","DOIUrl":"https://doi.org/10.1109/BigDataCongress.2018.00049","url":null,"abstract":"This paper shows how concepts coming from category theory associated to a functional programming language can help to formalize and reason about data and get efficient programs in a BigData context. More precisely, it shows how data structures can be modeled by functors related by natural transformations (and isomorphisms). The transformation functions can then serve to shift a data structure and then get another program (eventually educing time complexity). The paper then explains the main concepts of the theory, how to apply them and gives an application to a concrete database and the performances obtained.","PeriodicalId":177250,"journal":{"name":"2018 IEEE International Congress on Big Data (BigData Congress)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134403734","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}
{"title":"A Data-Driven Approach to Predict an Individual Customer's Call Arrival in Multichannel Customer Support Centers","authors":"S. Moazeni, Rodrigo Andrade","doi":"10.1109/BigDataCongress.2018.00016","DOIUrl":"https://doi.org/10.1109/BigDataCongress.2018.00016","url":null,"abstract":"The availability of big data collected by multichannel contact centers creates opportunities for businesses to more accurately predict future interactions with their customers. This paper presents a data-driven modeling approach to forecast the likelihood of a call arrival by an individual customer within the next thirty days, based on the multichannel data from contact centers. This model incorporates information related to the past Web activities of an individual customer to predict his future telephone queries. Our study relies on big datasets from contact centers of one of the largest U.S. insurance companies. Various characteristics related to the customer segment, recency and frequency of customer interactions, and cross-class features are considered. We find evidence that some of the recent web activities of a policyholder significantly increases the probability that the policyholder would make a telephone call in the next 30 days. In addition, recency and frequency of contacts impact the probability of the policyholder's call, for a specific set of reasons for past contacts.","PeriodicalId":177250,"journal":{"name":"2018 IEEE International Congress on Big Data (BigData Congress)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128628833","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}
{"title":"Towards Optimal Snapshot Materialization to Support Large Query Workload for Append-Only Temporal Databases","authors":"Amin Beiraimi, K. Pu, Ying Zhu","doi":"10.1109/BigDataCongress.2018.00048","DOIUrl":"https://doi.org/10.1109/BigDataCongress.2018.00048","url":null,"abstract":"We present several results on optimal snapshot materialization for append-only temporal databases in order to support very large scale query workload. Our data model is temporal relational data stored in an append-only database. When the temporal database receives multiple queries querying at different timestamps along the timeline, it would be prohibitively expensive to recompute the snapshots at each of the timestamps. In this paper, we present a practical solution to support large query load by materializing m snapshots at optimal timestamps. We show that optimal snapshot timestamps can be computed efficiently in linear time. We further show that with varying query load, we can dynamically adjust snapshots to adjust to the changin query load.","PeriodicalId":177250,"journal":{"name":"2018 IEEE International Congress on Big Data (BigData Congress)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131163409","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}
{"title":"Estimation of Types of States in Partial Observable Network Systems","authors":"Sayantan Guha","doi":"10.1109/BigDataCongress.2018.00033","DOIUrl":"https://doi.org/10.1109/BigDataCongress.2018.00033","url":null,"abstract":"Estimating of types of states in network systems is essential for protecting network infrastructures from cyberattacks, managing network traffic, and detecting changes in network systems. It is very difficult to estimate the types of states in network systems due to their high complexity. The accuracy of the estimating the states in network systems depends heavily on the completeness of the collected sensor information. But the state of a network system at a given point in time may be never fully known due to noisy sensors; making more difficult to estimate the entire true state of a network system because certain features of the input data may be missing. In order to estimate the states in a network system in partially observable environments, an approach to estimating the types of states in partially observable cyber systems is presented. This approach involves the use of a convolutional neural network (CNN), and unsupervised learning with elbow method and k-means clustering algorithm.","PeriodicalId":177250,"journal":{"name":"2018 IEEE International Congress on Big Data (BigData Congress)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121682030","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}