Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 49) Show all publications
Boman, M., Ben Abdesslem, F., Forsell, E., Gillblad, D., Görnerup, O., Isacsson, N., . . . Kaldo, V. (2019). Learning machines in Internet-delivered psychological treatment. Progress in Artificial Intelligence
Open this publication in new window or tab >>Learning machines in Internet-delivered psychological treatment
Show others...
2019 (English)In: Progress in Artificial Intelligence, ISSN 2192-6352Article in journal (Refereed) Epub ahead of print
Abstract [en]

A learning machine, in the form of a gating network that governs a finite number of different machine learning methods, is described at the conceptual level with examples of concrete prediction subtasks. A historical data set with data from over 5000 patients in Internet-based psychological treatment will be used to equip healthcare staff with decision support for questions pertaining to ongoing and future cases in clinical care for depression, social anxiety, and panic disorder. The organizational knowledge graph is used to inform the weight adjustment of the gating network and for routing subtasks to the different methods employed locally for prediction. The result is an operational model for assisting therapists in their clinical work, about to be subjected to validation in a clinical trial.

Place, publisher, year, edition, pages
Springer Verlag, 2019
Keywords
Ensemble learning, Gating network, Internet-based psychological treatment, Learning machine, Machine learning, Decision support systems, Learning systems, Conceptual levels, Decision supports, Learning machines, Machine learning methods, Operational model, Organizational knowledge, Psychological treatments, Patient treatment
National Category
Natural Sciences
Identifiers
urn:nbn:se:ri:diva-39062 (URN)10.1007/s13748-019-00192-0 (DOI)2-s2.0-85066625908 (Scopus ID)
Available from: 2019-06-26 Created: 2019-06-26 Last updated: 2019-07-31Bibliographically approved
Yanggratoke, R., Ahmed, J., Ardelius, J., Flinta, C., Johnsson, A., Gillblad, D. & Stadler, R. (2018). A service-agnostic method for predicting service metrics in real time. International Journal of Network Management, 28(2), Article ID e1991.
Open this publication in new window or tab >>A service-agnostic method for predicting service metrics in real time
Show others...
2018 (English)In: International Journal of Network Management, ISSN 1055-7148, E-ISSN 1099-1190, Vol. 28, no 2, article id e1991Article in journal (Refereed) Published
Abstract [en]

We predict performance metrics of cloud services using statistical learning, whereby the behaviour of a system is learned from observations. Specifically, we collect device and network statistics from a cloud testbed and apply regression methods to predict, in real-time, client-side service metrics for video streaming and key-value store services. Results from intensive evaluation on our testbed indicate that our method accurately predicts service metrics in real time (mean absolute error below 16% for video frame rate and read latency, for instance). Further, our method is service agnostic in the sense that it takes as input operating systems and network statistics instead of service-specific metrics. We show that feature set reduction significantly improves the prediction accuracy in our case, while simultaneously reducing model computation time. We find that the prediction accuracy decreases when, instead of a single service, both services run on the same testbed simultaneously or when the network quality on the path between the server cluster and the client deteriorates. Finally, we discuss the design and implementation of a real-time analytics engine, which processes streams of device statistics and service metrics from testbed sensors and produces model predictions through online learning. 

Keywords
cloud computing, machine learning, quality of service, real-time network analytics, statistical learning, Forecasting, Learning systems, Regression analysis, Statistics, Testbeds, Video streaming, Design and implementations, Mean absolute error, Network statistics, Performance metrics, Prediction accuracy, Real time network, Real-time analytics, Distributed computer systems
National Category
Natural Sciences
Identifiers
urn:nbn:se:ri:diva-33516 (URN)10.1002/nem.1991 (DOI)2-s2.0-85029351383 (Scopus ID)
Note

Funding details: VINNOVA; Funding details: 2013-03895, VINNOVA; This research has been supported by the Swedish Governmental Agency for Innovation Systems, VINNOVA, under grant 2013-03895.

Available from: 2018-03-23 Created: 2018-03-23 Last updated: 2018-08-17Bibliographically approved
Kreuger, P., Steinert, R., Görnerup, O. & Gillblad, D. (2018). Distributed dynamic load balancing with applications in radio access networks. International Journal of Network Management, 28(2)
Open this publication in new window or tab >>Distributed dynamic load balancing with applications in radio access networks
2018 (English)In: International Journal of Network Management, ISSN 1055-7148, E-ISSN 1099-1190, Vol. 28, no 2Article in journal (Refereed) Published
Abstract [en]

Managing and balancing load in distributed systems remains a challenging problem in resource management, especially in networked systems where scalability concerns favour distributed and dynamic approaches. Distributed methods can also integrate well with centralised control paradigms if they provide high-level usage statistics and control interfaces for supporting and deploying centralised policy decisions. We present a general method to compute target values for an arbitrary metric on the local system state and show that autonomous rebalancing actions based on the target values can be used to reliably and robustly improve the balance for metrics based on probabilistic risk estimates. To balance the trade-off between balancing efficiency and cost, we introduce 2 methods of deriving rebalancing actuations from the computed targets that depend on parameters that directly affects the trade-off. This enables policy level control of the distributed mechanism based on collected metric statistics from network elements. Evaluation results based on cellular radio access network simulations indicate that load balancing based on probabilistic overload risk metrics provides more robust balancing solutions with fewer handovers compared to a baseline setting based on average load.

Place, publisher, year, edition, pages
John Wiley & Sons, 2018
Keywords
Self-organising heterogeneous networks; Distributed dynamic load balancing; Methods/control theories; Network Management/Wireless & mobile networks
National Category
Computer Sciences
Identifiers
urn:nbn:se:ri:diva-32825 (URN)10.1002/nem.2014 (DOI)2-s2.0-85036539033 (Scopus ID)
Funder
Swedish Foundation for Strategic Research , RIT15-0075EU, Horizon 2020, 671639
Available from: 2017-12-05 Created: 2017-12-05 Last updated: 2019-01-07Bibliographically approved
Görnerup, O. & Gillblad, D. (2018). Streaming word similarity mining on the cheap. In: : . Paper presented at Conference on Empirical Methods in Natural Language Processing (EMNLP).
Open this publication in new window or tab >>Streaming word similarity mining on the cheap
2018 (English)Conference paper, Published paper (Other academic)
Abstract [en]

Accurately and efficiently estimating word similarities from text is fundamental in natural language processing. In this paper, we propose a fast and lightweight method for estimating similarities from streams by explicitly counting second-order co-occurrences. The method rests on the observation that words that are highly correlated with respect to such counts are also highly similar with respect to first-order co-occurrences. Using buffers of co-occurred words per word to count second-order co-occurrences, we can then estimate similarities in a single pass over data without having to do prohibitively expensive similarity calculations. We demonstrate that this approach is scalable, converges rapidly, behaves robustly under parameter changes, and that it captures word similarities on par with those given by state-of-the-art word embeddings.

National Category
Language Technology (Computational Linguistics)
Identifiers
urn:nbn:se:ri:diva-35186 (URN)
Conference
Conference on Empirical Methods in Natural Language Processing (EMNLP)
Available from: 2018-09-18 Created: 2018-09-18 Last updated: 2018-09-18Bibliographically approved
Görnerup, O., Gillblad, D. & Vasiloudis, T. (2017). Domain-Agnostic Discovery of Similarities and Concepts at Scale (7ed.). Knowledge and Information Systems, 51, 531-560
Open this publication in new window or tab >>Domain-Agnostic Discovery of Similarities and Concepts at Scale
2017 (English)In: Knowledge and Information Systems, ISSN 0219-1377, E-ISSN 0219-3116, Vol. 51, p. 531-560Article in journal (Refereed) Published
Abstract [en]

Appropriately defining and efficiently calculating similarities from large data sets are often essential in data mining, both for gaining understanding of data and generating processes, and for building tractable representations. Given a set of objects and their correlations, we here rely on the premise that each object is characterized by its context, i.e. its correlations to the other objects. The similarity between two objects can then be expressed in terms of the similarity between their contexts. In this way, similarity pertains to the general notion that objects are similar if they are exchangeable in the data. We propose a scalable approach for calculating all relevant similarities among objects by relating them in a correlation graph that is transformed to a similarity graph. These graphs can express rich structural properties among objects. Specifically, we show that concepts - abstractions of objects - are constituted by groups of similar objects that can be discovered by clustering the objects in the similarity graph. These principles and methods are applicable in a wide range of fields, and will here be demonstrated in three domains: computational linguistics, music and molecular biology, where the numbers of objects and correlations range from small to very large.

Place, publisher, year, edition, pages
Springer, 2017 Edition: 7
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24561 (URN)10.1007/s10115-016-0984-2 (DOI)2-s2.0-84984793995 (Scopus ID)
Note

This paper is an extended version of Görnerup, O., Gillblad, D. and Vasiloudis, T. (2015), Knowing an object by the company it keeps: A domain-agnostic scheme for similarity discovery, in "IEEE International Conference on Data Mining (ICDM 2015)".

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-01-07Bibliographically approved
Xiao, B., Rahmani, R., Li, Y., Gillblad, D. & Kanter, T. G. (2016). Intelligent data-intensive IoT: A survey. In: 2016 2nd IEEE International Conference on Computer and Communications (ICCC): . Paper presented at 2nd IEEE International Conference on Computer and Communications (ICCC 2016), October 14-17, 2016, Chengdu, China (pp. 2362-2368). , Article ID 7925122.
Open this publication in new window or tab >>Intelligent data-intensive IoT: A survey
Show others...
2016 (English)In: 2016 2nd IEEE International Conference on Computer and Communications (ICCC), 2016, p. 2362-2368, article id 7925122Conference paper, Published paper (Refereed)
Abstract [en]

The IoT paradigm proposes to connect entities intelligently with massive heterogeneous nature, which forms an ocean of devices and data whose complexity and volume are incremental with time. Different from the general big data or IoT, the data-intensive feature of IoT introduces several specific challenges, such as circumstance dynamicity and uncertainties. Hence, intelligence techniques are needed in solving the problems brought by the data intensity. Until recent, there are many different views to handle IoT data and different intelligence enablers for IoT, with different contributions and different targets. However, there are still some issues have not been considered. This paper will provide a fresh survey study on the data-intensive IoT issue. Besides that, we conclude some shadow issues that have not been emphasized, which are interesting for the future. We propose also an extended big data model for intelligent data-intensive IoT to tackle the challenges.

Keywords
Context, Data provision, Data-intensive, Intelligence enabler, Internet of things, Big data, Surveys, Data intensive, Intelligent data
National Category
Natural Sciences
Identifiers
urn:nbn:se:ri:diva-30927 (URN)10.1109/CompComm.2016.7925122 (DOI)2-s2.0-85020198230 (Scopus ID)978-1-4673-9026-2 (ISBN)
Conference
2nd IEEE International Conference on Computer and Communications (ICCC 2016), October 14-17, 2016, Chengdu, China
Available from: 2017-09-07 Created: 2017-09-07 Last updated: 2019-06-24Bibliographically approved
Kreuger, P., Görnerup, O., Gillblad, D., Lundborg, T., Corcoran, D. & Ermedahl, A. (2015). Autonomous load balancing of heterogeneous networks (11ed.). In: 2015 IEEE 81st Vehicular Technology Conference (VTC Spring): . Paper presented at 81st IEEE Vehicular Technology Conference (VTC Spring 2015), May 11-14, 2015, Glasgow, UK. , Article ID 7145712.
Open this publication in new window or tab >>Autonomous load balancing of heterogeneous networks
Show others...
2015 (English)In: 2015 IEEE 81st Vehicular Technology Conference (VTC Spring), 2015, 11, article id 7145712Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents a method for load balancing heterogeneous networks by dynamically assigning values to the LTE cell range expansion (CRE) parameter. The method records hand-over events online and adapts flexibly to changes in terminal traffic and mobility by maintaining statistical estimators that are used to support autonomous assignment decisions. The proposed approach has low overhead and is highly scalable due to a modularised and completely distributed design that exploits self- organisation based on local inter-cell interactions. An advanced simulator that incorporates terminal traffic patterns and mobility models with a radio access network simulator has been developed to validate and evaluate the method.

Series
IEEE Vehicular Technology Conference, ISSN 1550-2252
Keywords
autonomous network management, self-organising heterogenous networks, distributed algorithms, statistical modelling
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24457 (URN)10.1109/VTCSpring.2015.7145712 (DOI)978-1-4799-8088-8 (ISBN)
Conference
81st IEEE Vehicular Technology Conference (VTC Spring 2015), May 11-14, 2015, Glasgow, UK
Projects
HetNet
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-07-10Bibliographically approved
Hess, A., Marsh, I. & Gillblad, D. (2015). Exploring communication and mobility behaviour of 3G network users and its temporal consistency. In: : . Paper presented at 2015 IEEE International Conference on Communications (ICC).
Open this publication in new window or tab >>Exploring communication and mobility behaviour of 3G network users and its temporal consistency
2015 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Over the past decade, telecommunication network operators have more and more realized the added value of data analytics for their network deployment efficiency. Early studies targeted the global network perspective by localizing peak loads, both in terms of area and time period. Due to their higher granularity and information richness, current telecommunication datasets allow increasingly deeper insights into the network activities of the users. Existing network traffic classification studies tend to divide users into groups without considering the transitions between different groups caused by individual behavioral traits, which we expect to show observable regularities. Our approach defines a profiling model that characterizes the user behavior as well as its temporal dynamics from two perspectives: w.r.t. (i) the network load the users generate, and (ii) their mobility patterns. The model is evaluated with two unsupervised clustering algorithms of different complexity (namely, XMeans and EM) by means of a 3G trace dataset from a European operator.

National Category
Telecommunications
Identifiers
urn:nbn:se:ri:diva-39322 (URN)10.1109/ICC.2015.7249265 (DOI)
Conference
2015 IEEE International Conference on Communications (ICC)
Available from: 2019-07-03 Created: 2019-07-03 Last updated: 2019-07-03Bibliographically approved
Görnerup, O., Gillblad, D. & Vasiloudis, T. (2015). Knowing an Object by the Company It Keeps: A Domain-Agnostic Scheme for Similarity Discovery (18ed.). In: 2015 IEEE International Conference on Data Mining: . Paper presented at 15th IEEE International Conference on Data Mining (ICDM 2015), November 14-17, 2015, Atlantic City, US (pp. 121-130). , Article ID 7373316.
Open this publication in new window or tab >>Knowing an Object by the Company It Keeps: A Domain-Agnostic Scheme for Similarity Discovery
2015 (English)In: 2015 IEEE International Conference on Data Mining, 2015, 18, p. 121-130, article id 7373316Conference paper, Published paper (Refereed)
Abstract [en]

Appropriately defining and then efficiently calculating similarities from large data sets are often essential in data mining, both for building tractable representations and for gaining understanding of data and generating processes. Here we rely on the premise that given a set of objects and their correlations, each object is characterized by its context, i.e. its correlations to the other objects, and that the similarity between two objects therefore can be expressed in terms of the similarity between their respective contexts. Resting on this principle, we propose a data-driven and highly scalable approach for discovering similarities from large data sets by representing objects and their relations as a correlation graph that is transformed to a similarity graph. Together these graphs can express rich structural properties among objects. Specifically, we show that concepts - representations of abstract ideas and notions - are constituted by groups of similar objects that can be identified by clustering the objects in the similarity graph. These principles and methods are applicable in a wide range of domains, and will here be demonstrated for three distinct types of objects: codons, artists and words, where the numbers of objects and correlations range from small to very large.

National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24463 (URN)10.1109/ICDM.2015.85 (DOI)978-1-4673-9504-5 (ISBN)
Conference
15th IEEE International Conference on Data Mining (ICDM 2015), November 14-17, 2015, Atlantic City, US
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2019-07-11Bibliographically approved
Kreuger, P., Gillblad, D., Görnerup, O., Corcoran, D., Lundborg, T. & Ermedahl, A. (2015). Methods, Nodes and system for enabling redistribution of cell load (13ed.). .
Open this publication in new window or tab >>Methods, Nodes and system for enabling redistribution of cell load
Show others...
2015 (English)Patent (Other (popular science, discussion, etc.))
Abstract [en]

Patent for distributed load balancing mechanism for LTE, developed by SICS in collaboration with Ericsson DURA

Publisher
p. 49
Keywords
load balancing, cell range expansion, autonomous radio access management, distributed algorithms, LTE
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:ri:diva-24526 (URN)
Projects
HetNet
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-17Bibliographically approved
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-8952-3542

Search in DiVA

Show all publications
v. 2.35.8