Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Mark Kibanov is active.

Publication


Featured researches published by Mark Kibanov.


Science in China Series F: Information Sciences | 2014

Temporal evolution of contacts and communities in networks of face-to-face human interactions

Mark Kibanov; Martin Atzmueller; Christoph Scholz; Gerd Stumme

Temporal dynamics of social interaction networks as well as the analysis of communities are key aspects to gain a better understanding of the involved processes, important influence factors, their effects, and their structural implications. In this article, we analyze temporal dynamics of contacts and the evolution of communities in networks of face-to-face proximity. As our application context, we consider four scientific conferences. On a structural level, we focus on static and dynamic properties of the contact graphs. Also, we analyze the resulting community structure using state-of-the-art automatic community detection algorithms. Specifically, we analyze the evolution of contacts and communities over time to consider the stability of the respective communities. Furthermore, we assess different factors which have an influence on the quality of community prediction. Overall, we provide first important insights into the evolution of contacts and communities in face-to-face contact networks.


The New Review of Hypermedia and Multimedia | 2014

Ubicon and its applications for ubiquitous social computing

Martin Atzmueller; Martin Becker; Mark Kibanov; Christoph Scholz; Stephan Doerfel; Andreas Hotho; Bjoern Elmar Macek; Folke Mitzlaff; Juergen Mueller; Gerd Stumme

The combination of ubiquitous and social computing is an emerging research area which integrates different but complementary methods, techniques, and tools. In this paper, we focus on the Ubicon platform, its applications, and a large spectrum of analysis results. Ubicon provides an extensible framework for building and hosting applications targeting both ubiquitous and social environments. We summarize the architecture and exemplify its implementation using four real-world applications built on top of Ubicon. In addition, we discuss several scientific experiments in the context of these applications in order to give a better picture of the potential of the framework, and discuss analysis results using several real-world data sets collected utilizing Ubicon.


ieee international conference on green computing and communications | 2012

Ubicon: Observing Physical and Social Activities

Martin Atzmueller; Martin Becker; Stephan Doerfel; Andreas Hotho; Mark Kibanov; Bjoern Elmar Macek; Folke Mitzlaff; Juergen Mueller; Christoph Scholz; Gerd Stumme

The connection of ubiquitous and social computing is an emerging research area which is combining two prominent areas of computer science. In this paper, we tackle this topic from different angles: We describe data mining methods for ubiquitous and social data, specifically focusing on physical and social activities, and provide exemplary analysis results. Furthermore, we give an overview on the Ubicon platform which provides a framework for the creation and hosting of ubiquitous and social applications for diverse tasks and projects. Ubicon features the collection and analysis of both physical and social activities of users for enabling inter-connected applications in ubiquitous and social contexts. We summarize three real-world systems built on top of Ubicon, and exemplarily discuss the according mining and analysis aspects.


advances in social networks analysis and mining | 2015

Is Web Content a Good Proxy for Real-Life Interaction?: A Case Study Considering Online and Offline Interactions of Computer Scientists

Mark Kibanov; Martin Atzmueller; Jens Illig; Christoph Scholz; Alain Barrat; Ciro Cattuto; Gerd Stumme

Today, many people spend a lot of time online. Their social interactions captured in online social networks are an important part of the overall personal social profile, in addition to interactions taking place offline. This paper investigates whether relations captured by online social networks can be used as a proxy for the relations in offline social networks, such as networks of human face-to-face (F2F) proximity and coauthorship networks. Particularly, the paper focuses on interactions of computer scientists in online settings (homepages, social networks profiles and connections) and offline settings (scientific collaboration, face-to-face communications during the conferences). We focus on quantitative studies and investigate the structural similarities and correlations of the induced networks; in addition, we analyze implications between networks. Finally, we provide a qualitative user analysis to find characteristics of good and bad proxies.


international world wide web conferences | 2016

DASHTrails: An Approach for Modeling and Analysis of Distribution-Adapted Sequential Hypotheses and Trails

Martin Atzmueller; Andreas Schmidt; Mark Kibanov

The analysis of sequential trails and patterns is a prominent research topic. However, typically only explicitly observed trails are considered. In contrast, this paper proposes the DASHTrails approach that enables the modeling and analysis of distribution-adapted sequential trails and hypotheses. It presents a method for deriving transition matrices given a probability distribution over certain events. We demonstrate the applicability of the proposed approach using real-world data in the mobility domain, i.e., car trajectories and spatio-temporal distributions on car accidents.


Social Network Analysis and Mining | 2014

Predictability of evolving contacts and triadic closure in human face-to-face proximity networks

Christoph Scholz; Martin Atzmueller; Mark Kibanov; Gerd Stumme

The analysis of link structures and particularly their dynamics is important for enhancing our understanding of the underlying (social) processes. This paper analyzes such structures in networks of face-to-face spatial proximity: we focus on evolving contacts and triadic closure and present new insights on the dynamic and static contact behavior in real-world networks, where we utilize face-to-face contact networks collected at three different conferences using the social conference guidance system Conferator [Atzmueller et al. 2011, 2014]. We analyze network dynamics and the predictability of all, new and recurring links. Furthermore, we especially investigate the strength of ties, their connection to triadic closure, and examine influence factors for predicting triadic closure in face-to-face proximity networks.


ieee international conference on green computing and communications | 2013

On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity

Mark Kibanov; Martin Atzmueller; Christoph Scholz; Gerd Stumme

Communities are a central aspect in the formation of social interaction networks. In this paper, we analyze the evolution of communities in networks of face-to-face proximity. As our application context, we consider four scientific conferences. We compare the basic properties of the contact graphs to describe the properties of the contact networks and analyze the resulting community structure using state-of-the-art automic community detection algorithms. Specifically, we analyze the evolution of contacts and communities over time to consider the stability of the respective communities. In addition, we assess different factors which have an influence on the quality of community prediction. Overall, we provide first important insights into the evolution of contacts and communities in face-to-face contact networks.


advances in social networks analysis and mining | 2013

How do people link?: analysis of contact structures in human face-to-face proximity networks

Christoph Scholz; Martin Atzmueller; Mark Kibanov; Gerd Stumme

Understanding the process of link creation is rather important for link prediction in social networks. Therefore, this paper analyzes contact structures in networks of face-to-face spatial proximity, and presents new insights on the dynamic and static contact behavior in such real world networks. We focus on face-to-face contact networks collected at different conferences using the social conference guidance system Conferator. Specifically, we investigate the strength of ties and its connection to triadic closures in face-to-face proximity networks. Furthermore, we analyze the predictability of all, new and recurring links at different points of time during the conference. In addition, we consider network dynamics for the prediction of new links.


Social Network Analysis and Mining | 2017

Mining social media to inform peatland fire and haze disaster management

Mark Kibanov; Gerd Stumme; Imaduddin Amin; Jong Gun Lee

Abstract Peatland fires and haze events are disasters with national, regional, and international implications. The phenomena lead to direct damage to local assets, as well as broader economic and environmental losses. Satellite imagery is still the main and often the only available source of information for disaster management. In this article, we test the potential of social media to assist disaster management. To this end, we compare insights from two datasets: fire hotspots detected via NASA satellite imagery and almost all GPS-stamped tweets from Sumatra Island, Indonesia, posted during 2014. Sumatra Island is chosen as it regularly experiences a significant number of haze events, which affect citizens in Indonesia as well as in nearby countries including Malaysia and Singapore. We analyze temporal correlations between the datasets and their geo-spatial interdependence. Furthermore, we show how Twitter data reveal changes in users’ behavior during severe haze events. Overall, we demonstrate that social media are a valuable source of complementary and supplementary information for haze disaster management. Based on our methodology and findings, an analytics tool to improve peatland fire and haze disaster management by the Indonesian authorities is under development.


acm symposium on applied computing | 2018

Adaptive kNN using expected accuracy for classification of geo-spatial data

Mark Kibanov; Martin Becker; Juergen Mueller; Martin Atzmueller; Andreas Hotho; Gerd Stumme

The k-Nearest Neighbor (kNN) classification approach is conceptually simple - yet widely applied since it often performs well in practical applications. However, using a global constant k does not always provide an optimal solution, e. g., for datasets with an irregular density distribution of data points. This paper proposes an adaptive kNN classifier where k is chosen dynamically for each instance (point) to be classified, such that the expected accuracy of classification is maximized. We define the expected accuracy as the accuracy of a set of structurally similar observations. An arbitrary similarity function can be used to find these observations. We introduce and evaluate different similarity functions. For the evaluation, we use five different classification tasks based on geo-spatial data. Each classification task consists of (tens of) thousands of items. We demonstrate, that the presented expected accuracy measures can be a good estimator for kNN performance, and the proposed adaptive kNN classifier outperforms common kNN and previously introduced adaptive kNN algorithms. Also, we show that the range of considered k can be significantly reduced to speed up the algorithm without negative influence on classification accuracy.

Collaboration


Dive into the Mark Kibanov's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Alain Barrat

Aix-Marseille University

View shared research outputs
Researchain Logo
Decentralizing Knowledge