Network


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

Hotspot


Dive into the research topics where Gerasimos Spanakis is active.

Publication


Featured researches published by Gerasimos Spanakis.


The Computer Journal | 2012

Exploiting Wikipedia Knowledge for Conceptual Hierarchical Clustering of Documents

Gerasimos Spanakis; Georgios Siolas; Andreas Stafylopatis

In this paper, we propose a novel method for conceptual hierarchical clustering of documents using knowledge extracted from Wikipedia. The proposed method overcomes the classic bag-of-words models disadvantages through the exploitation of Wikipedia textual content and link structure. A robust and compact document representation is built in real-time using the Wikipedia application programmers interface, without the need to store locally any Wikipedia information. The clustering process is hierarchical and extends the idea of frequent items by using Wikipedia article titles for selecting cluster labels that are descriptive and important for the examined corpus. Experiments show that the proposed technique greatly improves over the baseline approach, both in terms of F-measure and entropy on the one hand and computational cost on the other.


international conference on tools with artificial intelligence | 2009

A Hybrid Web-Based Measure for Computing Semantic Relatedness Between Words

Gerasimos Spanakis; Georgios Siolas; Andreas Stafylopatis

In this paper, we build a hybrid Web-based metric for computing semantic relatedness between words. The method exploits page counts, titles, snippets and URLs returned by a Web search engine. Our technique uses traditional information retrieval methods and is enhanced by page-count-based similarity scores which are integrated with automatically extracted lexico-synantic patterns from titles, snippets and URLs for all kinds of semantically related words provided by WordNet (synonyms, hypernyms, meronyms, antonyms). A support vector machine is used to solve the arising regression problem of word relatedness and the proposed method is evaluated on standard benchmark datasets. The method achieves an overall correlation of 0.88, which is the highest among other metrics up to date.


ICSH 2015 Revised Selected Papers of the International Conference on Smart Health - Volume 9545 | 2015

Network Analysis of Ecological Momentary Assessment Data for Monitoring andźUnderstanding Eating Behavior

Gerasimos Spanakis; Gerhard Weiss; Bastiaan Boh; Anne Roefs

Ecological Momentary Assessment EMA techniques have been blooming during the last years due to the emergence of smart devices like PDAs and smartphones that allow the collection of repeated assessments of several measures predictors that affect a target variable. Eating behavior studies can benefit from EMA techniques by analysing almost real-time information regarding food intake and the related conditions and circumstances. In this paper, an EMA method protocol to study eating behavior is presented along with the mobile application developed for this purpose. Mixed effects and vector autoregression are utilized for conducting a network analysis of the data collected and lead to inferring knowledge for the connectivity between different conditions and their effect on eating behavior.


Journal of Intelligent Information Systems | 2012

DoSO: a document self-organizer

Gerasimos Spanakis; Georgios Siolas; Andreas Stafylopatis

In this paper, we propose a Document Self Organizer (DoSO), an extension of the classic Self Organizing Map (SOM) model, in order to deal more efficiently with a document clustering task. Starting from a document representation model, based on important “concepts” exploiting Wikipedia knowledge, that we have previously developed in order to overcome some of the shortcomings of the Bag-of-Words (BOW) model, we demonstrate how SOM’s performance can be boosted by using the most important concepts of the document collection to explicitly initialize the neurons. We also show how a hierarchical approach can be utilized in the SOM model and how this can lead to a more comprehensive final clustering result with hierarchical descriptive labels attached to neurons and clusters. Experiments show that the proposed model (DoSO) yields promising results both in terms of extrinsic and SOM evaluation measures.


ubiquitous computing | 2017

Machine learning techniques in eating behavior e-coaching

Gerasimos Spanakis; Gerhard Weiss; Bastiaan Boh; Lotte H.J.M. Lemmens; Anne Roefs

The rise of internet and mobile technologies (such as smartphones) provide a harness of data and an opportunity to learn about peoples’ states, behavior, and context in regard to several application areas such as health. Eating behavior is an area that can benefit from the development of effective e-coaching applications which utilize psychological theories and data science techniques. In this paper, we propose a framework of how machine learning techniques can effectively be used in order to fully exploit data collected from a mobile application (“Think Slim”) which is designed to assess eating behavior using experience sampling methods. The overall goal is to analyze individual states of a person status (emotions, location, activity, etc.) and assess their impact on unhealthy eating. Building on data collected from different participants, a classification algorithm (decision tree tailored to longitudinal data) is used to warn people prior to a possible unhealthy eating event and a clustering algorithm (hierarchical agglomerative clustering) is used for profiling the participants and generalize for new users of the application. Finally, a framework to offer feedback via adaptive messages (intervention) and recommendations prior to possible unhealthy eating events is presented. Results from applying our methods reveal that participants can be clustered to six robust groups based on their eating behavior and that there are specific rules that discriminate which conditions lead to healthy versus unhealthy eating. Consequently, these rules can be utilized to provide adaptive semi-tailored feedback to users who, through this method, are assisted in learning under which conditions are more prone to unhealthy eating. Effectiveness of the approach is confirmed by observing a decreasing trend in rule activation towards the end of intervention period.


practical applications of agents and multi agent systems | 2017

Multi-Agent Parking Place Simulation

Thomas Vrancken; Daniel Tenbrock; Sebastian Reick; Dejan Bozhinovski; Gerhard Weiss; Gerasimos Spanakis

Parking in large urban areas is becoming an issue of great concern with many implications (environmental, financial, societal, etc.). In our research we investigate automated dynamic pricing (ADP) as a mechanism for regulating parking place allocation. ADP means that the price for staying in a parking facility for a certain amount of time will fluctuate depending on the day and time of the week. In this paper, such a scenario is explored using multi-agent based simulation. Two kinds of agents are considered: drivers and parking facilities. Experiments are conducted in a real city environment in order to observe the impact of dynamic pricing, competition and demand increase. Results show that dynamic pricing application leads to better results (in terms of profit margin) for the parking facilities while it decreases drivers’ utility.


international conference on tools with artificial intelligence | 2016

Enhancing Classification of Ecological Momentary Assessment Data Using Bagging and Boosting

Gerasimos Spanakis; Gerhard Weiss; Anne Roefs

Ecological Momentary Assessment (EMA) techniques gain more ground in studies and data collection among different disciplines. Decision tree algorithms and their ensemble variants are widely used for classifying this type of data, since they are easy to use and provide satisfactory results. However, most of these algorithms do not take into account the multiple levels (per-subject, per-day, etc.) in which EMA data are organized. In this paper we explore how the EMA data organization can be taken into account when dealing with decision trees and specifically how a combination of bagging and boosting can be utilized in a classification task. A new algorithm called BBT (standing for Bagged Boosted Trees) is proposed which is enhanced by an over/under sampling method leading to better estimates of the conditional class probability function. BBTs necessity and effects are demonstrated using both simulated datasets and real-world EMA data collected using a mobile application following the eating behavior of 100 people. Experimental analysis shows that BBT leads to clear improvements with respect to prediction error reduction and conditional class probability estimation.


international conference on agents and artificial intelligence | 2016

AMSOM: Adaptive Moving Self-organizing Map for Clustering and Visualization

Gerasimos Spanakis; Gerhard Weiss

Self-Organizing Map (SOM) is a neural network model which is used to obtain a topology-preserving mapping from the (usually high dimensional) input/feature space to an output/map space of fewer dimensions (usually two or three in order to facilitate visualization). Neurons in the output space are connected with each other but this structure remains fixed throughout training and learning is achieved through the updating of neuron reference vectors in feature space. Despite the fact that growing variants of SOM overcome the fixed structure limitation they increase computational cost and also do not allow the removal of a neuron after its introduction. In this paper, a variant of SOM is proposed called AMSOM (Adaptive Moving Self-Organizing Map) that on the one hand creates a more flexible structure where neuron positions are dynamically altered during training and on the other hand tackles the drawback of having a predefined grid by allowing neuron addition and/or removal during training. Experiments using multiple literature datasets show that the proposed method improves training performance of SOM, leads to a better visualization of the input dataset and provides a framework for determining the optimal number and structure of neurons.


international conference on agents and artificial intelligence | 2016

Enhancing Visual Clustering Using Adaptive Moving Self-Organizing Maps (AMSOM)

Gerasimos Spanakis; Gerhard Weiss

Recent advancements in computing technology allowed both scientific and business applications to produce large datasets with increasing complexity and dimensionality. Clustering algorithms are useful in analyzing these large datasets but often fall short to provide completely satisfactory results. Integrating clustering and visualization not only yields better clustering results but also leads to a higher degree of confidence in the findings. Self-organizing map (som) is a neural network model which is used to obtain a topology-preserving mapping from the (usually high dimensional) input/feature space to an output/map space of fewer dimensions (usually two or three in order to facilitate visualization). Neurons in the output space are connected with each other but this structure remains fixed throughout training and learning is achieved through the updating of neuron reference vectors in feature space. Despite the fact that growing variants of som overcome the fixed structure limitation, they increase computational cost and also do not allow the removal of a neuron after its introduction. In this paper, a variant of som is presented called amsom (adaptive moving self-organizing map) that on the one hand creates a more flexible structure where neuron positions are dynamically altered during training and on the other hand tackles the drawback of having a predefined grid by allowing neuron addition and/or removal during training. Experimental evaluation on different literature datasets with diverse characteristics improves som training performance, leads to a better visualization of the input dataset, and provides a framework for determining the optimal number and structure of neurons as well as the optimal number of clusters.


european conference on artificial intelligence | 2016

Bagged Boosted Trees for Classification of Ecological Momentary Assessment Data

Gerasimos Spanakis; Gerhard Weiss; Anne Roefs

Ecological Momentary Assessment (EMA) data is organized in multiple levels (per-subject, per-day, etc.) and this particular structure should be taken into account in machine learning algorithms used in EMA like decision trees and its variants. We propose a new algorithm called BBT (standing for Bagged Boosted Trees) that is enhanced by a over/under sampling method and can provide better estimates for the conditional class probability function. Experimental results on a real-world dataset show that BBT can benefit EMA data classification and performance.

Collaboration


Dive into the Gerasimos Spanakis's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Andreas Stafylopatis

National Technical University of Athens

View shared research outputs
Top Co-Authors

Avatar

Georgios Siolas

National Technical University of Athens

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge