Publications of Gerd Stumme

The list is generated automatically by BibSonomy. For more details and BibTeX entries, please click on the titles.

2022

• Schäfermeier, B., Stumme, G., Hanika, T.: Mapping Research Trajectories, https://arxiv.org/abs/2204.11859, (2022).

  URLBibTeXEndNote

  @misc{https://doi.org/10.48550/arxiv.2204.11859,
  author = {Schäfermeier, Bastian and Stumme, Gerd and Hanika, Tom},
  keywords = {trajectory_mapping},
  publisher = {arXiv},
  title = {Mapping Research Trajectories},
  year = 2022
  }
  

  %0 Generic
  %1 https://doi.org/10.48550/arxiv.2204.11859
  %A Schäfermeier, Bastian
  %A Stumme, Gerd
  %A Hanika, Tom
  %D 2022
  %I arXiv
  %R 10.48550/ARXIV.2204.11859
  %T Mapping Research Trajectories
  %U https://arxiv.org/abs/2204.11859
  

• Hanika, T., Schneider, F.M., Stumme, G.: {Intrinsic dimension of geometric data sets} Tohoku Mathematical Journal. 74, 23–52 (2022).

  URLBibTeXEndNote

  The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.

  @article{10.2748/tmj.20201015a,
  abstract = {The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.},
  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},
  journal = {Tohoku Mathematical Journal},
  keywords = {publist},
  number = 1,
  pages = {23 -- 52},
  publisher = {Tohoku University, Mathematical Institute},
  title = {{Intrinsic dimension of geometric data sets}},
  volume = 74,
  year = 2022
  }
  

  %0 Journal Article
  %1 10.2748/tmj.20201015a
  %A Hanika, Tom
  %A Schneider, Friedrich Martin
  %A Stumme, Gerd
  %D 2022
  %I Tohoku University, Mathematical Institute
  %J Tohoku Mathematical Journal
  %N 1
  %P 23 -- 52
  %R 10.2748/tmj.20201015a
  %T {Intrinsic dimension of geometric data sets}
  %U https://doi.org/10.2748/tmj.20201015a
  %V 74
  %X The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.
  

• Dürrschnabel, D., Hanika, T., Stumme, G.: Discovering Locally Maximal Bipartite Subgraphs, http://arxiv.org/abs/2211.10446, (2022).

  URLBibTeXEndNote

  Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark datasets

  @misc{durrschnabel2022discovering,
  abstract = {Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark datasets},
  author = {Dürrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},
  keywords = {myown},
  note = {cite arxiv:2211.10446Comment: 12 pages, 3 figures, 3 tables},
  title = {Discovering Locally Maximal Bipartite Subgraphs},
  year = 2022
  }
  

  %0 Generic
  %1 durrschnabel2022discovering
  %A Dürrschnabel, Dominik
  %A Hanika, Tom
  %A Stumme, Gerd
  %D 2022
  %T Discovering Locally Maximal Bipartite Subgraphs
  %U http://arxiv.org/abs/2211.10446
  %X Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark datasets
  

• Felde, M., Stumme, G.: Attribute Exploration with Multiple Contradicting Partial Experts In: Braun, T., Cristea, D., and J{ä}schke, R. (eds.) Graph-Based Representation and Reasoning. pp. 51–65. Springer International Publishing, Cham (2022).

  BibTeXEndNote

  Attribute exploration is a method from Formal Concept Analysis (FCA) that helps a domain expert discover structural dependencies in knowledge domains which can be represented as formal contexts (cross tables of objects and attributes). In this paper we present an extension of attribute exploration that allows for a group of domain experts and explores their shared views. Each expert has their own view of the domain and the views of multiple experts may contain contradicting information.

  @inproceedings{10.1007/978-3-031-16663-1_5,
  abstract = {Attribute exploration is a method from Formal Concept Analysis (FCA) that helps a domain expert discover structural dependencies in knowledge domains which can be represented as formal contexts (cross tables of objects and attributes). In this paper we present an extension of attribute exploration that allows for a group of domain experts and explores their shared views. Each expert has their own view of the domain and the views of multiple experts may contain contradicting information.},
  address = {Cham},
  author = {Felde, Maximilian and Stumme, Gerd},
  booktitle = {Graph-Based Representation and Reasoning},
  editor = {Braun, Tanya and Cristea, Diana and J{ä}schke, Robert},
  keywords = {myown},
  pages = {51--65},
  publisher = {Springer International Publishing},
  title = {Attribute Exploration with Multiple Contradicting Partial Experts},
  year = 2022
  }
  

  %0 Conference Paper
  %1 10.1007/978-3-031-16663-1_5
  %A Felde, Maximilian
  %A Stumme, Gerd
  %B Graph-Based Representation and Reasoning
  %C Cham
  %D 2022
  %E Braun, Tanya
  %E Cristea, Diana
  %E J{ä}schke, Robert
  %I Springer International Publishing
  %P 51--65
  %R 10.1007/978-3-031-16663-1_5
  %T Attribute Exploration with Multiple Contradicting Partial Experts
  %X Attribute exploration is a method from Formal Concept Analysis (FCA) that helps a domain expert discover structural dependencies in knowledge domains which can be represented as formal contexts (cross tables of objects and attributes). In this paper we present an extension of attribute exploration that allows for a group of domain experts and explores their shared views. Each expert has their own view of the domain and the views of multiple experts may contain contradicting information.
  %@ 978-3-031-16663-1
  

• Stubbemann, M., Stumme, G.: LG4AV: Combining Language Models and Graph Neural Networks for Author Verification In: Bouadi, T., Fromont, E., and H{ü}llermeier, E. (eds.) Advances in Intelligent Data Analysis XX. pp. 315–326. Springer International Publishing, Cham (2022).

  URLBibTeXEndNote

  The verification of document authorships is important in various settings. Researchers are for example judged and compared by the amount and impact of their publications and public figures are confronted by their posts on social media. Therefore, it is important that authorship information in frequently used data sets is correct. The question whether a given document is written by a given author is commonly referred to as authorship verification (AV). While AV is a widely investigated problem in general, only few works consider settings where the documents are short and written in a rather uniform style. This makes most approaches impractical for bibliometric data. Here, authorships of scientific publications have to be verified, often with just abstracts and titles available. To this point, we present LG4AV which combines language models and graph neural networks for authorship verification. By directly feeding the available texts in a pre-trained transformer architecture, our model does not need any hand-crafted stylometric features that are not meaningful in scenarios where the writing style is, at least to some extent, standardized. By the incorporation of a graph neural network structure, our model can benefit from relations between authors that are meaningful with respect to the verification process.

  @inproceedings{10.1007/978-3-031-01333-1_25,
  abstract = {The verification of document authorships is important in various settings. Researchers are for example judged and compared by the amount and impact of their publications and public figures are confronted by their posts on social media. Therefore, it is important that authorship information in frequently used data sets is correct. The question whether a given document is written by a given author is commonly referred to as authorship verification (AV). While AV is a widely investigated problem in general, only few works consider settings where the documents are short and written in a rather uniform style. This makes most approaches impractical for bibliometric data. Here, authorships of scientific publications have to be verified, often with just abstracts and titles available. To this point, we present LG4AV which combines language models and graph neural networks for authorship verification. By directly feeding the available texts in a pre-trained transformer architecture, our model does not need any hand-crafted stylometric features that are not meaningful in scenarios where the writing style is, at least to some extent, standardized. By the incorporation of a graph neural network structure, our model can benefit from relations between authors that are meaningful with respect to the verification process.},
  address = {Cham},
  author = {Stubbemann, Maximilian and Stumme, Gerd},
  booktitle = {Advances in Intelligent Data Analysis XX},
  editor = {Bouadi, Tassadit and Fromont, Elisa and H{ü}llermeier, Eyke},
  keywords = {regio},
  pages = {315--326},
  publisher = {Springer International Publishing},
  title = {LG4AV: Combining Language Models and Graph Neural Networks for Author Verification},
  year = 2022
  }
  

  %0 Conference Paper
  %1 10.1007/978-3-031-01333-1_25
  %A Stubbemann, Maximilian
  %A Stumme, Gerd
  %B Advances in Intelligent Data Analysis XX
  %C Cham
  %D 2022
  %E Bouadi, Tassadit
  %E Fromont, Elisa
  %E H{ü}llermeier, Eyke
  %I Springer International Publishing
  %P 315--326
  %T LG4AV: Combining Language Models and Graph Neural Networks for Author Verification
  %U https://link.springer.com/chapter/10.1007/978-3-031-01333-1_25
  %X The verification of document authorships is important in various settings. Researchers are for example judged and compared by the amount and impact of their publications and public figures are confronted by their posts on social media. Therefore, it is important that authorship information in frequently used data sets is correct. The question whether a given document is written by a given author is commonly referred to as authorship verification (AV). While AV is a widely investigated problem in general, only few works consider settings where the documents are short and written in a rather uniform style. This makes most approaches impractical for bibliometric data. Here, authorships of scientific publications have to be verified, often with just abstracts and titles available. To this point, we present LG4AV which combines language models and graph neural networks for authorship verification. By directly feeding the available texts in a pre-trained transformer architecture, our model does not need any hand-crafted stylometric features that are not meaningful in scenarios where the writing style is, at least to some extent, standardized. By the incorporation of a graph neural network structure, our model can benefit from relations between authors that are meaningful with respect to the verification process.
  %@ 978-3-031-01333-1
  

2021

• Koopmann, T., Stubbemann, M., Kapa, M., Paris, M., Buenstorf, G., Hanika, T., Hotho, A., Jäschke, R., Stumme, G.: Proximity Dimensions and the Emergence of Collaboration: A HypTrails Study on German AI Research Scientometrics. 126, 9847–9868 (2021).

  URLBibTeXEndNote

  @article{koopmann2021proximity,
  author = {Koopmann, T. and Stubbemann, M. and Kapa, M. and Paris, M. and Buenstorf, G. and Hanika, T. and Hotho, A. and Jäschke, R. and Stumme, G.},
  journal = {Scientometrics},
  keywords = {regio},
  month = {03},
  number = 12,
  pages = {9847–9868},
  title = {Proximity Dimensions and the Emergence of Collaboration: A HypTrails Study on German AI Research},
  volume = 126,
  year = 2021
  }
  

  %0 Journal Article
  %1 koopmann2021proximity
  %A Koopmann, T.
  %A Stubbemann, M.
  %A Kapa, M.
  %A Paris, M.
  %A Buenstorf, G.
  %A Hanika, T.
  %A Hotho, A.
  %A Jäschke, R.
  %A Stumme, G.
  %D 2021
  %J Scientometrics
  %N 12
  %P 9847–9868
  %R https://doi.org/10.1007/s11192-021-03922-1
  %T Proximity Dimensions and the Emergence of Collaboration: A HypTrails Study on German AI Research
  %U https://link.springer.com/article/10.1007/s11192-021-03922-1
  %V 126
  

• Stubbemann, M., Stumme, G.: LG4AV: Combining Language Models and Graph Neural Networks for Author Verification (2021).

  URLBibTeXEndNote

  @article{stubbemann2021lg4av,
  author = {Stubbemann, Maximilian and Stumme, Gerd},
  keywords = {regio},
  title = {LG4AV: Combining Language Models and Graph Neural Networks for Author Verification},
  year = 2021
  }
  

  %0 Journal Article
  %1 stubbemann2021lg4av
  %A Stubbemann, Maximilian
  %A Stumme, Gerd
  %D 2021
  %T LG4AV: Combining Language Models and Graph Neural Networks for Author Verification
  %U https://arxiv.org/abs/2109.01479
  

• Felde, M., Stumme, G.: Triadic Exploration and Exploration with Multiple Experts In: Braud, A., Buzmakov, A., Hanika, T., and Le Ber, F. (eds.) Formal Concept Analysis. pp. 175–191. Springer International Publishing, Cham (2021).

  BibTeXEndNote

  Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and attributes). Triadic Concept Analysis is an extension of FCA that incorporates the notion of conditions. Many extensions and variants of attribute exploration have been studied but only few attempts at incorporating multiple experts have been made. In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain. We then adapt this approach to formulate attribute exploration with multiple experts that have different views on a domain.

  @inproceedings{10.1007/978-3-030-77867-5_11,
  abstract = {Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and attributes). Triadic Concept Analysis is an extension of FCA that incorporates the notion of conditions. Many extensions and variants of attribute exploration have been studied but only few attempts at incorporating multiple experts have been made. In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain. We then adapt this approach to formulate attribute exploration with multiple experts that have different views on a domain.},
  address = {Cham},
  author = {Felde, Maximilian and Stumme, Gerd},
  booktitle = {Formal Concept Analysis},
  editor = {Braud, Agn{è}s and Buzmakov, Aleksey and Hanika, Tom and Le Ber, Florence},
  keywords = {myown},
  pages = {175--191},
  publisher = {Springer International Publishing},
  title = {Triadic Exploration and Exploration with Multiple Experts},
  year = 2021
  }
  

  %0 Conference Paper
  %1 10.1007/978-3-030-77867-5_11
  %A Felde, Maximilian
  %A Stumme, Gerd
  %B Formal Concept Analysis
  %C Cham
  %D 2021
  %E Braud, Agn{è}s
  %E Buzmakov, Aleksey
  %E Hanika, Tom
  %E Le Ber, Florence
  %I Springer International Publishing
  %P 175--191
  %R 10.1007/978-3-030-77867-5_11
  %T Triadic Exploration and Exploration with Multiple Experts
  %X Formal Concept Analysis (FCA) provides a method called attribute exploration which helps a domain expert discover structural dependencies in knowledge domains that can be represented by a formal context (a cross table of objects and attributes). Triadic Concept Analysis is an extension of FCA that incorporates the notion of conditions. Many extensions and variants of attribute exploration have been studied but only few attempts at incorporating multiple experts have been made. In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain. We then adapt this approach to formulate attribute exploration with multiple experts that have different views on a domain.
  %@ 978-3-030-77867-5
  

• Schaefermeier, B., Stumme, G., Hanika, T.: Topic space trajectories Scientometrics. 126, 5759–5795 (2021).

  URLBibTeXEndNote

  The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers it becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present topic space trajectories, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. In addition to a thorough introduction of our method, our focus is on an extensive analysis of the results we achieved. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work. An advantage in these applications over previous methods lies in the good interpretability of the results obtained through our methods.

  @article{Schaefermeier2021,
  abstract = {The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers it becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present topic space trajectories, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. In addition to a thorough introduction of our method, our focus is on an extensive analysis of the results we achieved. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work. An advantage in these applications over previous methods lies in the good interpretability of the results obtained through our methods.},
  author = {Schaefermeier, Bastian and Stumme, Gerd and Hanika, Tom},
  journal = {Scientometrics},
  keywords = {topic},
  month = {may},
  number = 7,
  pages = {5759–5795},
  title = {Topic space trajectories},
  volume = 126,
  year = 2021
  }
  

  %0 Journal Article
  %1 Schaefermeier2021
  %A Schaefermeier, Bastian
  %A Stumme, Gerd
  %A Hanika, Tom
  %D 2021
  %J Scientometrics
  %N 7
  %P 5759–5795
  %R 10.1007/s11192-021-03931-0
  %T Topic space trajectories
  %U https://doi.org/10.1007/s11192-021-03931-0
  %V 126
  %X The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers it becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present topic space trajectories, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. In addition to a thorough introduction of our method, our focus is on an extensive analysis of the results we achieved. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work. An advantage in these applications over previous methods lies in the good interpretability of the results obtained through our methods.
  

• Schaefermeier, B., Stumme, G., Hanika, T.: Topological Indoor Mapping through WiFi Signals (2021).

  URLBibTeXEndNote

  The ubiquitous presence of WiFi access points and mobile devices capable of measuring WiFi signal strengths allow for real-world applications in indoor localization and mapping. In particular, no additional infrastructure is required. Previous approaches in this field were, however, often hindered by problems such as effortful map-building processes, changing environments and hardware differences. We tackle these problems focussing on topological maps. These represent discrete locations, such as rooms, and their relations, e.g., distances and transition frequencies. In our unsupervised method, we employ WiFi signal strength distributions, dimension reduction and clustering. It can be used in settings where users carry mobile devices and follow their normal routine. We aim for applications in short-lived indoor events such as conferences.

  @article{schaefermeier2021topological,
  abstract = {The ubiquitous presence of WiFi access points and mobile devices capable of measuring WiFi signal strengths allow for real-world applications in indoor localization and mapping. In particular, no additional infrastructure is required. Previous approaches in this field were, however, often hindered by problems such as effortful map-building processes, changing environments and hardware differences. We tackle these problems focussing on topological maps. These represent discrete locations, such as rooms, and their relations, e.g., distances and transition frequencies. In our unsupervised method, we employ WiFi signal strength distributions, dimension reduction and clustering. It can be used in settings where users carry mobile devices and follow their normal routine. We aim for applications in short-lived indoor events such as conferences.},
  author = {Schaefermeier, Bastian and Stumme, Gerd and Hanika, Tom},
  keywords = {wifi},
  note = {cite arxiv:2106.09789Comment: 18 pages},
  title = {Topological Indoor Mapping through WiFi Signals},
  year = 2021
  }
  

  %0 Journal Article
  %1 schaefermeier2021topological
  %A Schaefermeier, Bastian
  %A Stumme, Gerd
  %A Hanika, Tom
  %D 2021
  %T Topological Indoor Mapping through WiFi Signals
  %U http://arxiv.org/abs/2106.09789
  %X The ubiquitous presence of WiFi access points and mobile devices capable of measuring WiFi signal strengths allow for real-world applications in indoor localization and mapping. In particular, no additional infrastructure is required. Previous approaches in this field were, however, often hindered by problems such as effortful map-building processes, changing environments and hardware differences. We tackle these problems focussing on topological maps. These represent discrete locations, such as rooms, and their relations, e.g., distances and transition frequencies. In our unsupervised method, we employ WiFi signal strength distributions, dimension reduction and clustering. It can be used in settings where users carry mobile devices and follow their normal routine. We aim for applications in short-lived indoor events such as conferences.
  

• Dürrschnabel, D., Stumme, G.: Force-Directed Layout of Order Diagrams using Dimensional Reduction, http://arxiv.org/abs/2102.02684, (2021).

  URLBibTeXEndNote

  Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an experienced expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one optimizes on distances of nodes and the other on distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.

  @misc{durrschnabel2021forcedirected,
  abstract = {Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an experienced expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one optimizes on distances of nodes and the other on distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.},
  author = {Dürrschnabel, Dominik and Stumme, Gerd},
  keywords = {myown},
  note = {cite arxiv:2102.02684Comment: 16 pages, 6 figures, 4 algorithms, for source code refer to https://github.com/domduerr/redraw},
  title = {Force-Directed Layout of Order Diagrams using Dimensional Reduction},
  year = 2021
  }
  

  %0 Generic
  %1 durrschnabel2021forcedirected
  %A Dürrschnabel, Dominik
  %A Stumme, Gerd
  %D 2021
  %T Force-Directed Layout of Order Diagrams using Dimensional Reduction
  %U http://arxiv.org/abs/2102.02684
  %X Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an experienced expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one optimizes on distances of nodes and the other on distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.
  

• Stubbemann, M., Stumme, G.: The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks arXiv preprint arXiv:2110.13774. (2021).

  BibTeXEndNote

  @article{stubbemann2021mont,
  author = {Stubbemann, Maximilian and Stumme, Gerd},
  journal = {arXiv preprint arXiv:2110.13774},
  keywords = {regio},
  title = {The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks},
  year = 2021
  }
  

  %0 Journal Article
  %1 stubbemann2021mont
  %A Stubbemann, Maximilian
  %A Stumme, Gerd
  %D 2021
  %J arXiv preprint arXiv:2110.13774
  %T The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks
  

• Koyda, M., Stumme, G.: Boolean Substructures in Formal Concept Analysis ICFCA: International Conference on Formal Concept Analysis. pp. 38–53. Springer (2021).

  BibTeXEndNote

  @conference{koyda2021boolean,
  author = {Koyda, Maren and Stumme, Gerd},
  booktitle = {Formal Concept Analysis - 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings},
  journal = {ICFCA: International Conference on Formal Concept Analysis},
  keywords = {myown},
  pages = {38-53},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Boolean Substructures in Formal Concept Analysis},
  year = 2021
  }
  

  %0 Generic
  %1 koyda2021boolean
  %A Koyda, Maren
  %A Stumme, Gerd
  %B Formal Concept Analysis - 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings
  %D 2021
  %I Springer
  %J ICFCA: International Conference on Formal Concept Analysis
  %P 38-53
  %T Boolean Substructures in Formal Concept Analysis
  %@ 978-3-030-77866-8
  

• D{ü}rrschnabel, D., Koyda, M., Stumme, G.: Attribute Selection Using Contranominal Scales In: Braun, T., Gehrke, M., Hanika, T., and Hernandez, N. (eds.) Graph-Based Representation and Reasoning. pp. 127–141. Springer International Publishing, Cham (2021).

  BibTeXEndNote

  Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.

  @inproceedings{10.1007/978-3-030-86982-3_10,
  abstract = {Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.},
  address = {Cham},
  author = {D{ü}rrschnabel, Dominik and Koyda, Maren and Stumme, Gerd},
  booktitle = {Graph-Based Representation and Reasoning},
  editor = {Braun, Tanya and Gehrke, Marcel and Hanika, Tom and Hernandez, Nathalie},
  keywords = {myown},
  pages = {127--141},
  publisher = {Springer International Publishing},
  title = {Attribute Selection Using Contranominal Scales},
  year = 2021
  }
  

  %0 Conference Paper
  %1 10.1007/978-3-030-86982-3_10
  %A D{ü}rrschnabel, Dominik
  %A Koyda, Maren
  %A Stumme, Gerd
  %B Graph-Based Representation and Reasoning
  %C Cham
  %D 2021
  %E Braun, Tanya
  %E Gehrke, Marcel
  %E Hanika, Tom
  %E Hernandez, Nathalie
  %I Springer International Publishing
  %P 127--141
  %T Attribute Selection Using Contranominal Scales
  %X Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.
  %@ 978-3-030-86982-3
  

• D{ü}rrschnabel, D., Stumme, G.: Force-Directed Layout of Order Diagrams Using Dimensional Reduction In: Braud, A., Buzmakov, A., Hanika, T., and Le Ber, F. (eds.) Formal Concept Analysis. pp. 224–240. Springer International Publishing, Cham (2021).

  BibTeXEndNote

  Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.

  @inproceedings{10.1007/978-3-030-77867-5_14,
  abstract = {Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.},
  address = {Cham},
  author = {D{ü}rrschnabel, Dominik and Stumme, Gerd},
  booktitle = {Formal Concept Analysis},
  editor = {Braud, Agn{è}s and Buzmakov, Aleksey and Hanika, Tom and Le Ber, Florence},
  keywords = {spring_embedder},
  pages = {224--240},
  publisher = {Springer International Publishing},
  title = {Force-Directed Layout of Order Diagrams Using Dimensional Reduction},
  year = 2021
  }
  

  %0 Conference Paper
  %1 10.1007/978-3-030-77867-5_14
  %A D{ü}rrschnabel, Dominik
  %A Stumme, Gerd
  %B Formal Concept Analysis
  %C Cham
  %D 2021
  %E Braud, Agn{è}s
  %E Buzmakov, Aleksey
  %E Hanika, Tom
  %E Le Ber, Florence
  %I Springer International Publishing
  %P 224--240
  %T Force-Directed Layout of Order Diagrams Using Dimensional Reduction
  %X Order diagrams allow human analysts to understand and analyze structural properties of ordered data. While an expert can create easily readable order diagrams, the automatic generation of those remains a hard task. In this work, we adapt force-directed approaches, which are known to generate aesthetically-pleasing drawings of graphs, to the realm of order diagrams. Our algorithm ReDraw thereby embeds the order in a high dimension and then iteratively reduces the dimension until a two-dimensional drawing is achieved. To improve aesthetics, this reduction is equipped with two force-directed steps where one step optimizes the distances of nodes and the other one the distances of lines in order to satisfy a set of a priori fixed conditions. By respecting an invariant about the vertical position of the elements in each step of our algorithm we ensure that the resulting drawings satisfy all necessary properties of order diagrams. Finally, we present the results of a user study to demonstrate that our algorithm outperforms comparable approaches on drawings of lattices with a high degree of distributivity.
  %@ 978-3-030-77867-5
  

• Draude, C., Gruhl, C., Hornung, G., Kropf, J., Lamla, J., Leimeister, J.M., Sick, B., Stumme, G.: Social Machines Informatik Spektrum. (2021).

  URLBibTeXEndNote

  @article{2021,
  author = {Draude, Claude and Gruhl, Christian and Hornung, Gerrit and Kropf, Jonathan and Lamla, Jörn and Leimeister, Jan Marco and Sick, Bernhard and Stumme, Gerd},
  journal = {Informatik Spektrum},
  keywords = {myown},
  month = {nov},
  title = {Social Machines},
  year = 2021
  }
  

  %0 Journal Article
  %1 2021
  %A Draude, Claude
  %A Gruhl, Christian
  %A Hornung, Gerrit
  %A Kropf, Jonathan
  %A Lamla, Jörn
  %A Leimeister, Jan Marco
  %A Sick, Bernhard
  %A Stumme, Gerd
  %D 2021
  %J Informatik Spektrum
  %R 10.1007/s00287-021-01421-4
  %T Social Machines
  %U https://doi.org/10.1007%2Fs00287-021-01421-4
  

2020

• Stubbemann, M., Hanika, T., Stumme, G.: Orometric Methods in Bounded Metric Data In: Berthold, M.R., Feelders, A., and Krempl, G. (eds.) Advances in Intelligent Data Analysis {XVIII} - 18th International Symposium on Intelligent Data Analysis, {IDA} 2020, Konstanz, Germany, April 27-29, 2020, Proceedings. pp. 496–508. Springer (2020).

  URLBibTeXEndNote

  @inproceedings{stubbemann2020orometric,
  author = {Stubbemann, Maximilian and Hanika, Tom and Stumme, Gerd},
  booktitle = {Advances in Intelligent Data Analysis {XVIII} - 18th International Symposium on Intelligent Data Analysis, {IDA} 2020, Konstanz, Germany, April 27-29, 2020, Proceedings},
  editor = {Berthold, Michael R. and Feelders, Ad and Krempl, Georg},
  keywords = {science},
  pages = {496--508},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Orometric Methods in Bounded Metric Data},
  volume = 12080,
  year = 2020
  }
  

  %0 Conference Paper
  %1 stubbemann2020orometric
  %A Stubbemann, Maximilian
  %A Hanika, Tom
  %A Stumme, Gerd
  %B Advances in Intelligent Data Analysis {XVIII} - 18th International Symposium on Intelligent Data Analysis, {IDA} 2020, Konstanz, Germany, April 27-29, 2020, Proceedings
  %D 2020
  %E Berthold, Michael R.
  %E Feelders, Ad
  %E Krempl, Georg
  %I Springer
  %P 496--508
  %R 10.1007/978-3-030-44584-3\_39
  %T Orometric Methods in Bounded Metric Data
  %U https://doi.org/10.1007/978-3-030-44584-3\_39
  %V 12080
  

• Felde, M., Hanika, T., Stumme, G.: Null Models for Formal Contexts Information. 11, 135 (2020).

  URLBibTeXEndNote

  @article{felde2020null,
  author = {Felde, Maximilian and Hanika, Tom and Stumme, Gerd},
  journal = {Information},
  keywords = {science},
  number = 3,
  pages = 135,
  publisher = {Multidisciplinary Digital Publishing Institute},
  title = {Null Models for Formal Contexts},
  volume = 11,
  year = 2020
  }
  

  %0 Journal Article
  %1 felde2020null
  %A Felde, Maximilian
  %A Hanika, Tom
  %A Stumme, Gerd
  %D 2020
  %I Multidisciplinary Digital Publishing Institute
  %J Information
  %N 3
  %P 135
  %T Null Models for Formal Contexts
  %U https://www.mdpi.com/2078-2489/11/3/135
  %V 11
  

• Schäfermeier, B., Stumme, G., Hanika, T.: Topic Space Trajectories: A case study on machine learning literature, http://arxiv.org/abs/2010.12294, (2020).

  URLBibTeXEndNote

  The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present \emph{topic space trajectories}, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work.

  @misc{schafermeier2020topic,
  abstract = {The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present \emph{topic space trajectories}, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work.},
  author = {Schäfermeier, Bastian and Stumme, Gerd and Hanika, Tom},
  keywords = {publist},
  note = {cite arxiv:2010.12294Comment: 36 pages, 8 figures},
  title = {Topic Space Trajectories: A case study on machine learning literature},
  year = 2020
  }
  

  %0 Generic
  %1 schafermeier2020topic
  %A Schäfermeier, Bastian
  %A Stumme, Gerd
  %A Hanika, Tom
  %D 2020
  %T Topic Space Trajectories: A case study on machine learning literature
  %U http://arxiv.org/abs/2010.12294
  %X The annual number of publications at scientific venues, for example, conferences and journals, is growing quickly. Hence, even for researchers becomes harder and harder to keep track of research topics and their progress. In this task, researchers can be supported by automated publication analysis. Yet, many such methods result in uninterpretable, purely numerical representations. As an attempt to support human analysts, we present \emph{topic space trajectories}, a structure that allows for the comprehensible tracking of research topics. We demonstrate how these trajectories can be interpreted based on eight different analysis approaches. To obtain comprehensible results, we employ non-negative matrix factorization as well as suitable visualization techniques. We show the applicability of our approach on a publication corpus spanning 50 years of machine learning research from 32 publication venues. Our novel analysis method may be employed for paper classification, for the prediction of future research topics, and for the recommendation of fitting conferences and journals for submitting unpublished work.
  

• Hanika, T., Schneider, F.M., Stumme, G.: Intrinsic Dimension of Geometric Data Sets Accepted for publication in: Tohoku Mathematical Journal. (2020).

  URLBibTeXEndNote

  The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.

  @article{hanika2018intrinsic,
  abstract = {The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.},
  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},
  journal = {Accepted for publication in: Tohoku Mathematical Journal},
  keywords = {publist},
  note = {cite arxiv:1801.07985Comment: v2: completely rewritten 28 pages, 3 figures, 2 tables},
  title = {Intrinsic Dimension of Geometric Data Sets},
  year = 2020
  }
  

  %0 Journal Article
  %1 hanika2018intrinsic
  %A Hanika, Tom
  %A Schneider, Friedrich Martin
  %A Stumme, Gerd
  %D 2020
  %J Accepted for publication in: Tohoku Mathematical Journal
  %T Intrinsic Dimension of Geometric Data Sets
  %U http://arxiv.org/abs/1801.07985
  %X The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.
  

• Stumme, G.: On Ordinal Data Science and its role in Socially Acceptable ICTDesign In: Hentschel, A., Hornung, G., and Jandt, S. (eds.) Mensch – Technik – Umwelt: Verantwortung für eine sozialverträgliche Zukunft, Festschrift für Alexander Roßnagel zum 70. Geburtstag. pp. 181–198. Nomos, Baden-Baden (2020).

  BibTeXEndNote

  Comparing and ordering things is a basal ability of mankind for organizing its physical and social environment. While many hierarchical relationships can be derived from numerical measures like length or voltage, many others cannot appropriately be captured this way. We argue that the newly emerging field of data science up to now lacks engagement in developing analysis methods for such ordinal data. By the example of an already existing approach in this domain, Formal Concept Analysis, we will discuss its capabilities as a knowledge representation and argue – based on its philosophical foundations – why it is an important building block for socially acceptable IT design.

  @inbook{stumme2020ordinal,
  abstract = {Comparing and ordering things is a basal ability of mankind for organizing its physical and social environment. While many hierarchical relationships can be derived from numerical measures like length or voltage, many others cannot appropriately be captured this way. We argue that the newly emerging field of data science up to now lacks engagement in developing analysis methods for such ordinal data. By the example of an already existing approach in this domain, Formal Concept Analysis, we will discuss its capabilities as a knowledge representation and argue – based on its philosophical foundations – why it is an important building block for socially acceptable IT design.},
  address = {Baden-Baden},
  author = {Stumme, G.},
  booktitle = {Mensch – Technik – Umwelt: Verantwortung für eine sozialverträgliche Zukunft, Festschrift für Alexander Roßnagel zum 70. Geburtstag},
  editor = {Hentschel, A. and Hornung, G. and Jandt, S.},
  keywords = {myown},
  pages = {181-198},
  publisher = {Nomos},
  title = {On Ordinal Data Science and its role in Socially Acceptable ICTDesign},
  year = 2020
  }
  

  %0 Book Section
  %1 stumme2020ordinal
  %A Stumme, G.
  %B Mensch – Technik – Umwelt: Verantwortung für eine sozialverträgliche Zukunft, Festschrift für Alexander Roßnagel zum 70. Geburtstag
  %C Baden-Baden
  %D 2020
  %E Hentschel, A.
  %E Hornung, G.
  %E Jandt, S.
  %I Nomos
  %P 181-198
  %T On Ordinal Data Science and its role in Socially Acceptable ICTDesign
  %X Comparing and ordering things is a basal ability of mankind for organizing its physical and social environment. While many hierarchical relationships can be derived from numerical measures like length or voltage, many others cannot appropriately be captured this way. We argue that the newly emerging field of data science up to now lacks engagement in developing analysis methods for such ordinal data. By the example of an already existing approach in this domain, Formal Concept Analysis, we will discuss its capabilities as a knowledge representation and argue – based on its philosophical foundations – why it is an important building block for socially acceptable IT design.
  %@ 978-3-8487-7014-4
  

2019

• Hanika, T., Marx, M., Stumme, G.: Discovering Implicational Knowledge in Wikidata, http://arxiv.org/abs/1902.00916, (2019).

  URLBibTeXEndNote

  Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Examples include the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata. A distinguishing feature of Wikidata is that the knowledge is collaboratively edited and curated. While this greatly enhances the scope of Wikidata, it also makes it impossible for a single individual to grasp complex connections between properties or understand the global impact of edits in the graph. We apply Formal Concept Analysis to efficiently identify comprehensible implications that are implicitly present in the data. Although the complex structure of data modelling in Wikidata is not amenable to a direct approach, we overcome this limitation by extracting contextual representations of parts of Wikidata in a systematic fashion. We demonstrate the practical feasibility of our approach through several experiments and show that the results may lead to the discovery of interesting implicational knowledge. Besides providing a method for obtaining large real-world data sets for FCA, we sketch potential applications in offering semantic assistance for editing and curating Wikidata.

  @misc{hanika2019discovering,
  abstract = {Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Examples include the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata. A distinguishing feature of Wikidata is that the knowledge is collaboratively edited and curated. While this greatly enhances the scope of Wikidata, it also makes it impossible for a single individual to grasp complex connections between properties or understand the global impact of edits in the graph. We apply Formal Concept Analysis to efficiently identify comprehensible implications that are implicitly present in the data. Although the complex structure of data modelling in Wikidata is not amenable to a direct approach, we overcome this limitation by extracting contextual representations of parts of Wikidata in a systematic fashion. We demonstrate the practical feasibility of our approach through several experiments and show that the results may lead to the discovery of interesting implicational knowledge. Besides providing a method for obtaining large real-world data sets for FCA, we sketch potential applications in offering semantic assistance for editing and curating Wikidata.},
  author = {Hanika, Tom and Marx, Maximilian and Stumme, Gerd},
  keywords = {wikidata},
  note = {cite arxiv:1902.00916},
  title = {Discovering Implicational Knowledge in Wikidata},
  year = 2019
  }
  

  %0 Generic
  %1 hanika2019discovering
  %A Hanika, Tom
  %A Marx, Maximilian
  %A Stumme, Gerd
  %D 2019
  %T Discovering Implicational Knowledge in Wikidata
  %U http://arxiv.org/abs/1902.00916
  %X Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world. Examples include the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata. A distinguishing feature of Wikidata is that the knowledge is collaboratively edited and curated. While this greatly enhances the scope of Wikidata, it also makes it impossible for a single individual to grasp complex connections between properties or understand the global impact of edits in the graph. We apply Formal Concept Analysis to efficiently identify comprehensible implications that are implicitly present in the data. Although the complex structure of data modelling in Wikidata is not amenable to a direct approach, we overcome this limitation by extracting contextual representations of parts of Wikidata in a systematic fashion. We demonstrate the practical feasibility of our approach through several experiments and show that the results may lead to the discovery of interesting implicational knowledge. Besides providing a method for obtaining large real-world data sets for FCA, we sketch potential applications in offering semantic assistance for editing and curating Wikidata.
  

• Schäfermeier, B., Hanika, T., Stumme, G.: Distances for WiFi Based Topological Indoor Mapping 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous), November 12--14, 2019, Houston, TX, USA (2019).

  BibTeXEndNote

  For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.

  @inproceedings{schafermeier2019distances,
  abstract = {For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.},
  author = {Schäfermeier, Bastian and Hanika, Tom and Stumme, Gerd},
  booktitle = {16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous), November 12--14, 2019, Houston, TX, USA},
  keywords = {wifi},
  title = {Distances for WiFi Based Topological Indoor Mapping},
  year = 2019
  }
  

  %0 Conference Paper
  %1 schafermeier2019distances
  %A Schäfermeier, Bastian
  %A Hanika, Tom
  %A Stumme, Gerd
  %B 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous), November 12--14, 2019, Houston, TX, USA
  %D 2019
  %R 10.1145/3360774.3360780
  %T Distances for WiFi Based Topological Indoor Mapping
  %X For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.
  %@ 978-1-4503-7283-1/19/11
  

• Kibanov, M., Heiberger, R.H., R{ö}dder, S., Atzmueller, M., Stumme, G.: Social studies of scholarly life with sensor-based ethnographic observations Scientometrics. (2019).

  URLBibTeXEndNote

  Social network analysis is playing an increasingly important role in sociological studies. At the same time, new technologies such as wearable sensors make it possible to collect new types of social network data. We employed RFID tags to capture face-to-face interactions of participants of two consecutive Ph.D. retreats of a graduate school on climate research. We use this data in order to explore how it may support ethnographic observations and to gain further insights on scholarly interactions. The unique feature of the data is the opportunity to distinguish short and long conversations, which often have a different nature from a sociological point of view. Furthermore, an advantage of this data is the availability of socio-demographic, research-related, and situational attributes of participants. We show that, even though an interaction partner is often found rather randomly during coffee breaks of retreats, a strong homophily between participants from the same institutions or research areas exists. We identify cores of the networks and participants who play ambassador roles between communities, e.g., persons who visit the retreat for the second time are more likely to be ambassadors. Overall, we show the usefulness and potential of RFID tags for scientometric studies.

  @article{kibanov2019social,
  abstract = {Social network analysis is playing an increasingly important role in sociological studies. At the same time, new technologies such as wearable sensors make it possible to collect new types of social network data. We employed RFID tags to capture face-to-face interactions of participants of two consecutive Ph.D. retreats of a graduate school on climate research. We use this data in order to explore how it may support ethnographic observations and to gain further insights on scholarly interactions. The unique feature of the data is the opportunity to distinguish short and long conversations, which often have a different nature from a sociological point of view. Furthermore, an advantage of this data is the availability of socio-demographic, research-related, and situational attributes of participants. We show that, even though an interaction partner is often found rather randomly during coffee breaks of retreats, a strong homophily between participants from the same institutions or research areas exists. We identify cores of the networks and participants who play ambassador roles between communities, e.g., persons who visit the retreat for the second time are more likely to be ambassadors. Overall, we show the usefulness and potential of RFID tags for scientometric studies.},
  author = {Kibanov, Mark and Heiberger, Raphael H. and R{ö}dder, Simone and Atzmueller, Martin and Stumme, Gerd},
  journal = {Scientometrics},
  keywords = {social},
  month = {may},
  title = {Social studies of scholarly life with sensor-based ethnographic observations},
  year = 2019
  }
  

  %0 Journal Article
  %1 kibanov2019social
  %A Kibanov, Mark
  %A Heiberger, Raphael H.
  %A R{ö}dder, Simone
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %D 2019
  %J Scientometrics
  %R 10.1007/s11192-019-03097-w
  %T Social studies of scholarly life with sensor-based ethnographic observations
  %U https://doi.org/10.1007/s11192-019-03097-w
  %X Social network analysis is playing an increasingly important role in sociological studies. At the same time, new technologies such as wearable sensors make it possible to collect new types of social network data. We employed RFID tags to capture face-to-face interactions of participants of two consecutive Ph.D. retreats of a graduate school on climate research. We use this data in order to explore how it may support ethnographic observations and to gain further insights on scholarly interactions. The unique feature of the data is the opportunity to distinguish short and long conversations, which often have a different nature from a sociological point of view. Furthermore, an advantage of this data is the availability of socio-demographic, research-related, and situational attributes of participants. We show that, even though an interaction partner is often found rather randomly during coffee breaks of retreats, a strong homophily between participants from the same institutions or research areas exists. We identify cores of the networks and participants who play ambassador roles between communities, e.g., persons who visit the retreat for the second time are more likely to be ambassadors. Overall, we show the usefulness and potential of RFID tags for scientometric studies.
  

• Hanika, T., Herde, M., Kuhn, J., Leimeister, J.M., Lukowicz, P., Oeste-Reiß, S., Schmidt, A., Sick, B., Stumme, G., Tomforde, S., Zweig, K.A.: Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields. CoRR. abs/1905.07264, (2019).

  URLBibTeXEndNote

  @article{journals/corr/abs-1905-07264,
  author = {Hanika, Tom and Herde, Marek and Kuhn, Jochen and Leimeister, Jan Marco and Lukowicz, Paul and Oeste-Reiß, Sarah and Schmidt, Albrecht and Sick, Bernhard and Stumme, Gerd and Tomforde, Sven and Zweig, Katharina Anna},
  journal = {CoRR},
  keywords = {publist},
  title = {Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields.},
  volume = {abs/1905.07264},
  year = 2019
  }
  

  %0 Journal Article
  %1 journals/corr/abs-1905-07264
  %A Hanika, Tom
  %A Herde, Marek
  %A Kuhn, Jochen
  %A Leimeister, Jan Marco
  %A Lukowicz, Paul
  %A Oeste-Reiß, Sarah
  %A Schmidt, Albrecht
  %A Sick, Bernhard
  %A Stumme, Gerd
  %A Tomforde, Sven
  %A Zweig, Katharina Anna
  %D 2019
  %J CoRR
  %T Collaborative Interactive Learning - A clarification of terms and a differentiation from other research fields.
  %U http://dblp.uni-trier.de/db/journals/corr/corr1905.html#abs-1905-07264
  %V abs/1905.07264
  

• Dürrschnabel, D., Hanika, T., Stumme, G.: DimDraw - A Novel Tool for Drawing Concept Lattices. In: Cristea, D., Ber, F.L., Missaoui, R., Kwuida, L., and Sertkaya, B. (eds.) ICFCA (Supplements). pp. 60–64. CEUR-WS.org (2019).

  URLBibTeXEndNote

  @inproceedings{conf/icfca/DurrschnabelHS19,
  author = {Dürrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},
  booktitle = {ICFCA (Supplements)},
  crossref = {conf/icfca/2019suppl},
  editor = {Cristea, Diana and Ber, Florence Le and Missaoui, Rokia and Kwuida, Léonard and Sertkaya, Baris},
  keywords = {publist},
  pages = {60-64},
  publisher = {CEUR-WS.org},
  series = {CEUR Workshop Proceedings},
  title = {DimDraw - A Novel Tool for Drawing Concept Lattices.},
  volume = 2378,
  year = 2019
  }
  

  %0 Conference Paper
  %1 conf/icfca/DurrschnabelHS19
  %A Dürrschnabel, Dominik
  %A Hanika, Tom
  %A Stumme, Gerd
  %B ICFCA (Supplements)
  %D 2019
  %E Cristea, Diana
  %E Ber, Florence Le
  %E Missaoui, Rokia
  %E Kwuida, Léonard
  %E Sertkaya, Baris
  %I CEUR-WS.org
  %P 60-64
  %T DimDraw - A Novel Tool for Drawing Concept Lattices.
  %U http://dblp.uni-trier.de/db/conf/icfca/icfca2019suppl.html#DurrschnabelHS19
  %V 2378
  

• Hanika, T., Marx, M., Stumme, G.: Discovering Implicational Knowledge in Wikidata. In: Cristea, D., Ber, F.L., and Sertkaya, B. (eds.) ICFCA. pp. 315–323. Springer (2019).

  URLBibTeXEndNote

  @inproceedings{conf/icfca/Hanika0S19,
  author = {Hanika, Tom and Marx, Maximilian and Stumme, Gerd},
  booktitle = {ICFCA},
  crossref = {conf/icfca/2019},
  editor = {Cristea, Diana and Ber, Florence Le and Sertkaya, Baris},
  keywords = {publist},
  pages = {315-323},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Discovering Implicational Knowledge in Wikidata.},
  volume = 11511,
  year = 2019
  }
  

  %0 Conference Paper
  %1 conf/icfca/Hanika0S19
  %A Hanika, Tom
  %A Marx, Maximilian
  %A Stumme, Gerd
  %B ICFCA
  %D 2019
  %E Cristea, Diana
  %E Ber, Florence Le
  %E Sertkaya, Baris
  %I Springer
  %P 315-323
  %T Discovering Implicational Knowledge in Wikidata.
  %U http://dblp.uni-trier.de/db/conf/icfca/icfca2019.html#Hanika0S19
  %V 11511
  %@ 978-3-030-21462-3
  

• Stubbemann, M., Hanika, T., Stumme, G.: Orometric Methods in Bounded Metric Data. CoRR. abs/1907.09239, (2019).

  URLBibTeXEndNote

  @article{journals/corr/abs-1907-09239,
  author = {Stubbemann, Maximilian and Hanika, Tom and Stumme, Gerd},
  journal = {CoRR},
  keywords = {regio},
  title = {Orometric Methods in Bounded Metric Data.},
  volume = {abs/1907.09239},
  year = 2019
  }
  

  %0 Journal Article
  %1 journals/corr/abs-1907-09239
  %A Stubbemann, Maximilian
  %A Hanika, Tom
  %A Stumme, Gerd
  %D 2019
  %J CoRR
  %T Orometric Methods in Bounded Metric Data.
  %U http://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-09239
  %V abs/1907.09239
  

• Dürrschnabel, D., Hanika, T., Stumme, G.: Drawing Order Diagrams Through Two-Dimension Extension, http://arxiv.org/abs/1906.06208, (2019).

  URLBibTeXEndNote

  Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.

  @misc{durrschnabel2019drawing,
  abstract = {Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.},
  author = {Dürrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},
  keywords = {publist},
  note = {cite arxiv:1906.06208Comment: 16 pages, 12 Figures},
  title = {Drawing Order Diagrams Through Two-Dimension Extension},
  year = 2019
  }
  

  %0 Generic
  %1 durrschnabel2019drawing
  %A Dürrschnabel, Dominik
  %A Hanika, Tom
  %A Stumme, Gerd
  %D 2019
  %T Drawing Order Diagrams Through Two-Dimension Extension
  %U http://arxiv.org/abs/1906.06208
  %X Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding graph.
  

• Dürrschnabel, D., Hanika, T., Stumme, G.: Drawing Order Diagrams Through Two-Dimension Extension. CoRR. abs/1906.06208, (2019).

  URLBibTeXEndNote

  @article{journals/corr/abs-1906-06208,
  author = {Dürrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},
  journal = {CoRR},
  keywords = {pos},
  title = {Drawing Order Diagrams Through Two-Dimension Extension.},
  volume = {abs/1906.06208},
  year = 2019
  }
  

  %0 Journal Article
  %1 journals/corr/abs-1906-06208
  %A Dürrschnabel, Dominik
  %A Hanika, Tom
  %A Stumme, Gerd
  %D 2019
  %J CoRR
  %T Drawing Order Diagrams Through Two-Dimension Extension.
  %U http://dblp.uni-trier.de/db/journals/corr/corr1906.html#abs-1906-06208
  %V abs/1906.06208
  

• Felde, M., Stumme, G.: Interactive Collaborative Exploration using Incomplete Contexts, https://arxiv.org/abs/1908.08740, (2019).

  URLBibTeXEndNote

  A common representation of information about relations of objects and attributes in knowledge domains are data-tables. The structure of such information can be analysed using Formal Concept Analysis (FCA). Attribute exploration is a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert. However, in general no single expert is capable (time- and knowledge-wise) of exploring knowledge domains alone. Therefore it is important to develop methods that allow multiple experts to explore domains together. To this end we build upon results on representation of incomplete knowledge [2, 8-10], adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy. Furthermore we discuss ways of comparing collaboration strategies and suggest avenues for future research.

  @misc{felde2019interactive,
  abstract = {A common representation of information about relations of objects and attributes in knowledge domains are data-tables. The structure of such information can be analysed using Formal Concept Analysis (FCA). Attribute exploration is a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert. However, in general no single expert is capable (time- and knowledge-wise) of exploring knowledge domains alone. Therefore it is important to develop methods that allow multiple experts to explore domains together. To this end we build upon results on representation of incomplete knowledge [2, 8-10], adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy. Furthermore we discuss ways of comparing collaboration strategies and suggest avenues for future research.},
  author = {Felde, Maximilian and Stumme, Gerd},
  keywords = {myown},
  title = {Interactive Collaborative Exploration using Incomplete Contexts},
  year = 2019
  }
  

  %0 Generic
  %1 felde2019interactive
  %A Felde, Maximilian
  %A Stumme, Gerd
  %D 2019
  %T Interactive Collaborative Exploration using Incomplete Contexts
  %U https://arxiv.org/abs/1908.08740
  %X A common representation of information about relations of objects and attributes in knowledge domains are data-tables. The structure of such information can be analysed using Formal Concept Analysis (FCA). Attribute exploration is a knowledge acquisition method from FCA that reveals dependencies in a set of attributes with help of a domain expert. However, in general no single expert is capable (time- and knowledge-wise) of exploring knowledge domains alone. Therefore it is important to develop methods that allow multiple experts to explore domains together. To this end we build upon results on representation of incomplete knowledge [2, 8-10], adapt the corresponding version of attribute exploration to fit the setting of multiple experts and suggest formalizations for key components like expert knowledge, interaction and collaboration strategy. Furthermore we discuss ways of comparing collaboration strategies and suggest avenues for future research.
  

• Hanika, T., Koyda, M., Stumme, G.: Relevant Attributes in Formal Contexts. In: Endres, D., Alam, M., and Sotropa, D. (eds.) ICCS. pp. 102–116. Springer (2019).

  URLBibTeXEndNote

  @inproceedings{conf/iccs/HanikaKS19,
  author = {Hanika, Tom and Koyda, Maren and Stumme, Gerd},
  booktitle = {ICCS},
  crossref = {conf/iccs/2019},
  editor = {Endres, Dominik and Alam, Mehwish and Sotropa, Diana},
  keywords = {publist},
  pages = {102-116},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Relevant Attributes in Formal Contexts.},
  volume = 11530,
  year = 2019
  }
  

  %0 Conference Paper
  %1 conf/iccs/HanikaKS19
  %A Hanika, Tom
  %A Koyda, Maren
  %A Stumme, Gerd
  %B ICCS
  %D 2019
  %E Endres, Dominik
  %E Alam, Mehwish
  %E Sotropa, Diana
  %I Springer
  %P 102-116
  %T Relevant Attributes in Formal Contexts.
  %U http://dblp.uni-trier.de/db/conf/iccs/iccs2019.html#HanikaKS19
  %V 11530
  %@ 978-3-030-23182-8
  

• Schaefermeier, B., Hanika, T., Stumme, G.: Distances for wifi based topological indoor mapping Proceedings of the 16th {EAI} International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services. {ACM} (2019).

  URLBibTeXEndNote

  @inproceedings{schaefermeier2019distances,
  author = {Schaefermeier, Bastian and Hanika, Tom and Stumme, Gerd},
  booktitle = {Proceedings of the 16th {EAI} International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services},
  keywords = {science},
  month = {nov},
  publisher = {{ACM}},
  title = {Distances for wifi based topological indoor mapping},
  year = 2019
  }
  

  %0 Conference Paper
  %1 schaefermeier2019distances
  %A Schaefermeier, Bastian
  %A Hanika, Tom
  %A Stumme, Gerd
  %B Proceedings of the 16th {EAI} International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services
  %D 2019
  %I {ACM}
  %R 10.1145/3360774.3360780
  %T Distances for wifi based topological indoor mapping
  %U https://doi.org/10.1145%2F3360774.3360780
  

2018

• Doerfel, S., Hanika, T., Stumme, G.: Clones in Graphs. In: Ceci, M., Japkowicz, N., Liu, J., Papadopoulos, G.A., and Ras, Z.W. (eds.) ISMIS. pp. 56–66. Springer (2018).

  URLBibTeXEndNote

  @inproceedings{conf/ismis/DoerfelHS18,
  author = {Doerfel, Stephan and Hanika, Tom and Stumme, Gerd},
  booktitle = {ISMIS},
  crossref = {conf/ismis/2018},
  editor = {Ceci, Michelangelo and Japkowicz, Nathalie and Liu, Jiming and Papadopoulos, George A. and Ras, Zbigniew W.},
  keywords = {myown},
  pages = {56-66},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Clones in Graphs.},
  volume = 11177,
  year = 2018
  }
  

  %0 Conference Paper
  %1 conf/ismis/DoerfelHS18
  %A Doerfel, Stephan
  %A Hanika, Tom
  %A Stumme, Gerd
  %B ISMIS
  %D 2018
  %E Ceci, Michelangelo
  %E Japkowicz, Nathalie
  %E Liu, Jiming
  %E Papadopoulos, George A.
  %E Ras, Zbigniew W.
  %I Springer
  %P 56-66
  %T Clones in Graphs.
  %U http://dblp.uni-trier.de/db/conf/ismis/ismis2018.html#DoerfelHS18
  %V 11177
  %@ 978-3-030-01851-1
  

• Hanika, T., Schneider, F.M., Stumme, G.: Intrinsic Dimension of Geometric Data Sets, http://arxiv.org/abs/1801.07985, (2018).

  URLBibTeXEndNote

  The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.

  @misc{hanika2018intrinsic,
  abstract = {The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.},
  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},
  keywords = {myown},
  note = {cite arxiv:1801.07985Comment: v2: completely rewritten 28 pages, 3 figures, 2 tables},
  title = {Intrinsic Dimension of Geometric Data Sets},
  year = 2018
  }
  

  %0 Generic
  %1 hanika2018intrinsic
  %A Hanika, Tom
  %A Schneider, Friedrich Martin
  %A Stumme, Gerd
  %D 2018
  %T Intrinsic Dimension of Geometric Data Sets
  %U http://arxiv.org/abs/1801.07985
  %X The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our mathematical model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.
  

• Hanika, T., Koyda, M., Stumme, G.: Relevant Attributes in Formal Contexts. CoRR. abs/1812.08868, (2018).

  URLBibTeXEndNote

  @article{journals/corr/abs-1812-08868,
  author = {Hanika, Tom and Koyda, Maren and Stumme, Gerd},
  journal = {CoRR},
  keywords = {relevance},
  title = {Relevant Attributes in Formal Contexts.},
  volume = {abs/1812.08868},
  year = 2018
  }
  

  %0 Journal Article
  %1 journals/corr/abs-1812-08868
  %A Hanika, Tom
  %A Koyda, Maren
  %A Stumme, Gerd
  %D 2018
  %J CoRR
  %T Relevant Attributes in Formal Contexts.
  %U http://dblp.uni-trier.de/db/journals/corr/corr1812.html#abs-1812-08868
  %V abs/1812.08868
  

• Hanika, T., Schneider, F.M., Stumme, G.: Intrinsic dimension of concept lattices CoRR. abs/1801.07985, (2018).

  URLBibTeXEndNote

  Geometric analysis is a very capable theory to understand the influence of the high dimensionality of the input data in machine learning (ML) and knowledge discovery (KD). With our approach we can assess how far the application of a specific KD/ML-algorithm to a concrete data set is prone to the curse of dimensionality. To this end we extend V.~Pestov's axiomatic approach to the instrinsic dimension of data sets, based on the seminal work by M.~Gromov on concentration phenomena, and provide an adaptable and computationally feasible model for studying observable geometric invariants associated to features that are natural to both the data and the learning procedure. In detail, we investigate data represented by formal contexts and give first theoretical as well as experimental insights into the intrinsic dimension of a concept lattice. Because of the correspondence between formal concepts and maximal cliques in graphs, applications to social network analysis are at hand.

  @article{hanika2018intrinsic,
  abstract = {Geometric analysis is a very capable theory to understand the influence of the high dimensionality of the input data in machine learning (ML) and knowledge discovery (KD). With our approach we can assess how far the application of a specific KD/ML-algorithm to a concrete data set is prone to the curse of dimensionality. To this end we extend V.~Pestov's axiomatic approach to the instrinsic dimension of data sets, based on the seminal work by M.~Gromov on concentration phenomena, and provide an adaptable and computationally feasible model for studying observable geometric invariants associated to features that are natural to both the data and the learning procedure. In detail, we investigate data represented by formal contexts and give first theoretical as well as experimental insights into the intrinsic dimension of a concept lattice. Because of the correspondence between formal concepts and maximal cliques in graphs, applications to social network analysis are at hand.},
  author = {Hanika, Tom and Schneider, Friedrich Martin and Stumme, Gerd},
  journal = {CoRR},
  keywords = {publist},
  note = {cite arxiv:1801.07985Comment: 13 pages, 3 figures},
  title = {Intrinsic dimension of concept lattices},
  volume = {abs/1801.07985},
  year = 2018
  }
  

  %0 Journal Article
  %1 hanika2018intrinsic
  %A Hanika, Tom
  %A Schneider, Friedrich Martin
  %A Stumme, Gerd
  %D 2018
  %J CoRR
  %T Intrinsic dimension of concept lattices
  %U http://arxiv.org/abs/1801.07985
  %V abs/1801.07985
  %X Geometric analysis is a very capable theory to understand the influence of the high dimensionality of the input data in machine learning (ML) and knowledge discovery (KD). With our approach we can assess how far the application of a specific KD/ML-algorithm to a concrete data set is prone to the curse of dimensionality. To this end we extend V.~Pestov's axiomatic approach to the instrinsic dimension of data sets, based on the seminal work by M.~Gromov on concentration phenomena, and provide an adaptable and computationally feasible model for studying observable geometric invariants associated to features that are natural to both the data and the learning procedure. In detail, we investigate data represented by formal contexts and give first theoretical as well as experimental insights into the intrinsic dimension of a concept lattice. Because of the correspondence between formal concepts and maximal cliques in graphs, applications to social network analysis are at hand.
  

• Kibanov, M., Becker, M., Müller, J., Atzmueller, M., Hotho, A., Stumme, G.: {Adaptive kNN Using Expected Accuracy for Classification of Geo-Spatial Data} Proc. 33rd ACM Symposium On Applied Computing. ACM Press, New York, NY, USA (2018).

  BibTeXEndNote

  @inproceedings{KBMAHS:18,
  address = {New York, NY, USA},
  author = {Kibanov, Mark and Becker, Martin and Müller, Jürgen and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proc. 33rd ACM Symposium On Applied Computing},
  keywords = {spatial},
  publisher = {ACM Press},
  title = {{Adaptive kNN Using Expected Accuracy for Classification of Geo-Spatial Data}},
  year = 2018
  }
  

  %0 Conference Paper
  %1 KBMAHS:18
  %A Kibanov, Mark
  %A Becker, Martin
  %A Müller, Jürgen
  %A Atzmueller, Martin
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proc. 33rd ACM Symposium On Applied Computing
  %C New York, NY, USA
  %D 2018
  %I ACM Press
  %T {Adaptive kNN Using Expected Accuracy for Classification of Geo-Spatial Data}
  

• Navarro Bullock, B., Hotho, A., Stumme, G.: Accessing Information with Tags: Search and Ranking In: Brusilovsky, P. and He, D. (eds.) Social Information Access: Systems and Technologies. pp. 310–343. Springer International Publishing, Cham (2018).

  URLBibTeXEndNote

  With the growth of the Social Web, a variety of new web-based services arose and changed the way users interact with the internet and consume information. One central phenomenon was and is tagging which allows to manage, organize and access information in social systems. Tagging helps to manage all kinds of resources, making their access much easier. The first type of social tagging systems were social bookmarking systems, i.e., platforms for storing and sharing bookmarks on the web rather than just in the browser. Meanwhile, (hash-)tagging is central in many other Social Media systems such as social networking sites and micro-blogging platforms. To allow for efficient information access, special algorithms have been developed to guide the user, to search for information and to rank the content based on tagging information contributed by the users.

  @inbook{NavarroBullock2018,
  abstract = {With the growth of the Social Web, a variety of new web-based services arose and changed the way users interact with the internet and consume information. One central phenomenon was and is tagging which allows to manage, organize and access information in social systems. Tagging helps to manage all kinds of resources, making their access much easier. The first type of social tagging systems were social bookmarking systems, i.e., platforms for storing and sharing bookmarks on the web rather than just in the browser. Meanwhile, (hash-)tagging is central in many other Social Media systems such as social networking sites and micro-blogging platforms. To allow for efficient information access, special algorithms have been developed to guide the user, to search for information and to rank the content based on tagging information contributed by the users.},
  address = {Cham},
  author = {Navarro Bullock, Beate and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Social Information Access: Systems and Technologies},
  editor = {Brusilovsky, Peter and He, Daqing},
  keywords = {tag},
  pages = {310--343},
  publisher = {Springer International Publishing},
  title = {Accessing Information with Tags: Search and Ranking},
  year = 2018
  }
  

  %0 Book Section
  %1 NavarroBullock2018
  %A Navarro Bullock, Beate
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Social Information Access: Systems and Technologies
  %C Cham
  %D 2018
  %E Brusilovsky, Peter
  %E He, Daqing
  %I Springer International Publishing
  %P 310--343
  %R 10.1007/978-3-319-90092-6_9
  %T Accessing Information with Tags: Search and Ranking
  %U https://doi.org/10.1007/978-3-319-90092-6_9
  %X With the growth of the Social Web, a variety of new web-based services arose and changed the way users interact with the internet and consume information. One central phenomenon was and is tagging which allows to manage, organize and access information in social systems. Tagging helps to manage all kinds of resources, making their access much easier. The first type of social tagging systems were social bookmarking systems, i.e., platforms for storing and sharing bookmarks on the web rather than just in the browser. Meanwhile, (hash-)tagging is central in many other Social Media systems such as social networking sites and micro-blogging platforms. To allow for efficient information access, special algorithms have been developed to guide the user, to search for information and to rank the content based on tagging information contributed by the users.
  %@ 978-3-319-90092-6
  

• Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Analyzing Group Interaction on Networks of Face-to-Face Proximity using Wearable Sensors} Proc. IEEE International Conference on Future IoT Technologies. IEEE Press, Boston, MA, USA (2018).

  URLBibTeXEndNote

  @inproceedings{ATSK:18,
  address = {Boston, MA, USA},
  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},
  booktitle = {Proc. IEEE International Conference on Future IoT Technologies},
  keywords = {social},
  publisher = {IEEE Press},
  title = {{Analyzing Group Interaction on Networks of Face-to-Face Proximity using Wearable Sensors}},
  year = 2018
  }
  

  %0 Conference Paper
  %1 ATSK:18
  %A Atzmueller, Martin
  %A Thiele, Lisa
  %A Stumme, Gerd
  %A Kauffeld, Simone
  %B Proc. IEEE International Conference on Future IoT Technologies
  %C Boston, MA, USA
  %D 2018
  %I IEEE Press
  %T {Analyzing Group Interaction on Networks of Face-to-Face Proximity using Wearable Sensors}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2018-FutureIoT-Atzmueller-DSNA.pdf
  

• Thiele, L., Atzmueller, M., Stumme, G., Kauffeld, S.: {Frequent and/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Developmental Peer Network Relationships} Psychology. (2018).

  BibTeXEndNote

  @article{TASK:18,
  author = {Thiele, Lisa and Atzmueller, Martin and Stumme, Gerd and Kauffeld, Simone},
  journal = {Psychology},
  keywords = {social},
  month = {(In Press)},
  title = {{Frequent and/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Developmental Peer Network Relationships}},
  year = 2018
  }
  

  %0 Journal Article
  %1 TASK:18
  %A Thiele, Lisa
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %A Kauffeld, Simone
  %D 2018
  %J Psychology
  %T {Frequent and/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Developmental Peer Network Relationships}
  

• Doerfel, S., Hanika, T., Stumme, G.: Clones in Social Networks CoRR. abs/1802.07849, (2018).

  URLBibTeXEndNote

  It is well known that any bipartite (social) network can be regarded as a formal context $(G,M,I)$. Therefore, such networks give raise to formal concept lattices which can be investigated utilizing the toolset of Formal Concept Analysis (FCA). In particular, the notion of clones in closure systems on $M$, i.e., pairwise interchangeable attributes that leave the closure system unchanged, suggests itself naturally as a candidate to be analyzed in the realm of FCA based social network analysis. In this study, we investigate the notion of clones in social networks. After building up some theoretical background for the clone relation in formal contexts we try to find clones in real word data sets. To this end, we provide an experimental evaluation on nine mostly well known social networks and provide some first insights on the impact of clones. We conclude our work by nourishing the understanding of clones by generalizing those to permutations of higher order.

  @article{doerfel2018clones,
  abstract = {It is well known that any bipartite (social) network can be regarded as a formal context $(G,M,I)$. Therefore, such networks give raise to formal concept lattices which can be investigated utilizing the toolset of Formal Concept Analysis (FCA). In particular, the notion of clones in closure systems on $M$, i.e., pairwise interchangeable attributes that leave the closure system unchanged, suggests itself naturally as a candidate to be analyzed in the realm of FCA based social network analysis. In this study, we investigate the notion of clones in social networks. After building up some theoretical background for the clone relation in formal contexts we try to find clones in real word data sets. To this end, we provide an experimental evaluation on nine mostly well known social networks and provide some first insights on the impact of clones. We conclude our work by nourishing the understanding of clones by generalizing those to permutations of higher order.},
  author = {Doerfel, Stephan and Hanika, Tom and Stumme, Gerd},
  journal = {CoRR},
  keywords = {social},
  note = {cite arxiv:1802.07849Comment: 12 pages, 2 figures, 2 tables},
  title = {Clones in Social Networks},
  volume = {abs/1802.07849},
  year = 2018
  }
  

  %0 Journal Article
  %1 doerfel2018clones
  %A Doerfel, Stephan
  %A Hanika, Tom
  %A Stumme, Gerd
  %D 2018
  %J CoRR
  %T Clones in Social Networks
  %U http://arxiv.org/abs/1802.07849
  %V abs/1802.07849
  %X It is well known that any bipartite (social) network can be regarded as a formal context $(G,M,I)$. Therefore, such networks give raise to formal concept lattices which can be investigated utilizing the toolset of Formal Concept Analysis (FCA). In particular, the notion of clones in closure systems on $M$, i.e., pairwise interchangeable attributes that leave the closure system unchanged, suggests itself naturally as a candidate to be analyzed in the realm of FCA based social network analysis. In this study, we investigate the notion of clones in social networks. After building up some theoretical background for the clone relation in formal contexts we try to find clones in real word data sets. To this end, we provide an experimental evaluation on nine mostly well known social networks and provide some first insights on the impact of clones. We conclude our work by nourishing the understanding of clones by generalizing those to permutations of higher order.
  

• Thiele, L., Atzmueller, M., Stumme, G., Kauffeld, S.: Frequent and/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Students’ Developmental Peer Network Relationships Psychology. 09, 633–654 (2018).

  URLBibTeXEndNote

  @article{thiele2018frequent,
  author = {Thiele, Lisa and Atzmueller, Martin and Stumme, Gerd and Kauffeld, Simone},
  journal = {Psychology},
  keywords = {myown},
  number = {04},
  pages = {633--654},
  publisher = {Scientific Research Publishing, Inc,},
  title = {Frequent and/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Students' Developmental Peer Network Relationships},
  volume = {09},
  year = 2018
  }
  

  %0 Journal Article
  %1 thiele2018frequent
  %A Thiele, Lisa
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %A Kauffeld, Simone
  %D 2018
  %I Scientific Research Publishing, Inc,
  %J Psychology
  %N 04
  %P 633--654
  %R 10.4236/psych.2018.94040
  %T Frequent and/or Durable? The Predictive Impact of Initial Face-to-Face Contacts on the Formation and Evolution of Students' Developmental Peer Network Relationships
  %U https://doi.org/10.4236%2Fpsych.2018.94040
  %V 09
  

• Schäfermeier, B., Hanika, T., Stumme, G.: Distances for WiFi Based Topological Indoor Mapping, http://arxiv.org/abs/1809.07405, (2018).

  URLBibTeXEndNote

  For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.

  @misc{schafermeier2018distances,
  abstract = {For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.},
  author = {Schäfermeier, Bastian and Hanika, Tom and Stumme, Gerd},
  keywords = {wifi},
  note = {cite arxiv:1809.07405Comment: 10 pages, 6 figures},
  title = {Distances for WiFi Based Topological Indoor Mapping},
  year = 2018
  }
  

  %0 Generic
  %1 schafermeier2018distances
  %A Schäfermeier, Bastian
  %A Hanika, Tom
  %A Stumme, Gerd
  %D 2018
  %T Distances for WiFi Based Topological Indoor Mapping
  %U http://arxiv.org/abs/1809.07405
  %X For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In particular, we show that among the considered distance measures the Earth Mover's Distance seems the most beneficial for the localization task. Combined with kernel density estimation we were able to retain the topological structure of rooms in a real-world office scenario.
  

• Schmidt, A., Stumme, G.: Prominence and Dominance in Networks In: Faron Zucker, C., Ghidini, C., Napoli, A., and Yannick, T. (eds.) Proceedings of the 21th International Conference on Knowledge Engineering and Knowledge Management (EKAW). pp. 370–385. Springer (2018).

  BibTeXEndNote

  @inproceedings{schmidt2018prominence,
  author = {Schmidt, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 21th International Conference on Knowledge Engineering and Knowledge Management (EKAW)},
  editor = {Faron Zucker, Catherine and Ghidini, Chiara and Napoli, Amedeo and Yannick, Toussaint},
  keywords = {topographic},
  pages = {370-385},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Prominence and Dominance in Networks},
  year = 2018
  }
  

  %0 Conference Paper
  %1 schmidt2018prominence
  %A Schmidt, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 21th International Conference on Knowledge Engineering and Knowledge Management (EKAW)
  %D 2018
  %E Faron Zucker, Catherine
  %E Ghidini, Chiara
  %E Napoli, Amedeo
  %E Yannick, Toussaint
  %I Springer
  %P 370-385
  %T Prominence and Dominance in Networks
  

2017

• Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Contact Patterns, Group Interaction and Dynamics on Socio-Behavioral Multiplex Networks} Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017). Eindhoven University of Technology, Eindhoven, The Netherlands (2017).

  URLBibTeXEndNote

  @inproceedings{ATSK:17,
  address = {Eindhoven, The Netherlands},
  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},
  booktitle = {Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)},
  keywords = {ubicon},
  publisher = {Eindhoven University of Technology},
  title = {{Contact Patterns, Group Interaction and Dynamics on Socio-Behavioral Multiplex Networks}},
  year = 2017
  }
  

  %0 Conference Paper
  %1 ATSK:17
  %A Atzmueller, Martin
  %A Thiele, Lisa
  %A Stumme, Gerd
  %A Kauffeld, Simone
  %B Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017)
  %C Eindhoven, The Netherlands
  %D 2017
  %I Eindhoven University of Technology
  %T {Contact Patterns, Group Interaction and Dynamics on Socio-Behavioral Multiplex Networks}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2017-atzmueller-bl-connectu-preprint.pdf
  

• Loreto, V., Haklay, M., Hotho, A., Servedio, V.C.P., Stumme, G., Theunis, J., Tria, F. eds.: Participatory sensing, opinions and collective awareness Springer (2017).

  BibTeXEndNote

  @book{loreto2017participatory,
  editor = {Loreto, Vittorio and Haklay, Mordechai and Hotho, Andreas and Servedio, Vito C. P. and Stumme, Gerd and Theunis, Jan and Tria, Francesca},
  keywords = {myown},
  publisher = {Springer},
  title = {Participatory sensing, opinions and collective awareness},
  year = 2017
  }
  

  %0 Book
  %1 loreto2017participatory
  %D 2017
  %E Loreto, Vittorio
  %E Haklay, Mordechai
  %E Hotho, Andreas
  %E Servedio, Vito C. P.
  %E Stumme, Gerd
  %E Theunis, Jan
  %E Tria, Francesca
  %I Springer
  %T Participatory sensing, opinions and collective awareness
  %@ 9783319256580 3319256580
  

• Kibanov, M., Stumme, G., Amin, I., Lee, J.G.: Mining social media to inform peatland fire and haze disaster management Social Network Analysis and Mining. 7, 30 (2017).

  URLBibTeXEndNote

  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.

  @article{kibanov2017mining,
  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.},
  author = {Kibanov, Mark and Stumme, Gerd and Amin, Imaduddin and Lee, Jong Gun},
  journal = {Social Network Analysis and Mining},
  keywords = {twitter},
  month = {jul},
  number = 1,
  pages = 30,
  title = {Mining social media to inform peatland fire and haze disaster management},
  volume = 7,
  year = 2017
  }
  

  %0 Journal Article
  %1 kibanov2017mining
  %A Kibanov, Mark
  %A Stumme, Gerd
  %A Amin, Imaduddin
  %A Lee, Jong Gun
  %D 2017
  %J Social Network Analysis and Mining
  %N 1
  %P 30
  %R 10.1007/s13278-017-0446-1
  %T Mining social media to inform peatland fire and haze disaster management
  %U http://rdcu.be/udmt
  %V 7
  %X 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.
  

• Mueller, J., Stumme, G.: Predicting Rising Follower Counts on Twitter Using Profile Information 9th International ACM Web Science Conference 2017 (WebSci 2017), Troy, NY, USA, June 26-28, 2017. Accepted for Publication. ACM, New York, NY, USA (2017).

  URLBibTeXEndNote

  When evaluating the cause of one's popularity on Twitter, one thing is considered to be the main driver: Many tweets. There is debate about the kind of tweet one should publish, but little beyond tweets. Of particular interest is the information provided by each Twitter user's profile page. One of the features are the given names on those profiles. Studies on psychology and economics identified correlations of the first name to, e.g., one's school marks or chances of getting a job interview in the US. Therefore, we are interested in the influence of those profile information on the follower count. We addressed this question by analyzing the profiles of about 6 Million Twitter users. All profiles are separated into three groups: Users that have a first name, English words, or neither of both in their name field. The assumption is that names and words influence the discoverability of a user and subsequently his/her follower count. We propose a classifier that labels users who will increase their follower count within a month by applying different models based on the user's group. The classifiers are evaluated with the area under the receiver operator curve score and achieves a score above 0.800.

  @inproceedings{mueller-2017,
  abstract = {When evaluating the cause of one's popularity on Twitter, one thing is considered to be the main driver: Many tweets. There is debate about the kind of tweet one should publish, but little beyond tweets. Of particular interest is the information provided by each Twitter user's profile page. One of the features are the given names on those profiles. Studies on psychology and economics identified correlations of the first name to, e.g., one's school marks or chances of getting a job interview in the US. Therefore, we are interested in the influence of those profile information on the follower count. We addressed this question by analyzing the profiles of about 6 Million Twitter users. All profiles are separated into three groups: Users that have a first name, English words, or neither of both in their name field. The assumption is that names and words influence the discoverability of a user and subsequently his/her follower count. We propose a classifier that labels users who will increase their follower count within a month by applying different models based on the user's group. The classifiers are evaluated with the area under the receiver operator curve score and achieves a score above 0.800.},
  address = {New York, NY, USA},
  author = {Mueller, Juergen and Stumme, Gerd},
  booktitle = {9th International ACM Web Science Conference 2017 (WebSci 2017), Troy, NY, USA, June 26-28, 2017. Accepted for Publication},
  keywords = {myown},
  month = {jun},
  publisher = {ACM},
  title = {Predicting Rising Follower Counts on Twitter Using Profile Information},
  year = 2017
  }
  

  %0 Conference Paper
  %1 mueller-2017
  %A Mueller, Juergen
  %A Stumme, Gerd
  %B 9th International ACM Web Science Conference 2017 (WebSci 2017), Troy, NY, USA, June 26-28, 2017. Accepted for Publication
  %C New York, NY, USA
  %D 2017
  %I ACM
  %R 10.1145/3091478.3091490
  %T Predicting Rising Follower Counts on Twitter Using Profile Information
  %U http://dx.doi.org/10.1145/3091478.3091490
  %X When evaluating the cause of one's popularity on Twitter, one thing is considered to be the main driver: Many tweets. There is debate about the kind of tweet one should publish, but little beyond tweets. Of particular interest is the information provided by each Twitter user's profile page. One of the features are the given names on those profiles. Studies on psychology and economics identified correlations of the first name to, e.g., one's school marks or chances of getting a job interview in the US. Therefore, we are interested in the influence of those profile information on the follower count. We addressed this question by analyzing the profiles of about 6 Million Twitter users. All profiles are separated into three groups: Users that have a first name, English words, or neither of both in their name field. The assumption is that names and words influence the discoverability of a user and subsequently his/her follower count. We propose a classifier that labels users who will increase their follower count within a month by applying different models based on the user's group. The classifiers are evaluated with the area under the receiver operator curve score and achieves a score above 0.800.
  %@ 978-1-4503-4896-6
  

2016

• Mueller, J., Stumme, G.: Gender Inference using Statistical Name Characteristics in Twitter 5th ASE International Conference on Social Informatics (SocInfo 2016), Union, NJ, USA, August 15-17, 2016. Proceedings. pp. 47:1–47:8. ACM, New York, NY, USA (2016).

  URLBibTeXEndNote

  Much attention has been given to the task of gender inference of Twitter users. Although names are strong gender indicators, the names of Twitter users are rarely used as a feature; probably due to the high number of ill-formed names, which cannot be found in any name dictionary. Instead of relying solely on a name database, we propose a novel name classifier. Our approach extracts characteristics from the user names and uses those in order to assign the names to a gender. This enables us to classify international first names as well as ill-formed names.

  @inproceedings{mueller-2016,
  abstract = {Much attention has been given to the task of gender inference of Twitter users. Although names are strong gender indicators, the names of Twitter users are rarely used as a feature; probably due to the high number of ill-formed names, which cannot be found in any name dictionary. Instead of relying solely on a name database, we propose a novel name classifier. Our approach extracts characteristics from the user names and uses those in order to assign the names to a gender. This enables us to classify international first names as well as ill-formed names.},
  address = {New York, NY, USA},
  author = {Mueller, Juergen and Stumme, Gerd},
  booktitle = {5th ASE International Conference on Social Informatics (SocInfo 2016), Union, NJ, USA, August 15-17, 2016. Proceedings},
  keywords = {myown},
  month = {aug},
  pages = {47:1--47:8},
  publisher = {ACM},
  title = {Gender Inference using Statistical Name Characteristics in Twitter},
  year = 2016
  }
  

  %0 Conference Paper
  %1 mueller-2016
  %A Mueller, Juergen
  %A Stumme, Gerd
  %B 5th ASE International Conference on Social Informatics (SocInfo 2016), Union, NJ, USA, August 15-17, 2016. Proceedings
  %C New York, NY, USA
  %D 2016
  %I ACM
  %P 47:1--47:8
  %R 10.1145/2955129.2955182
  %T Gender Inference using Statistical Name Characteristics in Twitter
  %U http://dx.doi.org/10.1145/2955129.2955182
  %X Much attention has been given to the task of gender inference of Twitter users. Although names are strong gender indicators, the names of Twitter users are rarely used as a feature; probably due to the high number of ill-formed names, which cannot be found in any name dictionary. Instead of relying solely on a name database, we propose a novel name classifier. Our approach extracts characteristics from the user names and uses those in order to assign the names to a gender. This enables us to classify international first names as well as ill-formed names.
  %@ 978-1-4503-4129-5
  

• Doerfel, S., Jäschke, R., Stumme, G.: The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems ACM Transactions on Intelligent Systems and Technology. 7, 40:1–40:33 (2016).

  URLBibTeXEndNote

  Social bookmarking systems have established themselves as an important part in today’s web. In such systems, tag recommender systems support users during the posting of a resource by suggesting suitable tags. Tag recommender algorithms have often been evaluated in offline benchmarking experiments. Yet, the particular setup of such experiments has rarely been analyzed. In particular, since the recommendation quality usually suffers from difficulties like the sparsity of the data or the cold start problem for new resources or users, datasets have often been pruned to so-called cores (specific subsets of the original datasets) – however without much consideration of the implications on the benchmarking results. In this paper, we generalize the notion of a core by introducing the new notion of a set-core – which is independent of any graph structure – to overcome a structural drawback in the previous constructions of cores on tagging data. We show that problems caused by some types of cores can be eliminated using setcores. Further, we present a thorough analysis of tag recommender benchmarking setups using cores. To that end, we conduct a large-scale experiment on four real-world datasets in which we analyze the influence of different cores on the evaluation of recommendation algorithms. We can show that the results of the comparison of different recommendation approaches depends on the selection of core type and level. For the benchmarking of tag recommender algorithms, our results suggest that the evaluation must be set up more carefully and should not be based on one arbitrarily chosen core type and level.

  @article{doerfel2016cores,
  abstract = {Social bookmarking systems have established themselves as an important part in today’s web. In such systems, tag recommender systems support users during the posting of a resource by suggesting suitable tags. Tag recommender algorithms have often been evaluated in offline benchmarking experiments. Yet, the particular setup of such experiments has rarely been analyzed. In particular, since the recommendation quality usually suffers from difficulties like the sparsity of the data or the cold start problem for new resources or users, datasets have often been pruned to so-called cores (specific subsets of the original datasets) – however without much consideration of the implications on the benchmarking results. In this paper, we generalize the notion of a core by introducing the new notion of a set-core – which is independent of any graph structure – to overcome a structural drawback in the previous constructions of cores on tagging data. We show that problems caused by some types of cores can be eliminated using setcores. Further, we present a thorough analysis of tag recommender benchmarking setups using cores. To that end, we conduct a large-scale experiment on four real-world datasets in which we analyze the influence of different cores on the evaluation of recommendation algorithms. We can show that the results of the comparison of different recommendation approaches depends on the selection of core type and level. For the benchmarking of tag recommender algorithms, our results suggest that the evaluation must be set up more carefully and should not be based on one arbitrarily chosen core type and level.},
  author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd},
  journal = {ACM Transactions on Intelligent Systems and Technology},
  keywords = {recommenders},
  month = {February},
  number = 3,
  pages = {40:1--40:33},
  title = {The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems},
  volume = 7,
  year = 2016
  }
  

  %0 Journal Article
  %1 doerfel2016cores
  %A Doerfel, Stephan
  %A Jäschke, Robert
  %A Stumme, Gerd
  %D 2016
  %J ACM Transactions on Intelligent Systems and Technology
  %N 3
  %P 40:1--40:33
  %T The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems
  %U http://doi.acm.org/10.1145/2700485
  %V 7
  %X Social bookmarking systems have established themselves as an important part in today’s web. In such systems, tag recommender systems support users during the posting of a resource by suggesting suitable tags. Tag recommender algorithms have often been evaluated in offline benchmarking experiments. Yet, the particular setup of such experiments has rarely been analyzed. In particular, since the recommendation quality usually suffers from difficulties like the sparsity of the data or the cold start problem for new resources or users, datasets have often been pruned to so-called cores (specific subsets of the original datasets) – however without much consideration of the implications on the benchmarking results. In this paper, we generalize the notion of a core by introducing the new notion of a set-core – which is independent of any graph structure – to overcome a structural drawback in the previous constructions of cores on tagging data. We show that problems caused by some types of cores can be eliminated using setcores. Further, we present a thorough analysis of tag recommender benchmarking setups using cores. To that end, we conduct a large-scale experiment on four real-world datasets in which we analyze the influence of different cores on the evaluation of recommendation algorithms. We can show that the results of the comparison of different recommendation approaches depends on the selection of core type and level. For the benchmarking of tag recommender algorithms, our results suggest that the evaluation must be set up more carefully and should not be based on one arbitrarily chosen core type and level.
  

• Atzmueller, M., Ernst, A., Krebs, F., Scholz, C., Stumme, G.: {Formation and Temporal Evolution of Social Groups During Coffee Breaks} Postproceedings of the International Workshops MUSE & SenseML 2014, Nancy, France, and MSM 2014, Seoul, Korea. Springer Verlag, Heidelberg, Germany (2016).

  URLBibTeXEndNote

  @incollection{AEKSS:15,
  address = {Heidelberg, Germany},
  author = {Atzmueller, Martin and Ernst, Andreas and Krebs, Friedrich and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Postproceedings of the International Workshops MUSE & SenseML 2014, Nancy, France, and MSM 2014, Seoul, Korea},
  keywords = {temporal},
  publisher = {Springer Verlag},
  series = {LNAI},
  title = {{Formation and Temporal Evolution of Social Groups During Coffee Breaks}},
  year = 2016
  }
  

  %0 Book Section
  %1 AEKSS:15
  %A Atzmueller, Martin
  %A Ernst, Andreas
  %A Krebs, Friedrich
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Postproceedings of the International Workshops MUSE & SenseML 2014, Nancy, France, and MSM 2014, Seoul, Korea
  %C Heidelberg, Germany
  %D 2016
  %I Springer Verlag
  %T {Formation and Temporal Evolution of Social Groups During Coffee Breaks}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2015-atzmueller-group-formation-temporal-evolution.pdf
  

• Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Analyzing Group Interaction and Dynamics on Socio-Behavioral Networks of Face-to-Face Proximity} Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication. ACM Press, New York, NY, USA (2016).

  URLBibTeXEndNote

  @inproceedings{ATSK:16,
  address = {New York, NY, USA},
  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},
  booktitle = {Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication},
  keywords = {ubiquitous},
  publisher = {ACM Press},
  series = {UbiComp '16 Adjunct},
  title = {{Analyzing Group Interaction and Dynamics on Socio-Behavioral Networks of Face-to-Face Proximity}},
  year = 2016
  }
  

  %0 Conference Paper
  %1 ATSK:16
  %A Atzmueller, Martin
  %A Thiele, Lisa
  %A Stumme, Gerd
  %A Kauffeld, Simone
  %B Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication
  %C New York, NY, USA
  %D 2016
  %I ACM Press
  %T {Analyzing Group Interaction and Dynamics on Socio-Behavioral Networks of Face-to-Face Proximity}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/atzmueller-analyzing-group-interaction-ubicomp16.pdf
  

• Atzmueller, M., Kloepper, B., Mawla, H.A., Jäschke, B., Hollender, M., Graube, M., Arnu, D., Schmidt, A., Heinze, S., Schorer, L., Kroll, A., Stumme, G., Urbas, L.: {Big Data Analytics for Proactive Industrial Decision Support: Approaches \& First Experiences in the Context of the FEE Project} atp edition. 58, (2016).

  URLBibTeXEndNote

  @article{FEE:ATP:2016,
  author = {Atzmueller, Martin and Kloepper, Benjamin and Mawla, Hassan Al and Jäschke, Benjamin and Hollender, Martin and Graube, Markus and Arnu, David and Schmidt, Andreas and Heinze, Sebastian and Schorer, Lukas and Kroll, Andreas and Stumme, Gerd and Urbas, Leon},
  journal = {atp edition},
  keywords = {process},
  number = 9,
  title = {{Big Data Analytics for Proactive Industrial Decision Support: Approaches \& First Experiences in the Context of the FEE Project}},
  volume = 58,
  year = 2016
  }
  

  %0 Journal Article
  %1 FEE:ATP:2016
  %A Atzmueller, Martin
  %A Kloepper, Benjamin
  %A Mawla, Hassan Al
  %A Jäschke, Benjamin
  %A Hollender, Martin
  %A Graube, Markus
  %A Arnu, David
  %A Schmidt, Andreas
  %A Heinze, Sebastian
  %A Schorer, Lukas
  %A Kroll, Andreas
  %A Stumme, Gerd
  %A Urbas, Leon
  %D 2016
  %J atp edition
  %N 9
  %T {Big Data Analytics for Proactive Industrial Decision Support: Approaches \& First Experiences in the Context of the FEE Project}
  %U https://www.atpinfo.de/produkte/2016-big-data-analytics-for-proactive-industrial-decision-support/
  %V 58
  

• Atzmueller, M., Hanika, T., Stumme, G., Schaller, R., Ludwig, B.: {Social Event Network Analysis: Structure, Preferences, and Reality} Proc. IEEE/ACM ASONAM. IEEE Press, Boston, MA, USA (2016).

  URLBibTeXEndNote

  @inproceedings{AHSSL:16:ASONAM,
  address = {Boston, MA, USA},
  author = {Atzmueller, Martin and Hanika, Tom and Stumme, Gerd and Schaller, Richard and Ludwig, Bernd},
  booktitle = {Proc. IEEE/ACM ASONAM},
  keywords = {subgroup},
  publisher = {IEEE Press},
  title = {{Social Event Network Analysis: Structure, Preferences, and Reality}},
  year = 2016
  }
  

  %0 Conference Paper
  %1 AHSSL:16:ASONAM
  %A Atzmueller, Martin
  %A Hanika, Tom
  %A Stumme, Gerd
  %A Schaller, Richard
  %A Ludwig, Bernd
  %B Proc. IEEE/ACM ASONAM
  %C Boston, MA, USA
  %D 2016
  %I IEEE Press
  %T {Social Event Network Analysis: Structure, Preferences, and Reality}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/atzmueller-social-event-analysis-asonam16-preprint.pdf
  

• Zoller, D., Doerfel, S., Jäschke, R., Stumme, G., Hotho, A.: Posted, visited, exported: Altmetrics in the social tagging system BibSonomy Journal of Informetrics. 10, 732–749 (2016).

  URLBibTeXEndNote

  Abstract In social tagging systems, like Mendeley, CiteULike, and BibSonomy, users can post, tag, visit, or export scholarly publications. In this paper, we compare citations with metrics derived from users’ activities (altmetrics) in the popular social bookmarking system BibSonomy. Our analysis, using a corpus of more than 250,000 publications published before 2010, reveals that overall, citations and altmetrics in BibSonomy are mildly correlated. Furthermore, grouping publications by user-generated tags results in topic-homogeneous subsets that exhibit higher correlations with citations than the full corpus. We find that posts, exports, and visits of publications are correlated with citations and even bear predictive power over future impact. Machine learning classifiers predict whether the number of citations that a publication receives in a year exceeds the median number of citations in that year, based on the usage counts of the preceding year. In that setup, a Random Forest predictor outperforms the baseline on average by seven percentage points.

  @article{zoller2016posted,
  abstract = {Abstract In social tagging systems, like Mendeley, CiteULike, and BibSonomy, users can post, tag, visit, or export scholarly publications. In this paper, we compare citations with metrics derived from users’ activities (altmetrics) in the popular social bookmarking system BibSonomy. Our analysis, using a corpus of more than 250,000 publications published before 2010, reveals that overall, citations and altmetrics in BibSonomy are mildly correlated. Furthermore, grouping publications by user-generated tags results in topic-homogeneous subsets that exhibit higher correlations with citations than the full corpus. We find that posts, exports, and visits of publications are correlated with citations and even bear predictive power over future impact. Machine learning classifiers predict whether the number of citations that a publication receives in a year exceeds the median number of citations in that year, based on the usage counts of the preceding year. In that setup, a Random Forest predictor outperforms the baseline on average by seven percentage points.},
  author = {Zoller, Daniel and Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd and Hotho, Andreas},
  journal = {Journal of Informetrics},
  keywords = {visited},
  number = 3,
  pages = {732 - 749},
  title = {Posted, visited, exported: Altmetrics in the social tagging system BibSonomy},
  volume = 10,
  year = 2016
  }
  

  %0 Journal Article
  %1 zoller2016posted
  %A Zoller, Daniel
  %A Doerfel, Stephan
  %A Jäschke, Robert
  %A Stumme, Gerd
  %A Hotho, Andreas
  %D 2016
  %J Journal of Informetrics
  %N 3
  %P 732 - 749
  %R http://dx.doi.org/10.1016/j.joi.2016.03.005
  %T Posted, visited, exported: Altmetrics in the social tagging system BibSonomy
  %U http://www.sciencedirect.com/science/article/pii/S1751157715300936
  %V 10
  %X Abstract In social tagging systems, like Mendeley, CiteULike, and BibSonomy, users can post, tag, visit, or export scholarly publications. In this paper, we compare citations with metrics derived from users’ activities (altmetrics) in the popular social bookmarking system BibSonomy. Our analysis, using a corpus of more than 250,000 publications published before 2010, reveals that overall, citations and altmetrics in BibSonomy are mildly correlated. Furthermore, grouping publications by user-generated tags results in topic-homogeneous subsets that exhibit higher correlations with citations than the full corpus. We find that posts, exports, and visits of publications are correlated with citations and even bear predictive power over future impact. Machine learning classifiers predict whether the number of citations that a publication receives in a year exceeds the median number of citations in that year, based on the usage counts of the preceding year. In that setup, a Random Forest predictor outperforms the baseline on average by seven percentage points.
  

2015

• Atzmueller, M., Kibanov, M., Scholz, C., Mueller, J., Stumme, G.: {Conferator – A Ubiquitous System for Enhancing Social Networking at Conferences} Proc. UIS Workshop (2015).

  URLBibTeXEndNote

  @inproceedings{atzmueller2015conferator,
  author = {Atzmueller, Martin and Kibanov, Mark and Scholz, Christoph and Mueller, Juergen and Stumme, Gerd},
  booktitle = {Proc. UIS Workshop},
  keywords = {myown},
  title = {{Conferator – A Ubiquitous System for Enhancing Social Networking at Conferences}},
  year = 2015
  }
  

  %0 Conference Paper
  %1 atzmueller2015conferator
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Scholz, Christoph
  %A Mueller, Juergen
  %A Stumme, Gerd
  %B Proc. UIS Workshop
  %D 2015
  %T {Conferator – A Ubiquitous System for Enhancing Social Networking at Conferences}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2015-uis-atzmueller-conferator-ubiquitous-social-computing.pdf
  

• Sîrbu, A., Becker, M., Caminiti, S., De Baets, B., Elen, B., Francis, L., Gravino, P., Hotho, A., Ingarra, S., Loreto, V., Molino, A., Mueller, J., Peters, J., Ricchiuti, F., Saracino, F., Servedio, V.D.P., Stumme, G., Theunis, J., Tria, F., Van den Bossche, J.: Participatory Patterns in an International Air Quality Monitoring Initiative PLoS ONE. 10, e0136763 (2015).

  URLBibTeXEndNote

  The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.

  @article{sirbu2015participatory,
  abstract = {The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.},
  author = {Sîrbu, Alina and Becker, Martin and Caminiti, Saverio and De Baets, Bernard and Elen, Bart and Francis, Louise and Gravino, Pietro and Hotho, Andreas and Ingarra, Stefano and Loreto, Vittorio and Molino, Andrea and Mueller, Juergen and Peters, Jan and Ricchiuti, Ferdinando and Saracino, Fabio and Servedio, Vito D. P. and Stumme, Gerd and Theunis, Jan and Tria, Francesca and Van den Bossche, Joris},
  journal = {PLoS ONE},
  keywords = {topoi},
  month = {08},
  number = 8,
  pages = {e0136763},
  publisher = {Public Library of Science},
  title = {Participatory Patterns in an International Air Quality Monitoring Initiative},
  volume = 10,
  year = 2015
  }
  

  %0 Journal Article
  %1 sirbu2015participatory
  %A Sîrbu, Alina
  %A Becker, Martin
  %A Caminiti, Saverio
  %A De Baets, Bernard
  %A Elen, Bart
  %A Francis, Louise
  %A Gravino, Pietro
  %A Hotho, Andreas
  %A Ingarra, Stefano
  %A Loreto, Vittorio
  %A Molino, Andrea
  %A Mueller, Juergen
  %A Peters, Jan
  %A Ricchiuti, Ferdinando
  %A Saracino, Fabio
  %A Servedio, Vito D. P.
  %A Stumme, Gerd
  %A Theunis, Jan
  %A Tria, Francesca
  %A Van den Bossche, Joris
  %D 2015
  %I Public Library of Science
  %J PLoS ONE
  %N 8
  %P e0136763
  %T Participatory Patterns in an International Air Quality Monitoring Initiative
  %U http://dx.doi.org/10.1371%2Fjournal.pone.0136763
  %V 10
  %X The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.
  

• Schmidt, A., Atzmueller, M., Stumme, G.: The FEE Project: Introduction and First Insights Proc. UIS Workshop (2015).

  URLBibTeXEndNote

  @inproceedings{schmidt2015project,
  author = {Schmidt, Andreas and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. UIS Workshop},
  keywords = {myown},
  title = {The FEE Project: Introduction and First Insights},
  year = 2015
  }
  

  %0 Conference Paper
  %1 schmidt2015project
  %A Schmidt, Andreas
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. UIS Workshop
  %D 2015
  %T The FEE Project: Introduction and First Insights
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2015-uis-big-data-fee-first-insights.pdf
  

• Kibanov, M., Atzmueller, M., Illig, J., Scholz, C., Barrat, A., Cattuto, C., Stumme, G.: {Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists (Poster)}, http://www.gesis.org/css-wintersymposium/program/poster-sessions-presentations/, (2015).

  URLBibTeXEndNote

  @misc{KAISBCS:15p,
  author = {Kibanov, Mark and Atzmueller, Martin and Illig, Jens and Scholz, Christoph and Barrat, Alain and Cattuto, Ciro and Stumme, Gerd},
  howpublished = {Computational Social Science Winter Symposium 2015, Poster},
  keywords = {web},
  title = {{Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists (Poster)}},
  year = 2015
  }
  

  %0 Generic
  %1 KAISBCS:15p
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Illig, Jens
  %A Scholz, Christoph
  %A Barrat, Alain
  %A Cattuto, Ciro
  %A Stumme, Gerd
  %D 2015
  %T {Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists (Poster)}
  %U http://www.gesis.org/css-wintersymposium/program/poster-sessions-presentations/
  

• Kibanov, M., Atzmueller, M., Illig, J., Scholz, C., Barrat, A., Cattuto, C., Stumme, G.: Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists Proceedings of the 2015 ACM/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25-28, 2015 (2015).

  BibTeXEndNote

  @inproceedings{kibanov2015content,
  author = {Kibanov, Mark and Atzmueller, Martin and Illig, Jens and Scholz, Christoph and Barrat, Alain and Cattuto, Ciro and Stumme, Gerd},
  booktitle = {Proceedings of the 2015 ACM/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25-28, 2015},
  keywords = {track},
  title = {Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists},
  year = 2015
  }
  

  %0 Conference Paper
  %1 kibanov2015content
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Illig, Jens
  %A Scholz, Christoph
  %A Barrat, Alain
  %A Cattuto, Ciro
  %A Stumme, Gerd
  %B Proceedings of the 2015 ACM/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25-28, 2015
  %D 2015
  %T Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists
  

• Doerfel, S., Jäschke, R., Stumme, G.: The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems Transactions on Intelligent Systems and Technology. (2015).

  BibTeXEndNote

  @article{doerfel2015cores,
  author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd},
  journal = {Transactions on Intelligent Systems and Technology},
  keywords = {tagging},
  publisher = {ACM},
  title = {The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems},
  year = 2015
  }
  

  %0 Journal Article
  %1 doerfel2015cores
  %A Doerfel, Stephan
  %A Jäschke, Robert
  %A Stumme, Gerd
  %D 2015
  %I ACM
  %J Transactions on Intelligent Systems and Technology
  %T The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems
  

• Zoller, D., Doerfel, S., Jäschke, R., Stumme, G., Hotho, A.: On Publication Usage in a Social Bookmarking System Proceedings of the 2015 ACM Conference on Web Science. pp. 67:1–67:2. ACM, Oxford, United Kingdom (2015).

  URLBibTeXEndNote

  Scholarly success is traditionally measured in terms of citations to publications. With the advent of publication man- agement and digital libraries on the web, scholarly usage data has become a target of investigation and new impact metrics computed on such usage data have been proposed – so called altmetrics. In scholarly social bookmarking sys- tems, scientists collect and manage publication meta data and thus reveal their interest in these publications. In this work, we investigate connections between usage metrics and citations, and find posts, exports, and page views of publications to be correlated to citations.

  @inproceedings{zoller2015publication,
  abstract = {Scholarly success is traditionally measured in terms of citations to publications. With the advent of publication man- agement and digital libraries on the web, scholarly usage data has become a target of investigation and new impact metrics computed on such usage data have been proposed – so called altmetrics. In scholarly social bookmarking sys- tems, scientists collect and manage publication meta data and thus reveal their interest in these publications. In this work, we investigate connections between usage metrics and citations, and find posts, exports, and page views of publications to be correlated to citations.},
  address = {New York, NY, USA},
  author = {Zoller, Daniel and Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd and Hotho, Andreas},
  booktitle = {Proceedings of the 2015 ACM Conference on Web Science},
  keywords = {webSci},
  pages = {67:1--67:2},
  publisher = {ACM},
  series = {WebSci '15},
  title = {On Publication Usage in a Social Bookmarking System},
  year = 2015
  }
  

  %0 Conference Paper
  %1 zoller2015publication
  %A Zoller, Daniel
  %A Doerfel, Stephan
  %A Jäschke, Robert
  %A Stumme, Gerd
  %A Hotho, Andreas
  %B Proceedings of the 2015 ACM Conference on Web Science
  %C New York, NY, USA
  %D 2015
  %I ACM
  %P 67:1--67:2
  %R 10.1145/2786451.2786927
  %T On Publication Usage in a Social Bookmarking System
  %U http://doi.acm.org/10.1145/2786451.2786927
  %X Scholarly success is traditionally measured in terms of citations to publications. With the advent of publication man- agement and digital libraries on the web, scholarly usage data has become a target of investigation and new impact metrics computed on such usage data have been proposed – so called altmetrics. In scholarly social bookmarking sys- tems, scientists collect and manage publication meta data and thus reveal their interest in these publications. In this work, we investigate connections between usage metrics and citations, and find posts, exports, and page views of publications to be correlated to citations.
  %@ 978-1-4503-3672-7
  

• Sîrbu, A., Becker, M., Caminiti, S., De Baets, B., Elen, B., Francis, L., Gravino, P., Hotho, A., Ingarra, S., Loreto, V., Molino, A., Mueller, J., Peters, J., Ricchiuti, F., Saracino, F., Servedio, V.D.P., Stumme, G., Theunis, J., Tria, F., Van den Bossche, J.: Participatory Patterns in an International Air Quality Monitoring Initiative PLOS ONE. 10, 1–19 (2015).

  URLBibTeXEndNote

  The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.

  @article{sirbu2015participatory,
  abstract = {The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.},
  author = {Sîrbu, Alina and Becker, Martin and Caminiti, Saverio and De Baets, Bernard and Elen, Bart and Francis, Louise and Gravino, Pietro and Hotho, Andreas and Ingarra, Stefano and Loreto, Vittorio and Molino, Andrea and Mueller, Juergen and Peters, Jan and Ricchiuti, Ferdinando and Saracino, Fabio and Servedio, Vito D. P. and Stumme, Gerd and Theunis, Jan and Tria, Francesca and Van den Bossche, Joris},
  journal = {PLOS ONE},
  keywords = {myown},
  month = {08},
  number = 8,
  pages = {1-19},
  publisher = {Public Library of Science},
  title = {Participatory Patterns in an International Air Quality Monitoring Initiative},
  volume = 10,
  year = 2015
  }
  

  %0 Journal Article
  %1 sirbu2015participatory
  %A Sîrbu, Alina
  %A Becker, Martin
  %A Caminiti, Saverio
  %A De Baets, Bernard
  %A Elen, Bart
  %A Francis, Louise
  %A Gravino, Pietro
  %A Hotho, Andreas
  %A Ingarra, Stefano
  %A Loreto, Vittorio
  %A Molino, Andrea
  %A Mueller, Juergen
  %A Peters, Jan
  %A Ricchiuti, Ferdinando
  %A Saracino, Fabio
  %A Servedio, Vito D. P.
  %A Stumme, Gerd
  %A Theunis, Jan
  %A Tria, Francesca
  %A Van den Bossche, Joris
  %D 2015
  %I Public Library of Science
  %J PLOS ONE
  %N 8
  %P 1-19
  %R 10.1371/journal.pone.0136763
  %T Participatory Patterns in an International Air Quality Monitoring Initiative
  %U https://doi.org/10.1371/journal.pone.0136763
  %V 10
  %X The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.
  

• Kibanov, M., Atzmueller, M., Illig, J., Scholz, C., Barrat, A., Cattuto, C., Stumme, G.: {Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists} Proc. ASONAM. IEEE Press, Boston, MA, USA (2015).

  URLBibTeXEndNote

  @inproceedings{kibanov2015content,
  address = {Boston, MA, USA},
  author = {Kibanov, Mark and Atzmueller, Martin and Illig, Jens and Scholz, Christoph and Barrat, Alain and Cattuto, Ciro and Stumme, Gerd},
  booktitle = {Proc. ASONAM},
  keywords = {venus},
  publisher = {IEEE Press},
  title = {{Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists}},
  year = 2015
  }
  

  %0 Conference Paper
  %1 kibanov2015content
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Illig, Jens
  %A Scholz, Christoph
  %A Barrat, Alain
  %A Cattuto, Ciro
  %A Stumme, Gerd
  %B Proc. ASONAM
  %C Boston, MA, USA
  %D 2015
  %I IEEE Press
  %T {Is Web Content a Good Proxy for Real-Life Interaction? A Case Study Considering Online and Offline Interactions of Computer Scientists}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2015-asonam-preprint-offline-online-social-interaction-networks.pdf
  

2014

• Scholz, C., Atzmueller, M., Stumme, G.: Link Prediction and the Role of Stronger Ties in Networks of Face-to-Face Proximity CoRR. abs/1407.2161, (2014).

  BibTeXEndNote

  @article{DBLP:journals/corr/SAS_Arxiv14,
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  journal = {CoRR},
  keywords = {myown},
  title = {Link Prediction and the Role of Stronger Ties in Networks of Face-to-Face Proximity},
  volume = {abs/1407.2161},
  year = 2014
  }
  

  %0 Journal Article
  %1 DBLP:journals/corr/SAS_Arxiv14
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %D 2014
  %J CoRR
  %T Link Prediction and the Role of Stronger Ties in Networks of Face-to-Face Proximity
  %V abs/1407.2161
  

• Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences (Extended Version)} CoRR. abs/1407.0613, (2014).

  BibTeXEndNote

  @article{SIAS:14c,
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  journal = {CoRR},
  keywords = {myown},
  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Version)}},
  volume = {abs/1407.0613},
  year = 2014
  }
  

  %0 Journal Article
  %1 SIAS:14c
  %A Scholz, Christoph
  %A Illig, Jens
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %D 2014
  %J CoRR
  %T {On the Predictability of Talk Attendance at Academic Conferences (Extended Version)}
  %V abs/1407.0613
  

• Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract)} Proc. LWA 2014 (KDML Special Track). RTWH Aachen University, Aachen, Germany (2014).

  URLBibTeXEndNote

  @inproceedings{SIAS:14b,
  address = {Aachen, Germany},
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. LWA 2014 (KDML Special Track)},
  keywords = {user},
  publisher = {RTWH Aachen University},
  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract)}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 SIAS:14b
  %A Scholz, Christoph
  %A Illig, Jens
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. LWA 2014 (KDML Special Track)
  %C Aachen, Germany
  %D 2014
  %I RTWH Aachen University
  %T {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract)}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2014-lwa-kdml-talk-prediction-extended-abstract.pdf
  

• Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: {Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks} Journal of Social Network Analysis and Mining. 4, (2014).

  URLBibTeXEndNote

  @article{SAS:14c,
  author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
  journal = {Journal of Social Network Analysis and Mining},
  keywords = {social},
  number = 217,
  title = {{Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}},
  volume = 4,
  year = 2014
  }
  

  %0 Journal Article
  %1 SAS:14c
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Stumme, Gerd
  %D 2014
  %J Journal of Social Network Analysis and Mining
  %N 217
  %T {Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}
  %U http://link.springer.com/article/10.1007/s13278-014-0217-1
  %V 4
  

• Macek, B.-E., Atzmueller, M., Stumme, G.: {Predicting the Stability of User Interaction Ties in Twitter} Proc. I-KNOW 2014. ACM Press, New York, NY, USA (2014).

  BibTeXEndNote

  @inproceedings{MAS:14,
  address = {New York, NY, USA},
  author = {Macek, Bjoern-Elmar and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. I-KNOW 2014},
  keywords = {ontologyhandbook},
  publisher = {ACM Press},
  title = {{Predicting the Stability of User Interaction Ties in Twitter}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 MAS:14
  %A Macek, Bjoern-Elmar
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. I-KNOW 2014
  %C New York, NY, USA
  %D 2014
  %I ACM Press
  %T {Predicting the Stability of User Interaction Ties in Twitter}
  

• David, K., Geihs, K., Leimeister, J.M., Roßnagel, A., Schmidt, L., Stumme, G., Wacker, A. eds.: Socio-technical design of ubiquitous computing systems Springer (2014).

  URLBibTeXEndNote

  By using various data inputs, ubiquitous computing systems detect their current usage context, automatically adapt their services to the user's situational needs and interact with other services or resources in their environment on an ad-hoc basis. Designing such self-adaptive, context-aware knowledge processing systems is, in itself, a formidable challenge. This book presents core findings from the VENUS project at the Interdisciplinary Research Center for Information System Design (ITeG) at Kassel University, where researchers from different fields, such as computer science, information systems, human-computer interaction and law, together seek to find general principles and guidelines for the design of socially aware ubiquitous computing systems. To this end, system usability, user trust in the technology and adherence to privacy laws and regulations were treated as particularly important criteria in the context of socio-technical system design. During the project, a comprehensive blueprint for systematic, interdisciplinary software development was developed, covering the particular functional and non-functional design aspects of ubiquitous computing at the interface between technology and human beings. The organization of the book reflects the structure of the VENUS work program. After an introductory part I, part II provides the groundwork for VENUS by presenting foundational results from all four disciplines involved. Subsequently, part III focuses on methodological research funneling the development activities into a common framework. Part IV then covers the design of the demonstrators that were built in order to develop and evaluate the VENUS method. Finally, part V is dedicated to the evaluation phase to assess the user acceptance of the new approach and applications. The presented findings are especially important for researchers in computer science, information systems, and human-computer interaction, but also for everyone working on the acceptance of new technologies in society in general.

  @book{david2014sociotechnical,
  abstract = {By using various data inputs, ubiquitous computing systems detect their current usage context, automatically adapt their services to the user's situational needs and interact with other services or resources in their environment on an ad-hoc basis. Designing such self-adaptive, context-aware knowledge processing systems is, in itself, a formidable challenge. This book presents core findings from the VENUS project at the Interdisciplinary Research Center for Information System Design (ITeG) at Kassel University, where researchers from different fields, such as computer science, information systems, human-computer interaction and law, together seek to find general principles and guidelines for the design of socially aware ubiquitous computing systems. To this end, system usability, user trust in the technology and adherence to privacy laws and regulations were treated as particularly important criteria in the context of socio-technical system design. During the project, a comprehensive blueprint for systematic, interdisciplinary software development was developed, covering the particular functional and non-functional design aspects of ubiquitous computing at the interface between technology and human beings. The organization of the book reflects the structure of the VENUS work program. After an introductory part I, part II provides the groundwork for VENUS by presenting foundational results from all four disciplines involved. Subsequently, part III focuses on methodological research funneling the development activities into a common framework. Part IV then covers the design of the demonstrators that were built in order to develop and evaluate the VENUS method. Finally, part V is dedicated to the evaluation phase to assess the user acceptance of the new approach and applications. The presented findings are especially important for researchers in computer science, information systems, and human-computer interaction, but also for everyone working on the acceptance of new technologies in society in general.},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan M. and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  keywords = {topoi},
  publisher = {Springer},
  title = {Socio-technical design of ubiquitous computing systems},
  year = 2014
  }
  

  %0 Book
  %1 david2014sociotechnical
  %D 2014
  %E David, Klaus
  %E Geihs, Kurt
  %E Leimeister, Jan M.
  %E Roßnagel, Alexander
  %E Schmidt, Ludger
  %E Stumme, Gerd
  %E Wacker, Arno
  %I Springer
  %T Socio-technical design of ubiquitous computing systems
  %U http://dx.doi.org/10.1007/978-3-319-05044-7
  %X By using various data inputs, ubiquitous computing systems detect their current usage context, automatically adapt their services to the user's situational needs and interact with other services or resources in their environment on an ad-hoc basis. Designing such self-adaptive, context-aware knowledge processing systems is, in itself, a formidable challenge. This book presents core findings from the VENUS project at the Interdisciplinary Research Center for Information System Design (ITeG) at Kassel University, where researchers from different fields, such as computer science, information systems, human-computer interaction and law, together seek to find general principles and guidelines for the design of socially aware ubiquitous computing systems. To this end, system usability, user trust in the technology and adherence to privacy laws and regulations were treated as particularly important criteria in the context of socio-technical system design. During the project, a comprehensive blueprint for systematic, interdisciplinary software development was developed, covering the particular functional and non-functional design aspects of ubiquitous computing at the interface between technology and human beings. The organization of the book reflects the structure of the VENUS work program. After an introductory part I, part II provides the groundwork for VENUS by presenting foundational results from all four disciplines involved. Subsequently, part III focuses on methodological research funneling the development activities into a common framework. Part IV then covers the design of the demonstrators that were built in order to develop and evaluate the VENUS method. Finally, part V is dedicated to the evaluation phase to assess the user acceptance of the new approach and applications. The presented findings are especially important for researchers in computer science, information systems, and human-computer interaction, but also for everyone working on the acceptance of new technologies in society in general.
  %@ 9783319050447 3319050443 3319050435 9783319050430
  

• Mitzlaff, F., Atzmueller, M., Hotho, A., Stumme, G.: {The Social Distributional Hypothesis} Journal of Social Network Analysis and Mining. 4, (2014).

  BibTeXEndNote

  @article{MAHS:14,
  author = {Mitzlaff, Folke and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},
  journal = {Journal of Social Network Analysis and Mining},
  keywords = {myown},
  number = 216,
  title = {{The Social Distributional Hypothesis}},
  volume = 4,
  year = 2014
  }
  

  %0 Journal Article
  %1 MAHS:14
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Hotho, Andreas
  %A Stumme, Gerd
  %D 2014
  %J Journal of Social Network Analysis and Mining
  %N 216
  %T {The Social Distributional Hypothesis}
  %V 4
  

• Atzmueller, M., Behrenbruch, K., Hoffmann, A., Kibanov, M., Macek, B.-E., Scholz, C., Skistims, H., Söllner, M., Stumme, G.: {Socio-technical Design of Ubiquitous Computing Systems} Presented at the , Heidelberg, Germany (2014).

  BibTeXEndNote

  @incollection{atzmueller2014sociotechnical,
  address = {Heidelberg, Germany},
  author = {Atzmueller, Martin and Behrenbruch, Kay and Hoffmann, Axel and Kibanov, Mark and Macek, Bjoern-Elmar and Scholz, Christoph and Skistims, Hendrik and Söllner, Matthias and Stumme, Gerd},
  chapter = {{Connect-U: A System for Enhancing Social Networking}},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  keywords = {myown},
  publisher = {Springer Verlag},
  title = {{Socio-technical Design of Ubiquitous Computing Systems}},
  year = 2014
  }
  

  %0 Book Section
  %1 atzmueller2014sociotechnical
  %A Atzmueller, Martin
  %A Behrenbruch, Kay
  %A Hoffmann, Axel
  %A Kibanov, Mark
  %A Macek, Bjoern-Elmar
  %A Scholz, Christoph
  %A Skistims, Hendrik
  %A Söllner, Matthias
  %A Stumme, Gerd
  %C Heidelberg, Germany
  %D 2014
  %E David, Klaus
  %E Geihs, Kurt
  %E Leimeister, Jan-Marco
  %E Roßnagel, Alexander
  %E Schmidt, Ludger
  %E Stumme, Gerd
  %E Wacker, Arno
  %I Springer Verlag
  %T {Socio-technical Design of Ubiquitous Computing Systems}
  %& {Connect-U: A System for Enhancing Social Networking}
  

• Atzmueller, M., Behrenbruch, K., Hoffmann, A., Kibanov, M., Macek, B.-E., Scholz, C., Skistims, H., Söllner, M., Stumme, G.: Connect-U: A System for Enhancing Social Networking In: David, K., Geihs, K., Leimeister, J.M., Roßnagel, A., Schmidt, L., Stumme, G., and Wacker, A. (eds.) Socio-technical Design of Ubiquitous Computing Systems. pp. 261–275. Springer International Publishing (2014).

  URLBibTeXEndNote

  The application of ubiquitous and social computational systems shows a rapidly increasing trend in our everyday environments: Enhancing social interactions and communication in both online and real-world settings is an important issue in a broad range of application contexts. This chapter describes the development of ubiquitous and social software for enhancing social networking. The Connect-U demonstrator features a class of such applications. In particular, it comprises the Conferator and MyGroup applications for enabling smarter social interactions in the context of conferences and working groups. We describe the applied socio-technical design process, and discuss experiences and lessons learned.

  @incollection{noKey,
  abstract = {The application of ubiquitous and social computational systems shows a rapidly increasing trend in our everyday environments: Enhancing social interactions and communication in both online and real-world settings is an important issue in a broad range of application contexts. This chapter describes the development of ubiquitous and social software for enhancing social networking. The Connect-U demonstrator features a class of such applications. In particular, it comprises the Conferator and MyGroup applications for enabling smarter social interactions in the context of conferences and working groups. We describe the applied socio-technical design process, and discuss experiences and lessons learned.},
  author = {Atzmueller, Martin and Behrenbruch, Kay and Hoffmann, Axel and Kibanov, Mark and Macek, Bjoern-Elmar and Scholz, Christoph and Skistims, Hendrik and Söllner, Matthias and Stumme, Gerd},
  booktitle = {Socio-technical Design of Ubiquitous Computing Systems},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan Marco and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  keywords = {myown},
  pages = {261-275},
  publisher = {Springer International Publishing},
  title = {Connect-U: A System for Enhancing Social Networking},
  year = 2014
  }
  

  %0 Book Section
  %1 noKey
  %A Atzmueller, Martin
  %A Behrenbruch, Kay
  %A Hoffmann, Axel
  %A Kibanov, Mark
  %A Macek, Bjoern-Elmar
  %A Scholz, Christoph
  %A Skistims, Hendrik
  %A Söllner, Matthias
  %A Stumme, Gerd
  %B Socio-technical Design of Ubiquitous Computing Systems
  %D 2014
  %E David, Klaus
  %E Geihs, Kurt
  %E Leimeister, Jan Marco
  %E Roßnagel, Alexander
  %E Schmidt, Ludger
  %E Stumme, Gerd
  %E Wacker, Arno
  %I Springer International Publishing
  %P 261-275
  %R 10.1007/978-3-319-05044-7_15
  %T Connect-U: A System for Enhancing Social Networking
  %U http://dx.doi.org/10.1007/978-3-319-05044-7_15
  %X The application of ubiquitous and social computational systems shows a rapidly increasing trend in our everyday environments: Enhancing social interactions and communication in both online and real-world settings is an important issue in a broad range of application contexts. This chapter describes the development of ubiquitous and social software for enhancing social networking. The Connect-U demonstrator features a class of such applications. In particular, it comprises the Conferator and MyGroup applications for enabling smarter social interactions in the context of conferences and working groups. We describe the applied socio-technical design process, and discuss experiences and lessons learned.
  %@ 978-3-319-05043-0
  

• Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences} Proc. 25th ACM Conference on Hypertext and Social Media. ACM Press, New York, NY, USA (2014).

  BibTeXEndNote

  @inproceedings{SIAS:14a,
  address = {New York, NY, USA},
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. 25th ACM Conference on Hypertext and Social Media},
  keywords = {myown},
  publisher = {ACM Press},
  title = {{On the Predictability of Talk Attendance at Academic Conferences}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 SIAS:14a
  %A Scholz, Christoph
  %A Illig, Jens
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. 25th ACM Conference on Hypertext and Social Media
  %C New York, NY, USA
  %D 2014
  %I ACM Press
  %T {On the Predictability of Talk Attendance at Academic Conferences}
  

• Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: On the Predictability of Talk Attendance at Academic Conferences CoRR. abs/1407.0613, (2014).

  BibTeXEndNote

  @article{DBLP:journals/corr/SIAS_Arxiv14,
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  journal = {CoRR},
  keywords = {myown},
  title = {On the Predictability of Talk Attendance at Academic Conferences},
  volume = {abs/1407.0613},
  year = 2014
  }
  

  %0 Journal Article
  %1 DBLP:journals/corr/SIAS_Arxiv14
  %A Scholz, Christoph
  %A Illig, Jens
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %D 2014
  %J CoRR
  %T On the Predictability of Talk Attendance at Academic Conferences
  %V abs/1407.0613
  

• Scholz, C., Macek, B.-E., Atzmueller, M., Doerfel, S., Stumme, G.: {Socio-technical Design of Ubiquitous Computing Systems} Presented at the , Heidelberg, Germany (2014).

  BibTeXEndNote

  @incollection{scholz2014sociotechnical,
  address = {Heidelberg, Germany},
  author = {Scholz, Christoph and Macek, Bjoern-Elmar and Atzmueller, Martin and Doerfel, Stephan and Stumme, Gerd},
  chapter = {{Mining Social Links for Ubiquitous Knowledge Engineering}},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  keywords = {myown},
  publisher = {Springer Verlag},
  title = {{Socio-technical Design of Ubiquitous Computing Systems}},
  year = 2014
  }
  

  %0 Book Section
  %1 scholz2014sociotechnical
  %A Scholz, Christoph
  %A Macek, Bjoern-Elmar
  %A Atzmueller, Martin
  %A Doerfel, Stephan
  %A Stumme, Gerd
  %C Heidelberg, Germany
  %D 2014
  %E David, Klaus
  %E Geihs, Kurt
  %E Leimeister, Jan-Marco
  %E Roßnagel, Alexander
  %E Schmidt, Ludger
  %E Stumme, Gerd
  %E Wacker, Arno
  %I Springer Verlag
  %T {Socio-technical Design of Ubiquitous Computing Systems}
  %& {Mining Social Links for Ubiquitous Knowledge Engineering}
  

• Thiele, L., Atzmueller, M., Kauffeld, S., Stumme, G.: {Subjective versus Objective Captured Social Networks: Comparing Standard Self-Report Questionnaire Data with Observational RFID Technology Data} Proc. Measuring Behavior. , Wageningen, The Netherlands (2014).

  BibTeXEndNote

  @inproceedings{TAKS:14,
  address = {Wageningen, The Netherlands},
  author = {Thiele, Lisa and Atzmueller, Martin and Kauffeld, Simone and Stumme, Gerd},
  booktitle = {Proc. Measuring Behavior},
  keywords = {myown},
  title = {{Subjective versus Objective Captured Social Networks: Comparing Standard Self-Report Questionnaire Data with Observational RFID Technology Data}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 TAKS:14
  %A Thiele, Lisa
  %A Atzmueller, Martin
  %A Kauffeld, Simone
  %A Stumme, Gerd
  %B Proc. Measuring Behavior
  %C Wageningen, The Netherlands
  %D 2014
  %T {Subjective versus Objective Captured Social Networks: Comparing Standard Self-Report Questionnaire Data with Observational RFID Technology Data}
  

• Scholz, C., Atzmueller, M., Stumme, G.: {Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks} Journal of Social Network Analysis and Mining. 4, (2014).

  BibTeXEndNote

  @article{SAS:14c,
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  journal = {Journal of Social Network Analysis and Mining},
  keywords = {myown},
  number = 217,
  title = {{Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}},
  volume = 4,
  year = 2014
  }
  

  %0 Journal Article
  %1 SAS:14c
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %D 2014
  %J Journal of Social Network Analysis and Mining
  %N 217
  %T {Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}
  %V 4
  

• Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)} Proc. LWA 2014 (KDML Special Track). RTWH Aachen University, Aachen, Germany (2014).

  BibTeXEndNote

  @inproceedings{SIAS:14b,
  address = {Aachen, Germany},
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. LWA 2014 (KDML Special Track)},
  keywords = {myown},
  publisher = {RTWH Aachen University},
  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 SIAS:14b
  %A Scholz, Christoph
  %A Illig, Jens
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. LWA 2014 (KDML Special Track)
  %C Aachen, Germany
  %D 2014
  %I RTWH Aachen University
  %T {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)}
  

• Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: On the Predictability of Talk Attendance at Academic Conferences 25th ACM Conference on Hypertext and Social Media (to appear). ACM, Santiago, Chile, September 1-4 (2014).

  BibTeXEndNote

  @inproceedings{scholz2014predictability,
  address = {Santiago, Chile, September 1-4},
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {25th ACM Conference on Hypertext and Social Media (to appear)},
  keywords = {myown},
  publisher = {ACM},
  title = {On the Predictability of Talk Attendance at Academic Conferences},
  year = 2014
  }
  

  %0 Conference Paper
  %1 scholz2014predictability
  %A Scholz, Christoph
  %A Illig, Jens
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B 25th ACM Conference on Hypertext and Social Media (to appear)
  %C Santiago, Chile, September 1-4
  %D 2014
  %I ACM
  %T On the Predictability of Talk Attendance at Academic Conferences
  

• Atzmueller, M., Becker, M., Kibanov, M., Scholz, C., Doerfel, S., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Stumme, G.: {Ubicon and its Applications for Ubiquitous Social Computing} New Review of Hypermedia and Multimedia. 20, 53–77 (2014).

  BibTeXEndNote

  @article{ABKSDHMMMS:14,
  author = {Atzmueller, Martin and Becker, Martin and Kibanov, Mark and Scholz, Christoph and Doerfel, Stephan and Hotho, Andreas and Macek, Bjoern-Elmar and Mitzlaff, Folke and Mueller, Juergen and Stumme, Gerd},
  journal = {New Review of Hypermedia and Multimedia},
  keywords = {myown},
  number = 1,
  pages = {53--77},
  title = {{Ubicon and its Applications for Ubiquitous Social Computing}},
  volume = 20,
  year = 2014
  }
  

  %0 Journal Article
  %1 ABKSDHMMMS:14
  %A Atzmueller, Martin
  %A Becker, Martin
  %A Kibanov, Mark
  %A Scholz, Christoph
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Macek, Bjoern-Elmar
  %A Mitzlaff, Folke
  %A Mueller, Juergen
  %A Stumme, Gerd
  %D 2014
  %J New Review of Hypermedia and Multimedia
  %N 1
  %P 53--77
  %R 10.1080/13614568.2013.873488
  %T {Ubicon and its Applications for Ubiquitous Social Computing}
  %V 20
  

• Scholz, C., Atzmueller, M., Stumme, G.: {On the Predictability of Recurring Links in Networks of Face-to-Face Proximity} Proc. WWW 2014 (Companion). IW3C2 / ACM (2014).

  BibTeXEndNote

  @inproceedings{SAS:14a,
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. WWW 2014 (Companion)},
  keywords = {myown},
  organization = {IW3C2 / ACM},
  title = {{On the Predictability of Recurring Links in Networks of Face-to-Face Proximity}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 SAS:14a
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. WWW 2014 (Companion)
  %D 2014
  %T {On the Predictability of Recurring Links in Networks of Face-to-Face Proximity}
  

• Scholz, C., Macek, B.-E., Atzmueller, M., Doerfel, S., Stumme, G.: Mining Social Links for Ubiquitous Knowledge Engineering In: David, K., Geihs, K., Leimeister, J.M., Roßnagel, A., Schmidt, L., Stumme, G., and Wacker, A. (eds.) Socio-technical Design of Ubiquitous Computing Systems. pp. 109–129. Springer International Publishing (2014).

  URLBibTeXEndNote

  Exploiting social links is an important issue for enhancing ubiquitous knowledge engineering because they are a substitute for a wide range of properties depending on which relation spans the link: in case of human face-to-face contacts, similar locations or potential knowledge transfer for the people in contact can be derived. This information can be used to improve the quality of ubiquitous services as localization or recommendation systems. We capture this information by deploying active RFID setups at a variety of contexts. In this chapter, we focus especially on working groups and conferences and discuss and evaluate the achieved improvements using the gathered data.

  @incollection{scholz2014mining,
  abstract = {Exploiting social links is an important issue for enhancing ubiquitous knowledge engineering because they are a substitute for a wide range of properties depending on which relation spans the link: in case of human face-to-face contacts, similar locations or potential knowledge transfer for the people in contact can be derived. This information can be used to improve the quality of ubiquitous services as localization or recommendation systems. We capture this information by deploying active RFID setups at a variety of contexts. In this chapter, we focus especially on working groups and conferences and discuss and evaluate the achieved improvements using the gathered data.},
  author = {Scholz, Christoph and Macek, Bjoern-Elmar and Atzmueller, Martin and Doerfel, Stephan and Stumme, Gerd},
  booktitle = {Socio-technical Design of Ubiquitous Computing Systems},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan Marco and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  keywords = {myown},
  pages = {109-129},
  publisher = {Springer International Publishing},
  title = {Mining Social Links for Ubiquitous Knowledge Engineering},
  year = 2014
  }
  

  %0 Book Section
  %1 scholz2014mining
  %A Scholz, Christoph
  %A Macek, Bjoern-Elmar
  %A Atzmueller, Martin
  %A Doerfel, Stephan
  %A Stumme, Gerd
  %B Socio-technical Design of Ubiquitous Computing Systems
  %D 2014
  %E David, Klaus
  %E Geihs, Kurt
  %E Leimeister, Jan Marco
  %E Roßnagel, Alexander
  %E Schmidt, Ludger
  %E Stumme, Gerd
  %E Wacker, Arno
  %I Springer International Publishing
  %P 109-129
  %R 10.1007/978-3-319-05044-7_7
  %T Mining Social Links for Ubiquitous Knowledge Engineering
  %U http://dx.doi.org/10.1007/978-3-319-05044-7_7
  %X Exploiting social links is an important issue for enhancing ubiquitous knowledge engineering because they are a substitute for a wide range of properties depending on which relation spans the link: in case of human face-to-face contacts, similar locations or potential knowledge transfer for the people in contact can be derived. This information can be used to improve the quality of ubiquitous services as localization or recommendation systems. We capture this information by deploying active RFID setups at a variety of contexts. In this chapter, we focus especially on working groups and conferences and discuss and evaluate the achieved improvements using the gathered data.
  %@ 978-3-319-05043-0
  

• Atzmueller, M., Ernst, A., Krebs, F., Scholz, C., Stumme, G.: {On the Evolution of Social Groups During Coffee Breaks} Proc. WWW 2014 (Companion). IW3C2 / ACM (2014).

  BibTeXEndNote

  @inproceedings{AEKSS:14,
  author = {Atzmueller, Martin and Ernst, Andreas and Krebs, Friedrich and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Proc. WWW 2014 (Companion)},
  keywords = {myown},
  organization = {IW3C2 / ACM},
  title = {{On the Evolution of Social Groups During Coffee Breaks}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 AEKSS:14
  %A Atzmueller, Martin
  %A Ernst, Andreas
  %A Krebs, Friedrich
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Proc. WWW 2014 (Companion)
  %D 2014
  %T {On the Evolution of Social Groups During Coffee Breaks}
  

• Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: {Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions} Science China. 57, (2014).

  BibTeXEndNote

  @article{KASS:14,
  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
  journal = {Science China},
  keywords = {myown},
  month = {March},
  title = {{Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions}},
  volume = 57,
  year = 2014
  }
  

  %0 Journal Article
  %1 KASS:14
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Scholz, Christoph
  %A Stumme, Gerd
  %D 2014
  %J Science China
  %T {Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions}
  %V 57
  

• Scholz, C., Atzmueller, M., Stumme, G.: Unsupervised and Hybrid Approaches for On-Line RFID Localization with Mixed Context Knowledge ISMIS (2014).

  BibTeXEndNote

  @inproceedings{DBLP:conf/ismis/SAS14,
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {ISMIS},
  keywords = {myown},
  title = {Unsupervised and Hybrid Approaches for On-Line RFID Localization with Mixed Context Knowledge},
  year = 2014
  }
  

  %0 Conference Paper
  %1 DBLP:conf/ismis/SAS14
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B ISMIS
  %D 2014
  %T Unsupervised and Hybrid Approaches for On-Line RFID Localization with Mixed Context Knowledge
  

• Atzmueller, M., Becker, M., Kibanov, M., Scholz, C., Doerfel, S., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Stumme, G.: Ubicon and its applications for ubiquitous social computing New Review of Hypermedia and Multimedia. 20, 53–77 (2014).

  URLBibTeXEndNote

  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.

  @article{atzmueller2014ubicon,
  abstract = {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.},
  author = {Atzmueller, Martin and Becker, Martin and Kibanov, Mark and Scholz, Christoph and Doerfel, Stephan and Hotho, Andreas and Macek, Bjoern-Elmar and Mitzlaff, Folke and Mueller, Juergen and Stumme, Gerd},
  journal = {New Review of Hypermedia and Multimedia},
  keywords = {myown},
  number = 1,
  pages = {53-77},
  title = {Ubicon and its applications for ubiquitous social computing},
  volume = 20,
  year = 2014
  }
  

  %0 Journal Article
  %1 atzmueller2014ubicon
  %A Atzmueller, Martin
  %A Becker, Martin
  %A Kibanov, Mark
  %A Scholz, Christoph
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Macek, Bjoern-Elmar
  %A Mitzlaff, Folke
  %A Mueller, Juergen
  %A Stumme, Gerd
  %D 2014
  %J New Review of Hypermedia and Multimedia
  %N 1
  %P 53-77
  %R 10.1080/13614568.2013.873488
  %T Ubicon and its applications for ubiquitous social computing
  %U http://www.tandfonline.com/doi/abs/10.1080/13614568.2013.873488
  %V 20
  %X 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.
  

• Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity} Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK. , London, UK (2014).

  BibTeXEndNote

  @inproceedings{ATSK:14,
  address = {London, UK},
  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},
  booktitle = {Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK},
  keywords = {myown},
  title = {{Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity}},
  year = 2014
  }
  

  %0 Conference Paper
  %1 ATSK:14
  %A Atzmueller, Martin
  %A Thiele, Lisa
  %A Stumme, Gerd
  %A Kauffeld, Simone
  %B Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK
  %C London, UK
  %D 2014
  %T {Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity}
  

• Atzmueller, M., Ernst, A., Krebs, F., Scholz, C., Stumme, G.: On the Evolution of Social Groups During Coffee Breaks In: [accepted/to appear] (ed.) 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014. , Seoul, South Korea (2014).

  BibTeXEndNote

  @inproceedings{atzmueller2014evolution,
  address = {Seoul, South Korea},
  author = {Atzmueller, Martin and Ernst, Andreas and Krebs, Friedrich and Scholz, Christoph and Stumme, Gerd},
  booktitle = {5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014},
  editor = {[accepted/to appear]},
  keywords = {myown},
  title = {On the Evolution of Social Groups During Coffee Breaks},
  year = 2014
  }
  

  %0 Conference Paper
  %1 atzmueller2014evolution
  %A Atzmueller, Martin
  %A Ernst, Andreas
  %A Krebs, Friedrich
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014
  %C Seoul, South Korea
  %D 2014
  %E [accepted/to appear],
  %T On the Evolution of Social Groups During Coffee Breaks
  

• Scholz, C., Atzmueller, M., Stumme, G.: On the Predictability of Recurring Links in Networks of Face-to-Face Proximity In: [accepted/to appear] (ed.) 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014. , Seoul, South Korea (2014).

  BibTeXEndNote

  @inproceedings{scholz2014predictability,
  address = {Seoul, South Korea},
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014},
  editor = {[accepted/to appear]},
  keywords = {myown},
  title = {On the Predictability of Recurring Links in Networks of Face-to-Face Proximity},
  year = 2014
  }
  

  %0 Conference Paper
  %1 scholz2014predictability
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B 5th International Workshop on Modeling Social Media: Mining Big Data in Social Media at the 23rd International World Wide Web Conference, WWW 2014
  %C Seoul, South Korea
  %D 2014
  %E [accepted/to appear],
  %T On the Predictability of Recurring Links in Networks of Face-to-Face Proximity
  

• Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions SCIENCE CHINA Information Sciences. 57, (2014).

  BibTeXEndNote

  @article{DBLP:journals/chinaf/KASS14,
  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
  journal = {SCIENCE CHINA Information Sciences},
  keywords = {myown},
  title = {Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions},
  volume = 57,
  year = 2014
  }
  

  %0 Journal Article
  %1 DBLP:journals/chinaf/KASS14
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Scholz, Christoph
  %A Stumme, Gerd
  %D 2014
  %J SCIENCE CHINA Information Sciences
  %T Temporal Evolution of Contacts and Communities in Networks of Face-to-Face Human Interactions
  %V 57
  

• Atzmueller, M., Becker, M., Kibanov, M., Scholz, C., Doerfel, S., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Stumme, G.: Ubicon and its Applications for Ubiquitous Social Computing New Review of Hypermedia and Multimedia. (2014).

  BibTeXEndNote

  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.

  @article{ubicon-2014a,
  abstract = {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.},
  author = {Atzmueller, Martin and Becker, Martin and Kibanov, Mark and Scholz, Christoph and Doerfel, Stephan and Hotho, Andreas and Macek, Bjoern-Elmar and Mitzlaff, Folke and Mueller, Juergen and Stumme, Gerd},
  journal = {New Review of Hypermedia and Multimedia},
  keywords = {myown},
  title = {Ubicon and its Applications for Ubiquitous Social Computing},
  year = 2014
  }
  

  %0 Journal Article
  %1 ubicon-2014a
  %A Atzmueller, Martin
  %A Becker, Martin
  %A Kibanov, Mark
  %A Scholz, Christoph
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Macek, Bjoern-Elmar
  %A Mitzlaff, Folke
  %A Mueller, Juergen
  %A Stumme, Gerd
  %D 2014
  %J New Review of Hypermedia and Multimedia
  %T Ubicon and its Applications for Ubiquitous Social Computing
  %X 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.
  

• Mitzlaff, F., Atzmueller, M., Hotho, A., Stumme, G.: The social distributional hypothesis: a pragmatic proxy for homophily in online social networks Social Network Analysis and Mining. 4, (2014).

  URLBibTeXEndNote

  Applications of the Social Web are ubiquitous and have become an integral part of everyday life: Users make friends, for example, with the help of online social networks, share thoughts via Twitter, or collaboratively write articles in Wikipedia. All such interactions leave digital traces; thus, users participate in the creation of heterogeneous, distributed, collaborative data collections. In linguistics, the

  @article{mitzlaff2014social,
  abstract = {Applications of the Social Web are ubiquitous and have become an integral part of everyday life: Users make friends, for example, with the help of online social networks, share thoughts via Twitter, or collaboratively write articles in Wikipedia. All such interactions leave digital traces; thus, users participate in the creation of heterogeneous, distributed, collaborative data collections. In linguistics, the},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},
  journal = {Social Network Analysis and Mining},
  keywords = {social},
  number = 1,
  publisher = {Springer Vienna},
  title = {The social distributional hypothesis: a pragmatic proxy for homophily in online social networks},
  volume = 4,
  year = 2014
  }
  

  %0 Journal Article
  %1 mitzlaff2014social
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Hotho, Andreas
  %A Stumme, Gerd
  %D 2014
  %I Springer Vienna
  %J Social Network Analysis and Mining
  %N 1
  %R 10.1007/s13278-014-0216-2
  %T The social distributional hypothesis: a pragmatic proxy for homophily in online social networks
  %U http://dx.doi.org/10.1007/s13278-014-0216-2
  %V 4
  %X Applications of the Social Web are ubiquitous and have become an integral part of everyday life: Users make friends, for example, with the help of online social networks, share thoughts via Twitter, or collaboratively write articles in Wikipedia. All such interactions leave digital traces; thus, users participate in the creation of heterogeneous, distributed, collaborative data collections. In linguistics, the
  

• Atzmueller, M., Becker, M., Kibanov, M., Scholz, C., Doerfel, S., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Stumme, G.: Ubicon and its Applications for Ubiquitous Social Computing New Review of Hypermedia and Multimedia. 1, 53–77 (2014).

  URLBibTeXEndNote

  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.

  @article{mueller-2014b,
  abstract = {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.},
  author = {Atzmueller, Martin and Becker, Martin and Kibanov, Mark and Scholz, Christoph and Doerfel, Stephan and Hotho, Andreas and Macek, Bjoern-Elmar and Mitzlaff, Folke and Mueller, Juergen and Stumme, Gerd},
  journal = {New Review of Hypermedia and Multimedia},
  keywords = {ubiquitous},
  month = {#mar#},
  number = 20,
  pages = {53--77},
  title = {Ubicon and its Applications for Ubiquitous Social Computing},
  volume = 1,
  year = 2014
  }
  

  %0 Journal Article
  %1 mueller-2014b
  %A Atzmueller, Martin
  %A Becker, Martin
  %A Kibanov, Mark
  %A Scholz, Christoph
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Macek, Bjoern-Elmar
  %A Mitzlaff, Folke
  %A Mueller, Juergen
  %A Stumme, Gerd
  %D 2014
  %J New Review of Hypermedia and Multimedia
  %N 20
  %P 53--77
  %R 10.1080/13614568.2013.873488
  %T Ubicon and its Applications for Ubiquitous Social Computing
  %U http://dx.doi.org/10.1080/13614568.2013.873488
  %V 1
  %X 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.
  

• Becker, M., Hotho, A., Mueller, J., Kibanov, M., Atzmueller, M., Stumme, G.: Subjective vs. Objective Data: Bridging the Gap, http://www.gesis.org/en/events/css-wintersymposium/poster-presentation/, (2014).

  URLBibTeXEndNote

  Sensor data is objective. But when measuring our environment, measured values are contrasted with our perception, which is always subjective. This makes interpreting sensor measurements difficult for a single person in her personal environment. In this context, the EveryAware projects directly connects the concepts of objective sensor data with subjective impressions and perceptions by providing a collective sensing platform with several client applications allowing to explicitly associate those two data types. The goal is to provide the user with personalized feedback, a characterization of the global as well as her personal environment, and enable her to position her perceptions in this global context. In this poster we summarize the collected data of two EveryAware applications, namely WideNoise for noise measurements and AirProbe for participatory air quality sensing. Basic insights are presented including user activity, learning processes and sensor data to perception correlations. These results provide an outlook on how this data can further be used to understand the connection between sensor data and perceptions.

  @misc{becker2014subjective,
  abstract = {Sensor data is objective. But when measuring our environment, measured values are contrasted with our perception, which is always subjective. This makes interpreting sensor measurements difficult for a single person in her personal environment. In this context, the EveryAware projects directly connects the concepts of objective sensor data with subjective impressions and perceptions by providing a collective sensing platform with several client applications allowing to explicitly associate those two data types. The goal is to provide the user with personalized feedback, a characterization of the global as well as her personal environment, and enable her to position her perceptions in this global context. In this poster we summarize the collected data of two EveryAware applications, namely WideNoise for noise measurements and AirProbe for participatory air quality sensing. Basic insights are presented including user activity, learning processes and sensor data to perception correlations. These results provide an outlook on how this data can further be used to understand the connection between sensor data and perceptions.},
  author = {Becker, Martin and Hotho, Andreas and Mueller, Juergen and Kibanov, Mark and Atzmueller, Martin and Stumme, Gerd},
  howpublished = {CSSWS 2014, Poster},
  keywords = {myown},
  title = {Subjective vs. Objective Data: Bridging the Gap},
  year = 2014
  }
  

  %0 Generic
  %1 becker2014subjective
  %A Becker, Martin
  %A Hotho, Andreas
  %A Mueller, Juergen
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %D 2014
  %T Subjective vs. Objective Data: Bridging the Gap
  %U http://www.gesis.org/en/events/css-wintersymposium/poster-presentation/
  %X Sensor data is objective. But when measuring our environment, measured values are contrasted with our perception, which is always subjective. This makes interpreting sensor measurements difficult for a single person in her personal environment. In this context, the EveryAware projects directly connects the concepts of objective sensor data with subjective impressions and perceptions by providing a collective sensing platform with several client applications allowing to explicitly associate those two data types. The goal is to provide the user with personalized feedback, a characterization of the global as well as her personal environment, and enable her to position her perceptions in this global context. In this poster we summarize the collected data of two EveryAware applications, namely WideNoise for noise measurements and AirProbe for participatory air quality sensing. Basic insights are presented including user activity, learning processes and sensor data to perception correlations. These results provide an outlook on how this data can further be used to understand the connection between sensor data and perceptions.
  

2013

• Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: {On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity} Proc. IEEE CPSCom 2013. IEEE Computer Society, Boston, MA, USA (2013).

  BibTeXEndNote

  @inproceedings{kibanov2013evolution,
  address = {Boston, MA, USA},
  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Proc. IEEE CPSCom 2013},
  keywords = {venus},
  publisher = {IEEE Computer Society},
  title = {{On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity}},
  year = 2013
  }
  

  %0 Conference Paper
  %1 kibanov2013evolution
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Proc. IEEE CPSCom 2013
  %C Boston, MA, USA
  %D 2013
  %I IEEE Computer Society
  %T {On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity}
  

• Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks} Proc. ASONAM 2013. ACM Press, New York, NY, USA (2013).

  BibTeXEndNote

  @inproceedings{scholz2013people,
  address = {New York, NY, USA},
  author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
  booktitle = {Proc. ASONAM 2013},
  keywords = {sna},
  publisher = {ACM Press},
  title = {{How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks}},
  year = 2013
  }
  

  %0 Conference Paper
  %1 scholz2013people
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Stumme, Gerd
  %B Proc. ASONAM 2013
  %C New York, NY, USA
  %D 2013
  %I ACM Press
  %T {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks}
  

• Mitzlaff, F., Stumme, G.: Onomastics 2.0 - The Power of Social Co-Occurrences, http://arxiv.org/abs/1303.0484, (2013).

  URLBibTeXEndNote

  Onomastics is "the science or study of the origin and forms of proper names of persons or places." ["Onomastics". Merriam-Webster.com, 2013. http://www.merriam-webster.com (11 February 2013)]. Especially personal names play an important role in daily life, as all over the world future parents are facing the task of finding a suitable given name for their child. This choice is influenced by different factors, such as the social context, language, cultural background and, in particular, personal taste. With the rise of the Social Web and its applications, users more and more interact digitally and participate in the creation of heterogeneous, distributed, collaborative data collections. These sources of data also reflect current and new naming trends as well as new emerging interrelations among names. The present work shows, how basic approaches from the field of social network analysis and information retrieval can be applied for discovering relations among names, thus extending Onomastics by data mining techniques. The considered approach starts with building co-occurrence graphs relative to data from the Social Web, respectively for given names and city names. As a main result, correlations between semantically grounded similarities among names (e.g., geographical distance for city names) and structural graph based similarities are observed. The discovered relations among given names are the foundation of "nameling" [http://nameling.net], a search engine and academic research platform for given names which attracted more than 30,000 users within four months, underpinningthe relevance of the proposed methodology.

  @misc{mitzlaff2013onomastics,
  abstract = {Onomastics is "the science or study of the origin and forms of proper names of persons or places." ["Onomastics". Merriam-Webster.com, 2013. http://www.merriam-webster.com (11 February 2013)]. Especially personal names play an important role in daily life, as all over the world future parents are facing the task of finding a suitable given name for their child. This choice is influenced by different factors, such as the social context, language, cultural background and, in particular, personal taste. With the rise of the Social Web and its applications, users more and more interact digitally and participate in the creation of heterogeneous, distributed, collaborative data collections. These sources of data also reflect current and new naming trends as well as new emerging interrelations among names. The present work shows, how basic approaches from the field of social network analysis and information retrieval can be applied for discovering relations among names, thus extending Onomastics by data mining techniques. The considered approach starts with building co-occurrence graphs relative to data from the Social Web, respectively for given names and city names. As a main result, correlations between semantically grounded similarities among names (e.g., geographical distance for city names) and structural graph based similarities are observed. The discovered relations among given names are the foundation of "nameling" [http://nameling.net], a search engine and academic research platform for given names which attracted more than 30,000 users within four months, underpinningthe relevance of the proposed methodology.},
  author = {Mitzlaff, Folke and Stumme, Gerd},
  keywords = {twitter},
  note = {cite arxiv:1303.0484Comment: Historically, this is the first paper on the analysis of names in the context of the name search engine 'nameling'. arXiv admin note: text overlap with arXiv:1302.4412},
  title = {Onomastics 2.0 - The Power of Social Co-Occurrences},
  year = 2013
  }
  

  %0 Generic
  %1 mitzlaff2013onomastics
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %D 2013
  %T Onomastics 2.0 - The Power of Social Co-Occurrences
  %U http://arxiv.org/abs/1303.0484
  %X Onomastics is "the science or study of the origin and forms of proper names of persons or places." ["Onomastics". Merriam-Webster.com, 2013. http://www.merriam-webster.com (11 February 2013)]. Especially personal names play an important role in daily life, as all over the world future parents are facing the task of finding a suitable given name for their child. This choice is influenced by different factors, such as the social context, language, cultural background and, in particular, personal taste. With the rise of the Social Web and its applications, users more and more interact digitally and participate in the creation of heterogeneous, distributed, collaborative data collections. These sources of data also reflect current and new naming trends as well as new emerging interrelations among names. The present work shows, how basic approaches from the field of social network analysis and information retrieval can be applied for discovering relations among names, thus extending Onomastics by data mining techniques. The considered approach starts with building co-occurrence graphs relative to data from the Social Web, respectively for given names and city names. As a main result, correlations between semantically grounded similarities among names (e.g., geographical distance for city names) and structural graph based similarities are observed. The discovered relations among given names are the foundation of "nameling" [http://nameling.net], a search engine and academic research platform for given names which attracted more than 30,000 users within four months, underpinningthe relevance of the proposed methodology.
  

• Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks In: Rokne, J.G. and Faloutsos, C. (eds.) Proceedings of the 2013 ACM/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Niagara Falls, Canada, August 25-28, 2013. pp. 356–363. ACM, New York, NY, USA (2013).

  URLBibTeXEndNote

  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.

  @inproceedings{scholz2013people,
  abstract = {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.},
  address = {New York, NY, USA},
  author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
  booktitle = {Proceedings of the 2013 ACM/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Niagara Falls, Canada, August 25-28, 2013},
  editor = {Rokne, Jon G. and Faloutsos, Christos},
  keywords = {network},
  pages = {356--363},
  publisher = {ACM},
  title = {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks},
  year = 2013
  }
  

  %0 Conference Paper
  %1 scholz2013people
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Stumme, Gerd
  %B Proceedings of the 2013 ACM/IEEE International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Niagara Falls, Canada, August 25-28, 2013
  %C New York, NY, USA
  %D 2013
  %E Rokne, Jon G.
  %E Faloutsos, Christos
  %I ACM
  %P 356--363
  %T How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks
  %U http://dx.doi.org/10.1145/2492517.2492521
  %X 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.
  

• Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: User-Relatedness and Community Structure in Social Interaction Networks, http://arxiv.org/abs/1309.3888, (2013).

  URLBibTeXEndNote

  With social media and the according social and ubiquitous applications finding their way into everyday life, there is a rapidly growing amount of user generated content yielding explicit and implicit network structures. We consider social activities and phenomena as proxies for user relatedness. Such activities are represented in so-called social interaction networks or evidence networks, with different degrees of explicitness. We focus on evidence networks containing relations on users, which are represented by connections between individual nodes. Explicit interaction networks are then created by specific user actions, for example, when building a friend network. On the other hand, more implicit networks capture user traces or evidences of user actions as observed in Web portals, blogs, resource sharing systems, and many other social services. These implicit networks can be applied for a broad range of analysis methods instead of using expensive gold-standard information. In this paper, we analyze different properties of a set of networks in social media. We show that there are dependencies and correlations between the networks. These allow for drawing reciprocal conclusions concerning pairs of networks, based on the assessment of structural correlations and ranking interchangeability. Additionally, we show how these inter-network correlations can be used for assessing the results of structural analysis techniques, e.g., community mining methods.

  @misc{mitzlaff2013userrelatedness,
  abstract = {With social media and the according social and ubiquitous applications finding their way into everyday life, there is a rapidly growing amount of user generated content yielding explicit and implicit network structures. We consider social activities and phenomena as proxies for user relatedness. Such activities are represented in so-called social interaction networks or evidence networks, with different degrees of explicitness. We focus on evidence networks containing relations on users, which are represented by connections between individual nodes. Explicit interaction networks are then created by specific user actions, for example, when building a friend network. On the other hand, more implicit networks capture user traces or evidences of user actions as observed in Web portals, blogs, resource sharing systems, and many other social services. These implicit networks can be applied for a broad range of analysis methods instead of using expensive gold-standard information. In this paper, we analyze different properties of a set of networks in social media. We show that there are dependencies and correlations between the networks. These allow for drawing reciprocal conclusions concerning pairs of networks, based on the assessment of structural correlations and ranking interchangeability. Additionally, we show how these inter-network correlations can be used for assessing the results of structural analysis techniques, e.g., community mining methods.},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  keywords = {social},
  note = {cite arxiv:1309.3888},
  title = {User-Relatedness and Community Structure in Social Interaction Networks},
  year = 2013
  }
  

  %0 Generic
  %1 mitzlaff2013userrelatedness
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %D 2013
  %T User-Relatedness and Community Structure in Social Interaction Networks
  %U http://arxiv.org/abs/1309.3888
  %X With social media and the according social and ubiquitous applications finding their way into everyday life, there is a rapidly growing amount of user generated content yielding explicit and implicit network structures. We consider social activities and phenomena as proxies for user relatedness. Such activities are represented in so-called social interaction networks or evidence networks, with different degrees of explicitness. We focus on evidence networks containing relations on users, which are represented by connections between individual nodes. Explicit interaction networks are then created by specific user actions, for example, when building a friend network. On the other hand, more implicit networks capture user traces or evidences of user actions as observed in Web portals, blogs, resource sharing systems, and many other social services. These implicit networks can be applied for a broad range of analysis methods instead of using expensive gold-standard information. In this paper, we analyze different properties of a set of networks in social media. We show that there are dependencies and correlations between the networks. These allow for drawing reciprocal conclusions concerning pairs of networks, based on the assessment of structural correlations and ranking interchangeability. Additionally, we show how these inter-network correlations can be used for assessing the results of structural analysis techniques, e.g., community mining methods.
  

• Mitzlaff, F., Stumme, G.: Recommending Given Names, http://arxiv.org/abs/1302.4412, (2013).

  URLBibTeXEndNote

  All over the world, future parents are facing the task of finding a suitable given name for their child. This choice is influenced by different factors, such as the social context, language, cultural background and especially personal taste. Although this task is omnipresent, little research has been conducted on the analysis and application of interrelations among given names from a data mining perspective. The present work tackles the problem of recommending given names, by firstly mining for inter-name relatedness in data from the Social Web. Based on these results, the name search engine "Nameling" was built, which attracted more than 35,000 users within less than six months, underpinning the relevance of the underlying recommendation task. The accruing usage data is then used for evaluating different state-of-the-art recommendation systems, as well our new \NR algorithm which we adopted from our previous work on folksonomies and which yields the best results, considering the trade-off between prediction accuracy and runtime performance as well as its ability to generate personalized recommendations. We also show, how the gathered inter-name relationships can be used for meaningful result diversification of PageRank-based recommendation systems. As all of the considered usage data is made publicly available, the present work establishes baseline results, encouraging other researchers to implement advanced recommendation systems for given names.

  @misc{mitzlaff2013recommending,
  abstract = {All over the world, future parents are facing the task of finding a suitable given name for their child. This choice is influenced by different factors, such as the social context, language, cultural background and especially personal taste. Although this task is omnipresent, little research has been conducted on the analysis and application of interrelations among given names from a data mining perspective. The present work tackles the problem of recommending given names, by firstly mining for inter-name relatedness in data from the Social Web. Based on these results, the name search engine "Nameling" was built, which attracted more than 35,000 users within less than six months, underpinning the relevance of the underlying recommendation task. The accruing usage data is then used for evaluating different state-of-the-art recommendation systems, as well our new \NR algorithm which we adopted from our previous work on folksonomies and which yields the best results, considering the trade-off between prediction accuracy and runtime performance as well as its ability to generate personalized recommendations. We also show, how the gathered inter-name relationships can be used for meaningful result diversification of PageRank-based recommendation systems. As all of the considered usage data is made publicly available, the present work establishes baseline results, encouraging other researchers to implement advanced recommendation systems for given names.},
  author = {Mitzlaff, Folke and Stumme, Gerd},
  keywords = {recommender},
  note = {cite arxiv:1302.4412Comment: Baseline results for the ECML PKDD Discovery Challenge 2013},
  title = {Recommending Given Names},
  year = 2013
  }
  

  %0 Generic
  %1 mitzlaff2013recommending
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %D 2013
  %T Recommending Given Names
  %U http://arxiv.org/abs/1302.4412
  %X All over the world, future parents are facing the task of finding a suitable given name for their child. This choice is influenced by different factors, such as the social context, language, cultural background and especially personal taste. Although this task is omnipresent, little research has been conducted on the analysis and application of interrelations among given names from a data mining perspective. The present work tackles the problem of recommending given names, by firstly mining for inter-name relatedness in data from the Social Web. Based on these results, the name search engine "Nameling" was built, which attracted more than 35,000 users within less than six months, underpinning the relevance of the underlying recommendation task. The accruing usage data is then used for evaluating different state-of-the-art recommendation systems, as well our new \NR algorithm which we adopted from our previous work on folksonomies and which yields the best results, considering the trade-off between prediction accuracy and runtime performance as well as its ability to generate personalized recommendations. We also show, how the gathered inter-name relationships can be used for meaningful result diversification of PageRank-based recommendation systems. As all of the considered usage data is made publicly available, the present work establishes baseline results, encouraging other researchers to implement advanced recommendation systems for given names.
  

• Mueller, J., Doerfel, S., Becker, M., Hotho, A., Stumme, G.: Tag Recommendations for SensorFolkSonomies Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings. CEUR-WS, Aachen, Germany (2013).

  URLBibTeXEndNote

  With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.

  @inproceedings{mueller2013recommendations,
  abstract = {With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.},
  address = {Aachen, Germany},
  author = {Mueller, Juergen and Doerfel, Stephan and Becker, Martin and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings},
  keywords = {myown},
  publisher = {CEUR-WS},
  title = {Tag Recommendations for SensorFolkSonomies},
  volume = 1066,
  year = 2013
  }
  

  %0 Conference Paper
  %1 mueller2013recommendations
  %A Mueller, Juergen
  %A Doerfel, Stephan
  %A Becker, Martin
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings
  %C Aachen, Germany
  %D 2013
  %I CEUR-WS
  %T Tag Recommendations for SensorFolkSonomies
  %U http://ceur-ws.org/Vol-1066/
  %V 1066
  %X With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.
  

• Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)} Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).

  BibTeXEndNote

  @inproceedings{kibanov2013evolution,
  address = {Bamberg, Germany},
  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Proc. LWA 2013 (KDML Special Track)},
  keywords = {venus},
  publisher = {University of Bamberg},
  title = {{Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)}},
  year = 2013
  }
  

  %0 Conference Paper
  %1 kibanov2013evolution
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Proc. LWA 2013 (KDML Special Track)
  %C Bamberg, Germany
  %D 2013
  %I University of Bamberg
  %T {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)}
  

• Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity Cyber, Physical and Social Computing (CPSCom), 2013 IEEE International Conference on. IEEE Computer Society, Los Alamitos, CA, USA (2013).

  BibTeXEndNote

  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.

  @inproceedings{kibanov2013evolution,
  abstract = {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.},
  address = {Los Alamitos, CA, USA},
  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Cyber, Physical and Social Computing (CPSCom), 2013 IEEE International Conference on},
  keywords = {ubicon},
  publisher = {IEEE Computer Society},
  title = {On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity},
  year = 2013
  }
  

  %0 Conference Paper
  %1 kibanov2013evolution
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Cyber, Physical and Social Computing (CPSCom), 2013 IEEE International Conference on
  %C Los Alamitos, CA, USA
  %D 2013
  %I IEEE Computer Society
  %T On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity
  %X 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.
  

• Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks Advances in Social Networks Analysis and Mining (ASONAM), 2013 International Conference on. , Los Alamitos, CA, USA (2013).

  BibTeXEndNote

  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.

  @inproceedings{scholz2013people,
  abstract = {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.},
  address = {Los Alamitos, CA, USA},
  author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
  booktitle = {Advances in Social Networks Analysis and Mining (ASONAM), 2013 International Conference on},
  keywords = {network},
  title = {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks},
  year = 2013
  }
  

  %0 Conference Paper
  %1 scholz2013people
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Stumme, Gerd
  %B Advances in Social Networks Analysis and Mining (ASONAM), 2013 International Conference on
  %C Los Alamitos, CA, USA
  %D 2013
  %T How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks
  %X 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.
  

• Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: {Semantics of User Interaction in Social Media} In: Ghoshal, G., Poncela-Casasnovas, J., and Tolksdorf, R. (eds.) Complex Networks IV. Springer Verlag, Heidelberg, Germany (2013).

  BibTeXEndNote

  @incollection{mitzlaff2013semantics,
  address = {Heidelberg, Germany},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Stumme, Gerd and Hotho, Andreas},
  booktitle = {Complex Networks IV},
  editor = {Ghoshal, Gourab and Poncela-Casasnovas, Julia and Tolksdorf, Robert},
  keywords = {venus},
  publisher = {Springer Verlag},
  series = {Studies in Computational Intelligence},
  title = {{Semantics of User Interaction in Social Media}},
  volume = 476,
  year = 2013
  }
  

  %0 Book Section
  %1 mitzlaff2013semantics
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %A Hotho, Andreas
  %B Complex Networks IV
  %C Heidelberg, Germany
  %D 2013
  %E Ghoshal, Gourab
  %E Poncela-Casasnovas, Julia
  %E Tolksdorf, Robert
  %I Springer Verlag
  %R 10.1007/978-3-642-36844-8_2
  %T {Semantics of User Interaction in Social Media}
  %V 476
  

• Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: {On the Semantics of User Interaction in Social Media (Extended Abstract)} Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).

  URLBibTeXEndNote

  @inproceedings{MASH:13b,
  address = {Bamberg, Germany},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Stumme, Gerd and Hotho, Andreas},
  booktitle = {Proc. LWA 2013 (KDML Special Track)},
  keywords = {user},
  publisher = {University of Bamberg},
  title = {{On the Semantics of User Interaction in Social Media (Extended Abstract)}},
  year = 2013
  }
  

  %0 Conference Paper
  %1 MASH:13b
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %A Hotho, Andreas
  %B Proc. LWA 2013 (KDML Special Track)
  %C Bamberg, Germany
  %D 2013
  %I University of Bamberg
  %T {On the Semantics of User Interaction in Social Media (Extended Abstract)}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2013-lwa-kdml-user-semantics-social-media-extended-abstract.pdf
  

• Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: {User-Relatedness and Community Structure in Social Interaction Networks} CoRR/abs. 1309.3888, (2013).

  BibTeXEndNote

  @article{mitzlaff2013userrelatedness,
  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  journal = {CoRR/abs},
  keywords = {web},
  title = {{User-Relatedness and Community Structure in Social Interaction Networks}},
  volume = {1309.3888},
  year = 2013
  }
  

  %0 Journal Article
  %1 mitzlaff2013userrelatedness
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %D 2013
  %J CoRR/abs
  %T {User-Relatedness and Community Structure in Social Interaction Networks}
  %V 1309.3888
  

• Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract)} Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).

  URLBibTeXEndNote

  @inproceedings{KASS:13b,
  address = {Bamberg, Germany},
  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Proc. LWA 2013 (KDML Special Track)},
  keywords = {venus},
  publisher = {University of Bamberg},
  title = {{Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract)}},
  year = 2013
  }
  

  %0 Conference Paper
  %1 KASS:13b
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Proc. LWA 2013 (KDML Special Track)
  %C Bamberg, Germany
  %D 2013
  %I University of Bamberg
  %T {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract)}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2013-lwa-kdml-community-evolution-extended-abstract.pdf
  

• Atzmueller, M., Kibanov, M., Scholz, C., Stumme, G.: {Conferator - a Social System for Conference and Contact Management}, (2013).

  BibTeXEndNote

  @misc{atzmueller2013conferator,
  author = {Atzmueller, Martin and Kibanov, Mark and Scholz, Christoph and Stumme, Gerd},
  howpublished = {Poster at INFORMATIK 2013},
  institution = {University of Koblenz-Landau},
  keywords = {venus},
  publisher = {INFORMATIK 2013},
  title = {{Conferator - a Social System for Conference and Contact Management}},
  year = 2013
  }
  

  %0 Generic
  %1 atzmueller2013conferator
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Scholz, Christoph
  %A Stumme, Gerd
  %D 2013
  %I INFORMATIK 2013
  %T {Conferator - a Social System for Conference and Contact Management}
  

• Scholz, {Christoph, Atzmueller, M., Barrat, A., Cattuto, C., Gerd Stumme}: {New Insights and Methods For Predicting Face-To-Face Contacts} Proc. 7th Intl. AAAI Conference on Weblogs and Social Media. AAAI Press, Palo Alto, CA, USA (2013).

  BibTeXEndNote

  @inproceedings{christophscholzandmartinatzmuellerandalainbarratandcirocattutoandgerdstumme2013insights,
  address = {Palo Alto, CA, USA},
  author = {{Christoph Scholz and Martin Atzmueller and Alain Barrat and Ciro Cattuto and Gerd Stumme}},
  booktitle = {Proc. 7th Intl. AAAI Conference on Weblogs and Social Media},
  keywords = {venus},
  publisher = {AAAI Press},
  title = {{New Insights and Methods For Predicting Face-To-Face Contacts}},
  year = 2013
  }
  

  %0 Conference Paper
  %1 christophscholzandmartinatzmuellerandalainbarratandcirocattutoandgerdstumme2013insights
  %A Scholz, {Christoph
  %A Atzmueller, Martin
  %A Barrat, Alain
  %A Cattuto, Ciro
  %A Gerd Stumme},
  %B Proc. 7th Intl. AAAI Conference on Weblogs and Social Media
  %C Palo Alto, CA, USA
  %D 2013
  %I AAAI Press
  %T {New Insights and Methods For Predicting Face-To-Face Contacts}
  

• Becker, M., Mueller, J., Hotho, A., Stumme, G.: A Generic Platform for Ubiquitous and Subjective Data 1st International Workshop on Pervasive Urban Crowdsensing Architecture and Applications, PUCAA 2013, Zurich, Switzerland -- September 9, 2013. Proceedings. pp. 1175–1182. ACM, New York, NY, USA (2013).

  BibTeXEndNote

  An increasing number of platforms like Xively or ThingSpeak are available to manage ubiquitous sensor data enabling the Internet of Things. Strict data formats allow interoperability and informative visualizations, supporting the development of custom user applications. Yet, these strict data formats as well as the common feed-centric approach limit the flexibility of these platforms. We aim at providing a concept that supports data ranging from text-based formats like JSON to images and video footage. Furthermore, we introduce the concept of extensions, which allows to enrich existing data points with additional information, thus, taking a data point centric approach. This enables us to gain semantic and user specific context by attaching subjective data to objective values. This paper provides an overview of our architecture including concept, implementation details and present applications. We distinguish our approach from several other systems and describe two sensing applications namely AirProbe and WideNoise that were implemented for our platform.

  @inproceedings{becker2013generic,
  abstract = {An increasing number of platforms like Xively or ThingSpeak are available to manage ubiquitous sensor data enabling the Internet of Things. Strict data formats allow interoperability and informative visualizations, supporting the development of custom user applications. Yet, these strict data formats as well as the common feed-centric approach limit the flexibility of these platforms. We aim at providing a concept that supports data ranging from text-based formats like JSON to images and video footage. Furthermore, we introduce the concept of extensions, which allows to enrich existing data points with additional information, thus, taking a data point centric approach. This enables us to gain semantic and user specific context by attaching subjective data to objective values. This paper provides an overview of our architecture including concept, implementation details and present applications. We distinguish our approach from several other systems and describe two sensing applications namely AirProbe and WideNoise that were implemented for our platform.},
  address = {New York, NY, USA},
  author = {Becker, Martin and Mueller, Juergen and Hotho, Andreas and Stumme, Gerd},
  booktitle = {1st International Workshop on Pervasive Urban Crowdsensing Architecture and Applications, PUCAA 2013, Zurich, Switzerland -- September 9, 2013. Proceedings},
  keywords = {workshop},
  pages = {1175--1182},
  publisher = {ACM},
  title = {A Generic Platform for Ubiquitous and Subjective Data},
  year = 2013
  }
  

  %0 Conference Paper
  %1 becker2013generic
  %A Becker, Martin
  %A Mueller, Juergen
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B 1st International Workshop on Pervasive Urban Crowdsensing Architecture and Applications, PUCAA 2013, Zurich, Switzerland -- September 9, 2013. Proceedings
  %C New York, NY, USA
  %D 2013
  %I ACM
  %P 1175--1182
  %R 10.1145/2494091.2499776
  %T A Generic Platform for Ubiquitous and Subjective Data
  %X An increasing number of platforms like Xively or ThingSpeak are available to manage ubiquitous sensor data enabling the Internet of Things. Strict data formats allow interoperability and informative visualizations, supporting the development of custom user applications. Yet, these strict data formats as well as the common feed-centric approach limit the flexibility of these platforms. We aim at providing a concept that supports data ranging from text-based formats like JSON to images and video footage. Furthermore, we introduce the concept of extensions, which allows to enrich existing data points with additional information, thus, taking a data point centric approach. This enables us to gain semantic and user specific context by attaching subjective data to objective values. This paper provides an overview of our architecture including concept, implementation details and present applications. We distinguish our approach from several other systems and describe two sensing applications namely AirProbe and WideNoise that were implemented for our platform.
  

• Mueller, J., Doerfel, S., Becker, M., Hotho, A., Stumme, G.: Tag Recommendations for SensorFolkSonomies Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings. p. New York, NY, USA. ACM (2013).

  BibTeXEndNote

  With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.

  @inproceedings{mueller2013recommendations,
  abstract = {With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.},
  author = {Mueller, Juergen and Doerfel, Stephan and Becker, Martin and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings},
  keywords = {widenoise},
  note = {accepted for publication},
  pages = {New York, NY, USA},
  publisher = {ACM},
  title = {Tag Recommendations for SensorFolkSonomies},
  year = 2013
  }
  

  %0 Conference Paper
  %1 mueller2013recommendations
  %A Mueller, Juergen
  %A Doerfel, Stephan
  %A Becker, Martin
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings
  %D 2013
  %I ACM
  %P New York, NY, USA
  %T Tag Recommendations for SensorFolkSonomies
  %X With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.
  

• Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks ASONAM (2013).

  BibTeXEndNote

  @inproceedings{scholz2013people,
  author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
  booktitle = {ASONAM},
  keywords = {social},
  title = {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks},
  year = 2013
  }
  

  %0 Conference Paper
  %1 scholz2013people
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Stumme, Gerd
  %B ASONAM
  %D 2013
  %T How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks
  

• Atzmueller, M., Kibanov, M., Scholz, C., Stumme, G.: Conferator - a Social System for Conference and Contact Management, (2013).

  BibTeXEndNote

  @misc{atzmueller2013conferator,
  author = {Atzmueller, Martin and Kibanov, Mark and Scholz, Christoph and Stumme, Gerd},
  howpublished = {INFORMATIK 2013, Poster},
  keywords = {ubicon},
  title = {Conferator - a Social System for Conference and Contact Management},
  year = 2013
  }
  

  %0 Generic
  %1 atzmueller2013conferator
  %A Atzmueller, Martin
  %A Kibanov, Mark
  %A Scholz, Christoph
  %A Stumme, Gerd
  %D 2013
  %T Conferator - a Social System for Conference and Contact Management
  

• Doerfel, S., Jäschke, R.: An Analysis of Tag-Recommender Evaluation Procedures Proceedings of the 7th ACM conference on Recommender systems. pp. 343–346. ACM, Hong Kong, China (2013).

  URLBibTeXEndNote

  Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.

  @inproceedings{doerfel2013analysis,
  abstract = {Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.},
  address = {New York, NY, USA},
  author = {Doerfel, Stephan and Jäschke, Robert},
  booktitle = {Proceedings of the 7th ACM conference on Recommender systems},
  keywords = {tag},
  pages = {343--346},
  publisher = {ACM},
  series = {RecSys '13},
  title = {An Analysis of Tag-Recommender Evaluation Procedures},
  year = 2013
  }
  

  %0 Conference Paper
  %1 doerfel2013analysis
  %A Doerfel, Stephan
  %A Jäschke, Robert
  %B Proceedings of the 7th ACM conference on Recommender systems
  %C New York, NY, USA
  %D 2013
  %I ACM
  %P 343--346
  %R 10.1145/2507157.2507222
  %T An Analysis of Tag-Recommender Evaluation Procedures
  %U http://doi.acm.org/10.1145/2507157.2507222
  %X Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.
  %@ 978-1-4503-2409-0
  

• Doerfel, S., Hotho, A., Kartal-Aydemir, A., Roßnagel, A., Stumme, G.: Informationelle Selbstbestimmung Im Web 2.0 Chancen Und Risiken Sozialer Verschlagwortungssysteme Vieweg + Teubner Verlag (2013).

  URLBibTeXEndNote

  @book{doerfel2013informationelle,
  author = {Doerfel, Stephan and Hotho, Andreas and Kartal-Aydemir, Aliye and Roßnagel, Alexander and Stumme, Gerd},
  keywords = {web},
  publisher = {Vieweg + Teubner Verlag},
  title = {Informationelle Selbstbestimmung Im Web 2.0 Chancen Und Risiken Sozialer Verschlagwortungssysteme},
  year = 2013
  }
  

  %0 Book
  %1 doerfel2013informationelle
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Kartal-Aydemir, Aliye
  %A Roßnagel, Alexander
  %A Stumme, Gerd
  %D 2013
  %I Vieweg + Teubner Verlag
  %T Informationelle Selbstbestimmung Im Web 2.0 Chancen Und Risiken Sozialer Verschlagwortungssysteme
  %U http://www.worldcat.org/search?qt=worldcat_org_all&q=9783642380556
  %@ 9783642380556 3642380557
  

• Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity In: Guerrero, J.E. (ed.) Proceedings of the 2013 IEEE Cyber, Physical and Social Computing, CPSCom 2013, Beijing, China, 20-23 August, 2013. pp. 993–1000. IEEE Computer Society, Los Alamitos, CA, USA (2013).

  URLBibTeXEndNote

  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.

  @inproceedings{kibanov2013evolution,
  abstract = {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.},
  address = {Los Alamitos, CA, USA},
  author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Proceedings of the 2013 IEEE Cyber, Physical and Social Computing, CPSCom 2013, Beijing, China, 20-23 August, 2013},
  editor = {Guerrero, Juan E.},
  keywords = {ubicon},
  pages = {993--1000},
  publisher = {IEEE Computer Society},
  title = {On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity},
  year = 2013
  }
  

  %0 Conference Paper
  %1 kibanov2013evolution
  %A Kibanov, Mark
  %A Atzmueller, Martin
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Proceedings of the 2013 IEEE Cyber, Physical and Social Computing, CPSCom 2013, Beijing, China, 20-23 August, 2013
  %C Los Alamitos, CA, USA
  %D 2013
  %E Guerrero, Juan E.
  %I IEEE Computer Society
  %P 993--1000
  %T On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity
  %U http://dx.doi.org/10.1109/GreenCom-iThings-CPSCom.2013.170
  %X 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.
  

2012

• Krause, B., Lerch, H., Hotho, A., Roßnagel, A., Stumme, G.: Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy. Informatik Spektrum. 35, 12–23 (2012).

  URLBibTeXEndNote

  @article{journals/insk/KrauseLHRS12,
  author = {Krause, Beate and Lerch, Hana and Hotho, Andreas and Roßnagel, Alexander and Stumme, Gerd},
  journal = {Informatik Spektrum},
  keywords = {tagging},
  number = 1,
  pages = {12-23},
  title = {Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy.},
  volume = 35,
  year = 2012
  }
  

  %0 Journal Article
  %1 journals/insk/KrauseLHRS12
  %A Krause, Beate
  %A Lerch, Hana
  %A Hotho, Andreas
  %A Roßnagel, Alexander
  %A Stumme, Gerd
  %D 2012
  %J Informatik Spektrum
  %N 1
  %P 12-23
  %T Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy.
  %U http://dblp.uni-trier.de/db/journals/insk/insk35.html#KrauseLHRS12
  %V 35
  

• Atzmueller, M., Becker, M., Doerfel, S., Kibanov, M., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Scholz, C., Stumme, G.: Ubicon: Observing Social and Physical Activities IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besançon, France, 20-23 November, 2012. IEEE, Washington, DC, USA (2012).

  BibTeXEndNote

  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.

  @inproceedings{mueller-2012,
  abstract = {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.},
  address = {Washington, DC, USA},
  author = {Atzmueller, Martin and Becker, Martin and Doerfel, Stephan and Kibanov, Mark and Hotho, Andreas and Macek, Björn-Elmar and Mitzlaff, Folke and Mueller, Juergen and Scholz, Christoph and Stumme, Gerd},
  booktitle = {IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besançon, France, 20-23 November, 2012},
  keywords = {ubicon},
  publisher = {IEEE},
  title = {Ubicon: Observing Social and Physical Activities},
  year = 2012
  }
  

  %0 Conference Paper
  %1 mueller-2012
  %A Atzmueller, Martin
  %A Becker, Martin
  %A Doerfel, Stephan
  %A Kibanov, Mark
  %A Hotho, Andreas
  %A Macek, Björn-Elmar
  %A Mitzlaff, Folke
  %A Mueller, Juergen
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besançon, France, 20-23 November, 2012
  %C Washington, DC, USA
  %D 2012
  %I IEEE
  %T Ubicon: Observing Social and Physical Activities
  %X 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.
  

• Doerfel, S., Jäschke, R., Hotho, A., Stumme, G.: Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web. pp. 9–16. ACM, Dublin, Ireland (2012).

  URLBibTeXEndNote

  The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.

  @inproceedings{doerfel2012leveraging,
  abstract = {The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.},
  address = {New York, NY, USA},
  author = {Doerfel, Stephan and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web},
  keywords = {tagging},
  month = {sep},
  pages = {9--16},
  publisher = {ACM},
  title = {Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation},
  year = 2012
  }
  

  %0 Conference Paper
  %1 doerfel2012leveraging
  %A Doerfel, Stephan
  %A Jäschke, Robert
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web
  %C New York, NY, USA
  %D 2012
  %I ACM
  %P 9--16
  %R 10.1145/2365934.2365937
  %T Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation
  %U http://doi.acm.org/10.1145/2365934.2365937
  %X The ever-growing flood of new scientific articles requires novel retrieval mechanisms. One means for mitigating this instance of the information overload phenomenon are collaborative tagging systems, that allow users to select, share and annotate references to publications. These systems employ recommendation algorithms to present to their users personalized lists of interesting and relevant publications. In this paper we analyze different ways to incorporate social data and metadata from collaborative tagging systems into the graph-based ranking algorithm FolkRank to utilize it for recommending scientific articles to users of the social bookmarking system BibSonomy. We compare the results to those of Collaborative Filtering, which has previously been applied for resource recommendation.
  %@ 978-1-4503-1638-5
  

• Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles {Modeling and Mining Ubiquitous Social Media}. Springer Verlag, Heidelberg, Germany (2012).

  URLBibTeXEndNote

  @incollection{ADHMS:12,
  address = {Heidelberg, Germany},
  author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},
  booktitle = {{Modeling and Mining Ubiquitous Social Media}},
  keywords = {venuspub,2012},
  publisher = {Springer Verlag},
  series = {LNAI},
  title = {Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles},
  volume = 7472,
  year = 2012
  }
  

  %0 Book Section
  %1 ADHMS:12
  %A Atzmueller, Martin
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %B {Modeling and Mining Ubiquitous Social Media}
  %C Heidelberg, Germany
  %D 2012
  %I Springer Verlag
  %T Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/atzmueller-face-to-face-contacts-dynamics-lnai-2012.pdf
  %V 7472
  

• Scholz, C., Atzmueller, M., Stumme, G.: On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties Proceedings of the 2012 ASE/IEEE International Conference on Social Computing and 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust. pp. 312–321. IEEE Computer Society, Washington, DC, USA (2012).

  URLBibTeXEndNote

  While the analysis of online social networks is a prominent research topic, offline real-world networks are still not covered extensively. However, their analysis can provide important insights into human behavior. In this paper, we analyze influence factors for link prediction in human contact networks. Specifically, we consider the prediction of new links, and extend it to the analysis of recurring links. Furthermore, we consider the impact of stronger ties for the prediction. The results and insights of the analysis are a first step onto predictability applications for human contact networks.

  @inproceedings{Scholz:2012:PHC:2411131.2411662,
  abstract = {While the analysis of online social networks is a prominent research topic, offline real-world networks are still not covered extensively. However, their analysis can provide important insights into human behavior. In this paper, we analyze influence factors for link prediction in human contact networks. Specifically, we consider the prediction of new links, and extend it to the analysis of recurring links. Furthermore, we consider the impact of stronger ties for the prediction. The results and insights of the analysis are a first step onto predictability applications for human contact networks.},
  address = {Washington, DC, USA},
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proceedings of the 2012 ASE/IEEE International Conference on Social Computing and 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust},
  keywords = {venus},
  pages = {312--321},
  publisher = {IEEE Computer Society},
  series = {SOCIALCOM-PASSAT '12},
  title = {On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties},
  year = 2012
  }
  

  %0 Conference Paper
  %1 Scholz:2012:PHC:2411131.2411662
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proceedings of the 2012 ASE/IEEE International Conference on Social Computing and 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust
  %C Washington, DC, USA
  %D 2012
  %I IEEE Computer Society
  %P 312--321
  %R 10.1109/SocialCom-PASSAT.2012.49
  %T On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties
  %U http://dx.doi.org/10.1109/SocialCom-PASSAT.2012.49
  %X While the analysis of online social networks is a prominent research topic, offline real-world networks are still not covered extensively. However, their analysis can provide important insights into human behavior. In this paper, we analyze influence factors for link prediction in human contact networks. Specifically, we consider the prediction of new links, and extend it to the analysis of recurring links. Furthermore, we consider the impact of stronger ties for the prediction. The results and insights of the analysis are a first step onto predictability applications for human contact networks.
  %@ 978-0-7695-4848-7
  

• Mitzlaff, F., Stumme, G.: Ranking Given Names In: Marathe, M. and Contractor, N. (eds.) Proceedings of the 1st ASE International Conference on Social Informatics. pp. 185–191. IEEE computer society (2012).

  BibTeXEndNote

  @inproceedings{mitzlaff2012ranking,
  author = {Mitzlaff, Folke and Stumme, Gerd},
  booktitle = {Proceedings of the 1st ASE International Conference on Social Informatics},
  editor = {Marathe, Madhav and Contractor, Noshir},
  keywords = {serach},
  pages = {185-191},
  publisher = {IEEE computer society},
  title = {Ranking Given Names},
  year = 2012
  }
  

  %0 Conference Paper
  %1 mitzlaff2012ranking
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %B Proceedings of the 1st ASE International Conference on Social Informatics
  %D 2012
  %E Marathe, Madhav
  %E Contractor, Noshir
  %I IEEE computer society
  %P 185-191
  %T Ranking Given Names
  

• Mitzlaff, F., Stumme, G.: Namelings - Discover Given Name Relatedness Based on Data from the Social Web. In: Aberer, K., Flache, A., Jager, W., Liu, L., Tang, J., and Guéret, C. (eds.) SocInfo. pp. 531–534. Springer (2012).

  URLBibTeXEndNote

  @inproceedings{mitzlaff2012namelings,
  author = {Mitzlaff, Folke and Stumme, Gerd},
  booktitle = {SocInfo},
  editor = {Aberer, Karl and Flache, Andreas and Jager, Wander and Liu, Ling and Tang, Jie and Guéret, Christophe},
  keywords = {search},
  pages = {531-534},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Namelings - Discover Given Name Relatedness Based on Data from the Social Web.},
  volume = 7710,
  year = 2012
  }
  

  %0 Conference Paper
  %1 mitzlaff2012namelings
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %B SocInfo
  %D 2012
  %E Aberer, Karl
  %E Flache, Andreas
  %E Jager, Wander
  %E Liu, Ling
  %E Tang, Jie
  %E Guéret, Christophe
  %I Springer
  %P 531-534
  %T Namelings - Discover Given Name Relatedness Based on Data from the Social Web.
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/mitzlaff2012namelings.pdf
  %V 7710
  %@ 978-3-642-35385-7
  

• Balby Marinho, L., Hotho, A., Jäschke, R., Nanopoulos, A., Rendle, S., Schmidt-Thieme, L., Stumme, G., Symeonidis, P.: Recommender Systems for Social Tagging Systems Springer (2012).

  URLBibTeXEndNote

  Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.

  @book{balbymarinho2012recommender,
  abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.},
  author = {Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.},
  keywords = {tagging,2012},
  month = {feb},
  publisher = {Springer},
  series = {SpringerBriefs in Electrical and Computer Engineering},
  title = {Recommender Systems for Social Tagging Systems},
  year = 2012
  }
  

  %0 Book
  %1 balbymarinho2012recommender
  %A Balby Marinho, L.
  %A Hotho, A.
  %A Jäschke, R.
  %A Nanopoulos, A.
  %A Rendle, S.
  %A Schmidt-Thieme, L.
  %A Stumme, G.
  %A Symeonidis, P.
  %B SpringerBriefs in Electrical and Computer Engineering
  %D 2012
  %I Springer
  %R 10.1007/978-1-4614-1894-8
  %T Recommender Systems for Social Tagging Systems
  %U http://link.springer.com/book/10.1007/978-1-4614-1894-8
  %X Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.
  %@ 978-1-4614-1893-1
  

• Scholz, C., Atzmueller, M., Stumme, G.: {On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties} Proc. Fourth ASE/IEEE International Conference on Social Computing (SocialCom). IEEE Computer Society, Boston, MA, USA (2012).

  URLBibTeXEndNote

  @inproceedings{SAS:12,
  address = {Boston, MA, USA},
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. Fourth ASE/IEEE International Conference on Social Computing (SocialCom)},
  keywords = {venus},
  publisher = {IEEE Computer Society},
  title = {{On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties}},
  year = 2012
  }
  

  %0 Conference Paper
  %1 SAS:12
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. Fourth ASE/IEEE International Conference on Social Computing (SocialCom)
  %C Boston, MA, USA
  %D 2012
  %I IEEE Computer Society
  %T {On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/scholz-on-f2f-predictability-socialcom-2012.pdf
  

• Atzmueller, M., Becker, M., Doerfel, S., Kibanov, M., Hotho, A., Macek, B.-E., Mitzlaff, F., Mueller, J., Scholz, C., Stumme, G.: Ubicon: Observing Social and Physical Activities Proceedings of the 2012 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besançon, France, 20-23 November, 2012. pp. 317–324. IEEE Computer Society, Los Alamitos, CA, USA (2012).

  URLBibTeXEndNote

  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.

  @inproceedings{ABDHKMMMSS:12,
  abstract = {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.},
  address = {Los Alamitos, CA, USA},
  author = {Atzmueller, Martin and Becker, Martin and Doerfel, Stephan and Kibanov, Mark and Hotho, Andreas and Macek, Björn-Elmar and Mitzlaff, Folke and Mueller, Juergen and Scholz, Christoph and Stumme, Gerd},
  booktitle = {Proceedings of the 2012 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besançon, France, 20-23 November, 2012},
  keywords = {ubicon},
  month = {nov},
  pages = {317-324},
  publisher = {IEEE Computer Society},
  title = {Ubicon: Observing Social and Physical Activities},
  year = 2012
  }
  

  %0 Conference Paper
  %1 ABDHKMMMSS:12
  %A Atzmueller, Martin
  %A Becker, Martin
  %A Doerfel, Stephan
  %A Kibanov, Mark
  %A Hotho, Andreas
  %A Macek, Björn-Elmar
  %A Mitzlaff, Folke
  %A Mueller, Juergen
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B Proceedings of the 2012 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besançon, France, 20-23 November, 2012
  %C Los Alamitos, CA, USA
  %D 2012
  %I IEEE Computer Society
  %P 317-324
  %T Ubicon: Observing Social and Physical Activities
  %U http://dx.doi.org/10.1109/GreenCom.2012.75
  %X 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.
  

• Scholz, C., Atzmueller, M., Stumme, G.: {Analyzing the Predictability of Human Contacts: On Influence Factors and Stronger Ties (Extended Abstract)} Proc. LWA 2012 (KDML Special Track). University of Dortmund, Dortmund, Germany (2012).

  URLBibTeXEndNote

  @inproceedings{SAS:12b,
  address = {Dortmund, Germany.},
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. LWA 2012 (KDML Special Track)},
  keywords = {social},
  publisher = {University of Dortmund},
  title = {{Analyzing the Predictability of Human Contacts: On Influence Factors and Stronger Ties (Extended Abstract)}},
  year = 2012
  }
  

  %0 Conference Paper
  %1 SAS:12b
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B Proc. LWA 2012 (KDML Special Track)
  %C Dortmund, Germany.
  %D 2012
  %I University of Dortmund
  %T {Analyzing the Predictability of Human Contacts: On Influence Factors and Stronger Ties (Extended Abstract)}
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/2012-lwa-kdml-link-predictability-f2f-extended-abstract.pdf
  

• Macek, B.E., Scholz, C., Atzmueller, M., Stumme, G.: Anatomy of a Conference 23rd ACM Conference on Hypertext and Social Media, HT ’12. pp. 245–254. ACM, Milwaukee, WI, USA, June 25-28, 2012 (2012).

  URLBibTeXEndNote

  @inproceedings{MacekASS11,
  address = {Milwaukee, WI, USA, June 25-28, 2012},
  author = {Macek, Bjoern Elmar and Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {23rd ACM Conference on Hypertext and Social Media, HT '12},
  keywords = {venus},
  note = {Best Paper},
  pages = {245-254},
  publisher = {ACM},
  title = {Anatomy of a Conference},
  year = 2012
  }
  

  %0 Conference Paper
  %1 MacekASS11
  %A Macek, Bjoern Elmar
  %A Scholz, Christoph
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %B 23rd ACM Conference on Hypertext and Social Media, HT '12
  %C Milwaukee, WI, USA, June 25-28, 2012
  %D 2012
  %I ACM
  %P 245-254
  %T Anatomy of a Conference
  %U http://dl.acm.org/citation.cfm?id=2309996
  

• Jäschke, R., Hotho, A., Mitzlaff, F., Stumme, G.: Challenges in Tag Recommendations for Collaborative Tagging Systems In: Pazos Arias, J.J., Fernández Vilas, A., and Díaz Redondo, R.P. (eds.) Recommender Systems for the Social Web. pp. 65–87. Springer, Berlin/Heidelberg (2012).

  URLBibTeXEndNote

  Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.

  @incollection{jaeschke2012challenges,
  abstract = {Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.},
  address = {Berlin/Heidelberg},
  author = {Jäschke, Robert and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},
  booktitle = {Recommender Systems for the Social Web},
  editor = {Pazos Arias, José J. and Fernández Vilas, Ana and Díaz Redondo, Rebeca P.},
  keywords = {tagging},
  pages = {65--87},
  publisher = {Springer},
  series = {Intelligent Systems Reference Library},
  title = {Challenges in Tag Recommendations for Collaborative Tagging Systems},
  volume = 32,
  year = 2012
  }
  

  %0 Book Section
  %1 jaeschke2012challenges
  %A Jäschke, Robert
  %A Hotho, Andreas
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %B Recommender Systems for the Social Web
  %C Berlin/Heidelberg
  %D 2012
  %E Pazos Arias, José J.
  %E Fernández Vilas, Ana
  %E Díaz Redondo, Rebeca P.
  %I Springer
  %P 65--87
  %R 10.1007/978-3-642-25694-3_3
  %T Challenges in Tag Recommendations for Collaborative Tagging Systems
  %U http://dx.doi.org/10.1007/978-3-642-25694-3_3
  %V 32
  %X Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.
  %@ 978-3-642-25694-3
  

• Mitzlaff, F., Stumme, G.: Relatedness of Given Names Human Journal. 1, 205–217 (2012).

  URLBibTeXEndNote

  As a result of the author's need for help in finding a given namefor the unborn baby, nameling, a search engine for given names, based on data from the ``Social Web'' was born. Within less than six months, more than 35,000 users accessed nameling with more than 300,000 search requests, underpinning the relevance of the underlying research questions. The present work proposes a new approach for discovering relations among given names, based on co-occurrences within Wikipedia. In particular, the task of finding relevant names for a given search query is considered as a ranking task and the performance of different measures of relatedness among given names are evaluated with respect to nameling's actual usage data. We will show that a modification for the PageRank algorithm overcomes limitations imposed by global network characteristics to preferential PageRank computations. By publishing the considered usage data, the research community is stipulated for developing advanced recommendation systems and analyzing influencing factors for the choice of a given name.

  @article{mitzlaff2012relatedness,
  abstract = {As a result of the author's need for help in finding a given namefor the unborn baby, nameling, a search engine for given names, based on data from the ``Social Web'' was born. Within less than six months, more than 35,000 users accessed nameling with more than 300,000 search requests, underpinning the relevance of the underlying research questions. The present work proposes a new approach for discovering relations among given names, based on co-occurrences within Wikipedia. In particular, the task of finding relevant names for a given search query is considered as a ranking task and the performance of different measures of relatedness among given names are evaluated with respect to nameling's actual usage data. We will show that a modification for the PageRank algorithm overcomes limitations imposed by global network characteristics to preferential PageRank computations. By publishing the considered usage data, the research community is stipulated for developing advanced recommendation systems and analyzing influencing factors for the choice of a given name.},
  author = {Mitzlaff, Folke and Stumme, Gerd},
  journal = {Human Journal},
  keywords = {relatedness},
  number = 4,
  pages = {205-217},
  publisher = {Academy of Science and Engineering},
  title = {Relatedness of Given Names},
  volume = 1,
  year = 2012
  }
  

  %0 Journal Article
  %1 mitzlaff2012relatedness
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %D 2012
  %I Academy of Science and Engineering
  %J Human Journal
  %N 4
  %P 205-217
  %T Relatedness of Given Names
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/mitzlaff2012relatedness.pdf
  %V 1
  %X As a result of the author's need for help in finding a given namefor the unborn baby, nameling, a search engine for given names, based on data from the ``Social Web'' was born. Within less than six months, more than 35,000 users accessed nameling with more than 300,000 search requests, underpinning the relevance of the underlying research questions. The present work proposes a new approach for discovering relations among given names, based on co-occurrences within Wikipedia. In particular, the task of finding relevant names for a given search query is considered as a ranking task and the performance of different measures of relatedness among given names are evaluated with respect to nameling's actual usage data. We will show that a modification for the PageRank algorithm overcomes limitations imposed by global network characteristics to preferential PageRank computations. By publishing the considered usage data, the research community is stipulated for developing advanced recommendation systems and analyzing influencing factors for the choice of a given name.
  

• Behrenbruch, K., Atzmueller, M., Evers, C., Schmidt, L., Stumme, G., Geihs, K.: {A Personality Based Design Approach Using Subgroup Discovery} Human-Centred Software Engineering. pp. 259–266. Springer, Heidelberg, Germany (2012).

  BibTeXEndNote

  To facilitate user-centered software engineering, developers need an easy to grasp understanding of the user. The use of personas helps to keep specific user needs in mind during the design process. Technology acceptance is of particular interest for the design of innovative applications previously unknown to potential users. Therefore, our research focuses on defining a typology of relevant user characteristics with respect to technology acceptance and transferring those findings to the description of personas. The presented work focuses on the statistical relationship between technology acceptance and personality. We apply sub-group discovery as a statistical tool. Based on the statistically derived subgroups and patterns we define the mentioned personas to help developers to understand different forms of technology acceptance. By integrating the specifically defined personas into existing methods in the field of software engineering the feasibility of the presented approach is demonstrated.

  @incollection{BAESSG:12,
  abstract = {To facilitate user-centered software engineering, developers need an easy to grasp understanding of the user. The use of personas helps to keep specific user needs in mind during the design process. Technology acceptance is of particular interest for the design of innovative applications previously unknown to potential users. Therefore, our research focuses on defining a typology of relevant user characteristics with respect to technology acceptance and transferring those findings to the description of personas. The presented work focuses on the statistical relationship between technology acceptance and personality. We apply sub-group discovery as a statistical tool. Based on the statistically derived subgroups and patterns we define the mentioned personas to help developers to understand different forms of technology acceptance. By integrating the specifically defined personas into existing methods in the field of software engineering the feasibility of the presented approach is demonstrated.},
  address = {Heidelberg, Germany},
  author = {Behrenbruch, Kay and Atzmueller, Martin and Evers, Christoph and Schmidt, Ludger and Stumme, Gerd and Geihs, Kurt},
  booktitle = {Human-Centred Software Engineering},
  keywords = {venus},
  pages = {259--266},
  publisher = {Springer},
  series = {LNCS},
  title = {{A Personality Based Design Approach Using Subgroup Discovery}},
  volume = 7623,
  year = 2012
  }
  

  %0 Book Section
  %1 BAESSG:12
  %A Behrenbruch, Kay
  %A Atzmueller, Martin
  %A Evers, Christoph
  %A Schmidt, Ludger
  %A Stumme, Gerd
  %A Geihs, Kurt
  %B Human-Centred Software Engineering
  %C Heidelberg, Germany
  %D 2012
  %I Springer
  %P 259--266
  %T {A Personality Based Design Approach Using Subgroup Discovery}
  %V 7623
  %X To facilitate user-centered software engineering, developers need an easy to grasp understanding of the user. The use of personas helps to keep specific user needs in mind during the design process. Technology acceptance is of particular interest for the design of innovative applications previously unknown to potential users. Therefore, our research focuses on defining a typology of relevant user characteristics with respect to technology acceptance and transferring those findings to the description of personas. The presented work focuses on the statistical relationship between technology acceptance and personality. We apply sub-group discovery as a statistical tool. Based on the statistically derived subgroups and patterns we define the mentioned personas to help developers to understand different forms of technology acceptance. By integrating the specifically defined personas into existing methods in the field of software engineering the feasibility of the presented approach is demonstrated.
  

• Doerfel, S., Jäschke, R., Stumme, G.: Publication Analysis of the Formal Concept Analysis Community In: Domenach, F., Ignatov, D., and Poelmans, J. (eds.) ICFCA 2012. pp. 77–95. Springer, Berlin/Heidelberg (2012).

  URLBibTeXEndNote

  We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences’ history.

  @inproceedings{doerfel2012publication,
  abstract = {We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences’ history.},
  address = {Berlin/Heidelberg},
  author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd},
  booktitle = {ICFCA 2012},
  editor = {Domenach, F. and Ignatov, D.I. and Poelmans, J.},
  keywords = {scientometrics},
  pages = {77--95},
  publisher = {Springer},
  series = {Lecture Notes in Artificial Intelligence},
  title = {Publication Analysis of the Formal Concept Analysis Community},
  volume = 7278,
  year = 2012
  }
  

  %0 Conference Paper
  %1 doerfel2012publication
  %A Doerfel, Stephan
  %A Jäschke, Robert
  %A Stumme, Gerd
  %B ICFCA 2012
  %C Berlin/Heidelberg
  %D 2012
  %E Domenach, F.
  %E Ignatov, D.I.
  %E Poelmans, J.
  %I Springer
  %P 77--95
  %T Publication Analysis of the Formal Concept Analysis Community
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2012publication.pdf
  %V 7278
  %X We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences’ history.
  

2011

• Benz, D., Körner, C., Hotho, A., Stumme, G., Strohmaier, M.: One Tag to Bind Them All: Measuring Term Abstractness in Social Metadata Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).

  BibTeXEndNote

  @inproceedings{benz2011measuring,
  author = {Benz, Dominik and Körner, Christian and Hotho, Andreas and Stumme, Gerd and Strohmaier, Markus},
  booktitle = {Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation},
  keywords = {social},
  title = {One Tag to Bind Them All: Measuring Term Abstractness in Social Metadata},
  year = 2011
  }
  

  %0 Conference Paper
  %1 benz2011measuring
  %A Benz, Dominik
  %A Körner, Christian
  %A Hotho, Andreas
  %A Stumme, Gerd
  %A Strohmaier, Markus
  %B Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation
  %D 2011
  %T One Tag to Bind Them All: Measuring Term Abstractness in Social Metadata
  

• {Björn-Elmar Macek, M.A.: Profile Mining in CVS-Logs and Face-to-Face Contacts for Recommending Software Developers IEEE Computer Society, Boston, MA, USA (2011).

  BibTeXEndNote

  @proceedings{bjrnelmarmacek2011profile,
  address = {Boston, MA, USA},
  author = {{Björn-Elmar Macek, Martin Atzmueller, Gerd Stumme}},
  keywords = {pagerank},
  publisher = {IEEE Computer Society},
  title = {Profile Mining in CVS-Logs and Face-to-Face Contacts for Recommending Software Developers},
  volume = {Proc. IEEE SocialCom},
  year = 2011
  }
  

  %0 Conference Proceedings
  %1 bjrnelmarmacek2011profile
  %A {Björn-Elmar Macek, Martin Atzmueller
  %C Boston, MA, USA
  %D 2011
  %I IEEE Computer Society
  %T Profile Mining in CVS-Logs and Face-to-Face Contacts for Recommending Software Developers
  %V Proc. IEEE SocialCom
  

• Hotho, A., Stumme, G.: From Semantic Web Mining to Social and Ubiquitous Mining - A Subjective View on Past, Current, and Future Research. In: Fensel, D. (ed.) Foundations for the Web of Information and Services. pp. 143–153. Springer (2011).

  URLBibTeXEndNote

  @inproceedings{conf/birthday/HothoS11,
  author = {Hotho, Andreas and Stumme, Gerd},
  booktitle = {Foundations for the Web of Information and Services},
  crossref = {conf/birthday/2011studer},
  editor = {Fensel, Dieter},
  keywords = {web},
  pages = {143-153},
  publisher = {Springer},
  title = {From Semantic Web Mining to Social and Ubiquitous Mining - A Subjective View on Past, Current, and Future Research.},
  year = 2011
  }
  

  %0 Conference Paper
  %1 conf/birthday/HothoS11
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Foundations for the Web of Information and Services
  %D 2011
  %E Fensel, Dieter
  %I Springer
  %P 143-153
  %T From Semantic Web Mining to Social and Ubiquitous Mining - A Subjective View on Past, Current, and Future Research.
  %U http://dblp.uni-trier.de/db/conf/birthday/studer2011.html#HothoS11
  %@ 978-3-642-19796-3
  

• Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: {On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)} Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2011).

  BibTeXEndNote

  @inproceedings{mitzlaff2011semantics,
  address = {Bamberg, Germany},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Stumme, Gerd and Hotho, Andreas},
  booktitle = {Proc. LWA 2013 (KDML Special Track)},
  keywords = {web},
  publisher = {University of Bamberg},
  title = {{On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)}},
  year = 2011
  }
  

  %0 Conference Paper
  %1 mitzlaff2011semantics
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Stumme, Gerd
  %A Hotho, Andreas
  %B Proc. LWA 2013 (KDML Special Track)
  %C Bamberg, Germany
  %D 2011
  %I University of Bamberg
  %T {On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)}
  

• Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: Community Assessment Using Evidence Networks In: Atzmueller, M., Hotho, A., Strohmaier, M., and Chin, A. (eds.) Analysis of Social Media and Ubiquitous Data. pp. 79–98. Springer Berlin Heidelberg (2011).

  URLBibTeXEndNote

  Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups.

  @inproceedings{mitzlaff2011community,
  abstract = {Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups.},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Analysis of Social Media and Ubiquitous Data},
  editor = {Atzmueller, Martin and Hotho, Andreas and Strohmaier, Markus and Chin, Alvin},
  keywords = {networks},
  pages = {79-98},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Community Assessment Using Evidence Networks},
  volume = 6904,
  year = 2011
  }
  

  %0 Conference Paper
  %1 mitzlaff2011community
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Analysis of Social Media and Ubiquitous Data
  %D 2011
  %E Atzmueller, Martin
  %E Hotho, Andreas
  %E Strohmaier, Markus
  %E Chin, Alvin
  %I Springer Berlin Heidelberg
  %P 79-98
  %R 10.1007/978-3-642-23599-3_5
  %T Community Assessment Using Evidence Networks
  %U http://dx.doi.org/10.1007/978-3-642-23599-3_5
  %V 6904
  %X Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups.
  %@ 978-3-642-23598-6
  

• Atzmüller, M., Benz, D., Doerfel, S., Hotho, A., Jäschke, R., Macek, B.-E., {Mitzlaff, F., Stumme, G.: Enhancing Social Interactions at Conferences it - Information Technology, (53)3:101--107, Oldenbourg Wissenschaftsverlag GmbH, May 2011. (2011).

  BibTeXEndNote

  @article{L3S_518093b0d815c42951de5634127244d1b677c06f,
  author = {Atzmüller, Martin and Benz, Dominik and Doerfel, Stephan and Hotho, Andreas and Jäschke, Robert and Macek, Björn-Elmar and {Mitzlaff, Folke}, Christoph Scholz and Stumme, Gerd},
  journal = {it - Information Technology, (53)3:101--107, Oldenbourg Wissenschaftsverlag GmbH, May 2011},
  keywords = {myown},
  title = {Enhancing Social Interactions at Conferences},
  year = 2011
  }
  

  %0 Journal Article
  %1 L3S_518093b0d815c42951de5634127244d1b677c06f
  %A Atzmüller, Martin
  %A Benz, Dominik
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Macek, Björn-Elmar
  %A {Mitzlaff, Folke}
  %A Stumme, Gerd
  %D 2011
  %J it - Information Technology, (53)3:101--107, Oldenbourg Wissenschaftsverlag GmbH, May 2011
  %T Enhancing Social Interactions at Conferences
  

• Atzmüller, M., Benz, D., Doerfel, S., Hotho, A., Jäschke, R., Macek, B.E., Mitzlaff, F., Scholz, C., Stumme, G.: Enhancing Social Interactions at Conferences. it - Information Technology. 53, 101–107 (2011).

  URLBibTeXEndNote

  @article{atzmueller2011enhancing,
  author = {Atzmüller, Martin and Benz, Dominik and Doerfel, Stephan and Hotho, Andreas and Jäschke, Robert and Macek, Bjoern Elmar and Mitzlaff, Folke and Scholz, Christoph and Stumme, Gerd},
  journal = {it - Information Technology},
  keywords = {sociopatterns},
  number = 3,
  pages = {101-107},
  title = {Enhancing Social Interactions at Conferences.},
  volume = 53,
  year = 2011
  }
  

  %0 Journal Article
  %1 atzmueller2011enhancing
  %A Atzmüller, Martin
  %A Benz, Dominik
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Macek, Bjoern Elmar
  %A Mitzlaff, Folke
  %A Scholz, Christoph
  %A Stumme, Gerd
  %D 2011
  %J it - Information Technology
  %N 3
  %P 101-107
  %T Enhancing Social Interactions at Conferences.
  %U http://dblp.uni-trier.de/db/journals/it/it53.html#AtzmullerBDHJMMSS11
  %V 53
  

• Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: Structure and Consistency: Assessment of Social Bookmarking Communities Proceedings from Sunbelt XXXI. , Trade Winds Beach Resort (2011).

  BibTeXEndNote

  @inproceedings{mitzlaff2011social,
  address = {Trade Winds Beach Resort},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings from Sunbelt XXXI},
  keywords = {sunbelt},
  title = {Structure and Consistency: Assessment of Social Bookmarking Communities},
  year = 2011
  }
  

  %0 Conference Paper
  %1 mitzlaff2011social
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings from Sunbelt XXXI
  %C Trade Winds Beach Resort
  %D 2011
  %T Structure and Consistency: Assessment of Social Bookmarking Communities
  

• Atzmüller, M., Benz, D., Doerfel, S., Hotho, A., Jäschke, R., Macek, B.E., Mitzlaff, F., Scholz, C., Stumme, G.: Enhancing Social Interactions at Conferences it - Information Technology. 53, 101–107 (2011).

  URLBibTeXEndNote

  @article{martin2011enhancing,
  author = {Atzmüller, Martin and Benz, Dominik and Doerfel, Stephan and Hotho, Andreas and Jäschke, Robert and Macek, Bjoern Elmar and Mitzlaff, Folke and Scholz, Christoph and Stumme, Gerd},
  booktitle = {it - Information Technology},
  journal = {it - Information Technology},
  keywords = {myown},
  month = {may},
  number = 3,
  pages = {101--107},
  publisher = {Oldenbourg Wissenschaftsverlag GmbH},
  title = {Enhancing Social Interactions at Conferences},
  volume = 53,
  year = 2011
  }
  

  %0 Journal Article
  %1 martin2011enhancing
  %A Atzmüller, Martin
  %A Benz, Dominik
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Macek, Bjoern Elmar
  %A Mitzlaff, Folke
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B it - Information Technology
  %D 2011
  %I Oldenbourg Wissenschaftsverlag GmbH
  %J it - Information Technology
  %N 3
  %P 101--107
  %R 10.1524/itit.2011.0631
  %T Enhancing Social Interactions at Conferences
  %U http://dx.doi.org/10.1524/itit.2011.0631
  %V 53
  

• Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML/PKDD 2011 (2011).

  BibTeXEndNote

  @inproceedings{ADHMS:11,
  author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},
  booktitle = {Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML/PKDD 2011},
  keywords = {rfid},
  title = {Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players},
  year = 2011
  }
  

  %0 Conference Paper
  %1 ADHMS:11
  %A Atzmueller, Martin
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %B Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML/PKDD 2011
  %D 2011
  %T Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players
  

• Bullock, B.N., Lerch, H., Ro\ssnagel, A., Hotho, A., Stumme, G.: Privacy-aware spam detection in social bookmarking systems Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies. pp. 15:1–15:8. ACM, Graz, Austria (2011).

  URLBibTeXEndNote

  With the increased popularity of Web 2.0 services in the last years data privacy has become a major concern for users. The more personal data users reveal, the more difficult it becomes to control its disclosure in the web. However, for Web 2.0 service providers, the data provided by users is a valuable source for offering effective, personalised data mining services. One major application is the detection of spam in social bookmarking systems: in order to prevent a decrease of content quality, providers need to distinguish spammers and exclude them from the system. They thereby experience a conflict of interests: on the one hand, they need to identify spammers based on the information they collect about users, on the other hand, they need to respect privacy concerns and process as few personal data as possible. It would therefore be of tremendous help for system developers and users to know which personal data are needed for spam detection and which can be ignored. In this paper we address these questions by presenting a data privacy aware feature engineering approach. It consists of the design of features for spam classification which are evaluated according to both, performance and privacy conditions. Experiments using data from the social bookmarking system BibSonomy show that both conditions must not exclude each other.

  @inproceedings{bullock2011privacyaware,
  abstract = {With the increased popularity of Web 2.0 services in the last years data privacy has become a major concern for users. The more personal data users reveal, the more difficult it becomes to control its disclosure in the web. However, for Web 2.0 service providers, the data provided by users is a valuable source for offering effective, personalised data mining services. One major application is the detection of spam in social bookmarking systems: in order to prevent a decrease of content quality, providers need to distinguish spammers and exclude them from the system. They thereby experience a conflict of interests: on the one hand, they need to identify spammers based on the information they collect about users, on the other hand, they need to respect privacy concerns and process as few personal data as possible. It would therefore be of tremendous help for system developers and users to know which personal data are needed for spam detection and which can be ignored. In this paper we address these questions by presenting a data privacy aware feature engineering approach. It consists of the design of features for spam classification which are evaluated according to both, performance and privacy conditions. Experiments using data from the social bookmarking system BibSonomy show that both conditions must not exclude each other.},
  address = {New York, NY, USA},
  author = {Bullock, Beate Navarro and Lerch, Hana and Ro\ssnagel, Alexander and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies},
  keywords = {web20},
  pages = {15:1--15:8},
  publisher = {ACM},
  series = {i-KNOW '11},
  title = {Privacy-aware spam detection in social bookmarking systems},
  year = 2011
  }
  

  %0 Conference Paper
  %1 bullock2011privacyaware
  %A Bullock, Beate Navarro
  %A Lerch, Hana
  %A Ro\ssnagel, Alexander
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies
  %C New York, NY, USA
  %D 2011
  %I ACM
  %P 15:1--15:8
  %R 10.1145/2024288.2024306
  %T Privacy-aware spam detection in social bookmarking systems
  %U http://doi.acm.org/10.1145/2024288.2024306
  %X With the increased popularity of Web 2.0 services in the last years data privacy has become a major concern for users. The more personal data users reveal, the more difficult it becomes to control its disclosure in the web. However, for Web 2.0 service providers, the data provided by users is a valuable source for offering effective, personalised data mining services. One major application is the detection of spam in social bookmarking systems: in order to prevent a decrease of content quality, providers need to distinguish spammers and exclude them from the system. They thereby experience a conflict of interests: on the one hand, they need to identify spammers based on the information they collect about users, on the other hand, they need to respect privacy concerns and process as few personal data as possible. It would therefore be of tremendous help for system developers and users to know which personal data are needed for spam detection and which can be ignored. In this paper we address these questions by presenting a data privacy aware feature engineering approach. It consists of the design of features for spam classification which are evaluated according to both, performance and privacy conditions. Experiments using data from the social bookmarking system BibSonomy show that both conditions must not exclude each other.
  %@ 978-1-4503-0732-1
  

• Atzmueller, M., Benz, D., Doerfel, S., Hotho, A., Jäschke, R., Macek, B.E., Mitzlaff, F., Scholz, C., Stumme, G.: Enhancing Social Interactions at Conferences it - Information Technology. 53, 101–107 (2011).

  URLBibTeXEndNote

  @article{martin2011enhancing,
  author = {Atzmueller, Martin and Benz, Dominik and Doerfel, Stephan and Hotho, Andreas and Jäschke, Robert and Macek, Bjoern Elmar and Mitzlaff, Folke and Scholz, Christoph and Stumme, Gerd},
  booktitle = {it - Information Technology},
  journal = {it - Information Technology},
  keywords = {myown},
  month = {may},
  number = 3,
  pages = {101--107},
  publisher = {Oldenbourg Wissenschaftsverlag GmbH},
  title = {Enhancing Social Interactions at Conferences},
  volume = 53,
  year = 2011
  }
  

  %0 Journal Article
  %1 martin2011enhancing
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Macek, Bjoern Elmar
  %A Mitzlaff, Folke
  %A Scholz, Christoph
  %A Stumme, Gerd
  %B it - Information Technology
  %D 2011
  %I Oldenbourg Wissenschaftsverlag GmbH
  %J it - Information Technology
  %N 3
  %P 101--107
  %R 10.1524/itit.2011.0631
  %T Enhancing Social Interactions at Conferences
  %U http://dx.doi.org/10.1524/itit.2011.0631
  %V 53
  

• Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: {Community Assessment using Evidence Networks} Analysis of Social Media and Ubiquitous Data (2011).

  BibTeXEndNote

  @inproceedings{mitzlaff2011community,
  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Analysis of Social Media and Ubiquitous Data},
  keywords = {myown},
  series = {LNAI},
  title = {{Community Assessment using Evidence Networks}},
  volume = 6904,
  year = 2011
  }
  

  %0 Conference Paper
  %1 mitzlaff2011community
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Analysis of Social Media and Ubiquitous Data
  %D 2011
  %T {Community Assessment using Evidence Networks}
  %V 6904
  

• Scholz, C., Doerfel, S., Atzmueller, M., Hotho, A., Stumme, G.: Resource-Aware On-Line RFID Localization Using Proximity Data Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).

  BibTeXEndNote

  @inproceedings{scholz2011resourceaware,
  author = {Scholz, Christoph and Doerfel, Stephan and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation},
  keywords = {rfid},
  title = {Resource-Aware On-Line RFID Localization Using Proximity Data},
  year = 2011
  }
  

  %0 Conference Paper
  %1 scholz2011resourceaware
  %A Scholz, Christoph
  %A Doerfel, Stephan
  %A Atzmueller, Martin
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation
  %D 2011
  %T Resource-Aware On-Line RFID Localization Using Proximity Data
  

• Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: Face-to-Face Contacts during LWA 2010 - Communities, Roles, and Key Players Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).

  BibTeXEndNote

  @inproceedings{atzmueller2011facetoface,
  author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},
  booktitle = {Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation},
  keywords = {myown},
  title = {Face-to-Face Contacts during LWA 2010 - Communities, Roles, and Key Players},
  year = 2011
  }
  

  %0 Conference Paper
  %1 atzmueller2011facetoface
  %A Atzmueller, Martin
  %A Doerfel, Stephan
  %A Hotho, Andreas
  %A Mitzlaff, Folke
  %A Stumme, Gerd
  %B Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation
  %D 2011
  %T Face-to-Face Contacts during LWA 2010 - Communities, Roles, and Key Players
  

• Behrenbruch, K., Atzmueller, M., Kniewel, R., Hoberg, S., Stumme, G., Schmidt, L.: Gestaltung technisch-sozialer Vernetzung in der Arbeitsorganisation: Untersuchung zur Nutzerakzeptanz von RFID-Technologie GfA-Frühjahrskongress. , Chemnitz (2011).

  BibTeXEndNote

  @inproceedings{BAKHSS:11,
  address = {Chemnitz},
  author = {Behrenbruch, Kay and Atzmueller, Martin and Kniewel, Romy and Hoberg, Sebastian and Stumme, Gerd and Schmidt, Ludger},
  booktitle = {GfA-Frühjahrskongress},
  keywords = {venus},
  title = {Gestaltung technisch-sozialer Vernetzung in der Arbeitsorganisation: Untersuchung zur Nutzerakzeptanz von RFID-Technologie},
  year = 2011
  }
  

  %0 Conference Paper
  %1 BAKHSS:11
  %A Behrenbruch, Kay
  %A Atzmueller, Martin
  %A Kniewel, Romy
  %A Hoberg, Sebastian
  %A Stumme, Gerd
  %A Schmidt, Ludger
  %B GfA-Frühjahrskongress
  %C Chemnitz
  %D 2011
  %T Gestaltung technisch-sozialer Vernetzung in der Arbeitsorganisation: Untersuchung zur Nutzerakzeptanz von RFID-Technologie
  

• Balby Marinho, L., Nanopoulos, A., Schmidt-Thieme, L., Jäschke, R., Hotho, A., Stumme, G., Symeonidis, P.: Social Tagging Recommender Systems In: Ricci, F., Rokach, L., Shapira, B., and Kantor, P.B. (eds.) Recommender Systems Handbook. pp. 615–644. Springer, New York (2011).

  URLBibTeXEndNote

  The new generation of Web applications known as (STS) is successfully established and poised for continued growth. STS are open and inherently social; features that have been proven to encourage participation. But while STS bring new opportunities, they revive old problems, such as information overload. Recommender Systems are well known applications for increasing the level of relevant content over the noise that continuously grows as more and more content becomes available online. In STS however, we face new challenges. Users are interested in finding not only content, but also tags and even other users. Moreover, while traditional recommender systems usually operate over 2-way data arrays, STS data is represented as a third-order tensor or a hypergraph with hyperedges denoting (user, resource, tag) triples. In this chapter, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve STS.We describe (a) novel facets of recommenders for STS, such as user, resource, and tag recommenders, (b) new approaches and algorithms for dealing with the ternary nature of STS data, and (c) recommender systems deployed in real world STS. Moreover, a concise comparison between existing works is presented, through which we identify and point out new research directions.

  @incollection{marinho2011social,
  abstract = {The new generation of Web applications known as (STS) is successfully established and poised for continued growth. STS are open and inherently social; features that have been proven to encourage participation. But while STS bring new opportunities, they revive old problems, such as information overload. Recommender Systems are well known applications for increasing the level of relevant content over the noise that continuously grows as more and more content becomes available online. In STS however, we face new challenges. Users are interested in finding not only content, but also tags and even other users. Moreover, while traditional recommender systems usually operate over 2-way data arrays, STS data is represented as a third-order tensor or a hypergraph with hyperedges denoting (user, resource, tag) triples. In this chapter, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve STS.We describe (a) novel facets of recommenders for STS, such as user, resource, and tag recommenders, (b) new approaches and algorithms for dealing with the ternary nature of STS data, and (c) recommender systems deployed in real world STS. Moreover, a concise comparison between existing works is presented, through which we identify and point out new research directions.},
  address = {New York},
  author = {Balby Marinho, Leandro and Nanopoulos, Alexandros and Schmidt-Thieme, Lars and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd and Symeonidis, Panagiotis},
  booktitle = {Recommender Systems Handbook},
  editor = {Ricci, Francesco and Rokach, Lior and Shapira, Bracha and Kantor, Paul B.},
  keywords = {tagging},
  pages = {615--644},
  publisher = {Springer},
  title = {Social Tagging Recommender Systems},
  year = 2011
  }
  

  %0 Book Section
  %1 marinho2011social
  %A Balby Marinho, Leandro
  %A Nanopoulos, Alexandros
  %A Schmidt-Thieme, Lars
  %A Jäschke, Robert
  %A Hotho, Andreas
  %A Stumme, Gerd
  %A Symeonidis, Panagiotis
  %B Recommender Systems Handbook
  %C New York
  %D 2011
  %E Ricci, Francesco
  %E Rokach, Lior
  %E Shapira, Bracha
  %E Kantor, Paul B.
  %I Springer
  %P 615--644
  %R 10.1007/978-0-387-85820-3_19
  %T Social Tagging Recommender Systems
  %U http://dx.doi.org/10.1007/978-0-387-85820-3_19
  %X The new generation of Web applications known as (STS) is successfully established and poised for continued growth. STS are open and inherently social; features that have been proven to encourage participation. But while STS bring new opportunities, they revive old problems, such as information overload. Recommender Systems are well known applications for increasing the level of relevant content over the noise that continuously grows as more and more content becomes available online. In STS however, we face new challenges. Users are interested in finding not only content, but also tags and even other users. Moreover, while traditional recommender systems usually operate over 2-way data arrays, STS data is represented as a third-order tensor or a hypergraph with hyperedges denoting (user, resource, tag) triples. In this chapter, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve STS.We describe (a) novel facets of recommenders for STS, such as user, resource, and tag recommenders, (b) new approaches and algorithms for dealing with the ternary nature of STS data, and (c) recommender systems deployed in real world STS. Moreover, a concise comparison between existing works is presented, through which we identify and point out new research directions.
  %@ 978-0-387-85820-3
  

• Kartal, A., Doerfel, S., Roßnagel, A., Stumme, G.: Privatsphären- und Datenschutz in Community-Plattformen: Gestaltung von Online-Bewertungsportalen In: Heiß, H.-U., Pepper, P., Schlingloff, H., and Schneider, J. (eds.) Informatik 2011 - Informatik schafft Communities - Proceedings der 41. GI-Jahrestagung. p. 412. Bonner Köllen Verlag (2011).

  URLBibTeXEndNote

  Aufgrund der mittlerweile unüberschaubaren Vielfalt von Anwendungsmöglichkeiten des Web 2.0, findet man fast zu jedem Lebensbereich eine passende Community im Netz. Dabei steigt auch die Anzahl der Bewertungsportale stetig und betrifft längst nicht mehr nur die Bewertung von Waren, sondern erstreckt sich unterdessen auch auf Beurteilungen von Leistungen und Eigenschaften von zu bestimmten Berufsgruppen gehörenden Personen. Diese Entwicklung birgt die Gefahr, dass die dadurch gewonnenen persönlichen Daten durchaus geeignet sind, wahrheitswidrig ein übermäßig positives oder übermäßig negatives Persönlichkeitsbild des Betroffenen zu konstruieren und dadurch sein Ansehen zu beeinflussen. Im Hinblick auf Fragen im Zusammenhang mit dem Persönlichkeits- und Datenschutz soll der folgende Beitrag Maßstäbe an eine verfassungs- und datenschutzkonforme technische Gestaltung von Online-Bewertungsportalen aufzeigen.

  @inproceedings{kartal2011privatsphren,
  abstract = {Aufgrund der mittlerweile unüberschaubaren Vielfalt von Anwendungsmöglichkeiten des Web 2.0, findet man fast zu jedem Lebensbereich eine passende Community im Netz. Dabei steigt auch die Anzahl der Bewertungsportale stetig und betrifft längst nicht mehr nur die Bewertung von Waren, sondern erstreckt sich unterdessen auch auf Beurteilungen von Leistungen und Eigenschaften von zu bestimmten Berufsgruppen gehörenden Personen. Diese Entwicklung birgt die Gefahr, dass die dadurch gewonnenen persönlichen Daten durchaus geeignet sind, wahrheitswidrig ein übermäßig positives oder übermäßig negatives Persönlichkeitsbild des Betroffenen zu konstruieren und dadurch sein Ansehen zu beeinflussen. Im Hinblick auf Fragen im Zusammenhang mit dem Persönlichkeits- und Datenschutz soll der folgende Beitrag Maßstäbe an eine verfassungs- und datenschutzkonforme technische Gestaltung von Online-Bewertungsportalen aufzeigen.},
  author = {Kartal, Aliye and Doerfel, Stephan and Roßnagel, Alexander and Stumme, Gerd},
  booktitle = {Informatik 2011 - Informatik schafft Communities - Proceedings der 41. GI-Jahrestagung},
  editor = {Heiß, Hans-Ulrich and Pepper, Peter and Schlingloff, Holger and Schneider, Jörg},
  keywords = {privat},
  month = 10,
  organization = {Gesellschaft für Informatik e.V. (GI)},
  pages = 412,
  publisher = {Bonner Köllen Verlag},
  series = {Lecture Notes in Informatics},
  title = {Privatsphären- und Datenschutz in Community-Plattformen: Gestaltung von Online-Bewertungsportalen},
  volume = 192,
  year = 2011
  }
  

  %0 Conference Paper
  %1 kartal2011privatsphren
  %A Kartal, Aliye
  %A Doerfel, Stephan
  %A Roßnagel, Alexander
  %A Stumme, Gerd
  %B Informatik 2011 - Informatik schafft Communities - Proceedings der 41. GI-Jahrestagung
  %D 2011
  %E Heiß, Hans-Ulrich
  %E Pepper, Peter
  %E Schlingloff, Holger
  %E Schneider, Jörg
  %I Bonner Köllen Verlag
  %P 412
  %T Privatsphären- und Datenschutz in Community-Plattformen: Gestaltung von Online-Bewertungsportalen
  %U http://www.informatik2011.de/541.html
  %V 192
  %X Aufgrund der mittlerweile unüberschaubaren Vielfalt von Anwendungsmöglichkeiten des Web 2.0, findet man fast zu jedem Lebensbereich eine passende Community im Netz. Dabei steigt auch die Anzahl der Bewertungsportale stetig und betrifft längst nicht mehr nur die Bewertung von Waren, sondern erstreckt sich unterdessen auch auf Beurteilungen von Leistungen und Eigenschaften von zu bestimmten Berufsgruppen gehörenden Personen. Diese Entwicklung birgt die Gefahr, dass die dadurch gewonnenen persönlichen Daten durchaus geeignet sind, wahrheitswidrig ein übermäßig positives oder übermäßig negatives Persönlichkeitsbild des Betroffenen zu konstruieren und dadurch sein Ansehen zu beeinflussen. Im Hinblick auf Fragen im Zusammenhang mit dem Persönlichkeits- und Datenschutz soll der folgende Beitrag Maßstäbe an eine verfassungs- und datenschutzkonforme technische Gestaltung von Online-Bewertungsportalen aufzeigen.
  

• Illig, J., Hotho, A., Jäschke, R., Stumme, G.: A Comparison of Content-Based Tag Recommendations in Folksonomy Systems In: Wolff, K.E., Palchunov, D.E., Zagoruiko, N.G., and Andelfinger, U. (eds.) Knowledge Processing and Data Analysis. pp. 136–149. Springer, Berlin/Heidelberg (2011).

  URLBibTeXEndNote

  Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset.

  @inproceedings{illig2009comparison,
  abstract = {Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset.},
  address = {Berlin/Heidelberg},
  author = {Illig, Jens and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  booktitle = {Knowledge Processing and Data Analysis},
  editor = {Wolff, Karl Erich and Palchunov, Dmitry E. and Zagoruiko, Nikolay G. and Andelfinger, Urs},
  keywords = {tagorapub},
  pages = {136--149},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {A Comparison of Content-Based Tag Recommendations in Folksonomy Systems},
  volume = 6581,
  year = 2011
  }
  

  %0 Conference Paper
  %1 illig2009comparison
  %A Illig, Jens
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Stumme, Gerd
  %B Knowledge Processing and Data Analysis
  %C Berlin/Heidelberg
  %D 2011
  %E Wolff, Karl Erich
  %E Palchunov, Dmitry E.
  %E Zagoruiko, Nikolay G.
  %E Andelfinger, Urs
  %I Springer
  %P 136--149
  %R 10.1007/978-3-642-22140-8_9
  %T A Comparison of Content-Based Tag Recommendations in Folksonomy Systems
  %U http://dx.doi.org/10.1007/978-3-642-22140-8_9
  %V 6581
  %X Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset.
  %@ 978-3-642-22139-2
  

• Atzmüller, M., Benz, D., Hotho, A., Stumme, G.: Towards Mining Semantic Maturity in Social Bookmarking Systems In: Passant, A., Fernández, S., Breslin, J., and Bojārs, U. (eds.) Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011) (2011).

  URLBibTeXEndNote

  @inproceedings{atzmueller2011towards,
  author = {Atzmüller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)},
  editor = {Passant, Alexandre and Fernández, Sergio and Breslin, John and Bojārs, Uldis},
  keywords = {socialbookmarking},
  title = {Towards Mining Semantic Maturity in Social Bookmarking Systems},
  year = 2011
  }
  

  %0 Conference Paper
  %1 atzmueller2011towards
  %A Atzmüller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)
  %D 2011
  %E Passant, Alexandre
  %E Fernández, Sergio
  %E Breslin, John
  %E Bojārs, Uldis
  %T Towards Mining Semantic Maturity in Social Bookmarking Systems
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/atzmueller2011towards.pdf
  

• Benz, D., Körner, C., Hotho, A., Stumme, G., Strohmaier, M.: One Tag to Bind Them All : Measuring Term Abstractness in Social Metadata In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., Pan, J., and Leenheer, P.D. (eds.) Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011). , Heraklion, Crete (2011).

  URLBibTeXEndNote

  Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.

  @inproceedings{benz2011measuring,
  abstract = {Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.},
  address = {Heraklion, Crete},
  author = {Benz, Dominik and Körner, Christian and Hotho, Andreas and Stumme, Gerd and Strohmaier, Markus},
  booktitle = {Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011)},
  editor = {Antoniou, Grigoris and Grobelnik, Marko and Simperl, Elena and Parsia, Bijan and Plexousakis, Dimitris and Pan, Jeff and Leenheer, Pieter De},
  keywords = {tagging},
  month = {may},
  title = {One Tag to Bind Them All : Measuring Term Abstractness in Social Metadata},
  year = 2011
  }
  

  %0 Conference Paper
  %1 benz2011measuring
  %A Benz, Dominik
  %A Körner, Christian
  %A Hotho, Andreas
  %A Stumme, Gerd
  %A Strohmaier, Markus
  %B Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011)
  %C Heraklion, Crete
  %D 2011
  %E Antoniou, Grigoris
  %E Grobelnik, Marko
  %E Simperl, Elena
  %E Parsia, Bijan
  %E Plexousakis, Dimitris
  %E Pan, Jeff
  %E Leenheer, Pieter De
  %T One Tag to Bind Them All : Measuring Term Abstractness in Social Metadata
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/benz2011measuring.pdf
  %X Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.
  

• Benz, D., Körner, C., Hotho, A., Stumme, G., Strohmaier, M.: One Tag to Bind Them All: Measuring Term Abstractness in Social Metadata In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., Pan, J., and Leenheer, P.D. (eds.) Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011). , Heraklion, Crete (2011).

  URLBibTeXEndNote

  Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.

  @inproceedings{benz2011measuring,
  abstract = {Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.},
  address = {Heraklion, Crete},
  author = {Benz, Dominik and Körner, Christian and Hotho, Andreas and Stumme, Gerd and Strohmaier, Markus},
  booktitle = {Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011)},
  editor = {Antoniou, Grigoris and Grobelnik, Marko and Simperl, Elena and Parsia, Bijan and Plexousakis, Dimitris and Pan, Jeff and Leenheer, Pieter De},
  keywords = {term},
  month = {may},
  title = {One Tag to Bind Them All: Measuring Term Abstractness in Social Metadata},
  year = 2011
  }
  

  %0 Conference Paper
  %1 benz2011measuring
  %A Benz, Dominik
  %A Körner, Christian
  %A Hotho, Andreas
  %A Stumme, Gerd
  %A Strohmaier, Markus
  %B Proceedings of the 8th Extended Semantic Web Conference (ESWC 2011)
  %C Heraklion, Crete
  %D 2011
  %E Antoniou, Grigoris
  %E Grobelnik, Marko
  %E Simperl, Elena
  %E Parsia, Bijan
  %E Plexousakis, Dimitris
  %E Pan, Jeff
  %E Leenheer, Pieter De
  %T One Tag to Bind Them All: Measuring Term Abstractness in Social Metadata
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/benz2011measuring.pdf
  %X Recent research has demonstrated how the widespread adoption of collaborative tagging systems yields emergent semantics. In recent years, much has been learned about how to harvest the data produced by taggers for engineering light-weight ontologies. For example, existing measures of tag similarity and tag relatedness have proven crucial step stones for making latent semantic relations in tagging systems explicit. However, little progress has been made on other issues, such as understanding the different levels of tag generality (or tag abstractness), which is essential for, among others, identifying hierarchical relationships between concepts. In this paper we aim to address this gap. Starting from a review of linguistic definitions of word abstractness, we first use several large-scale ontologies and taxonomies as grounded measures of word generality, including Yago, Wordnet, DMOZ and Wikitaxonomy. Then, we introduce and apply several folksonomy-based methods to measure the level of generality of given tags. We evaluate these methods by comparing them with the grounded measures. Our results suggest that the generality of tags in social tagging systems can be approximated with simple measures. Our work has implications for a number of problems related to social tagging systems, including search, tag recommendation, and the acquisition of light-weight ontologies from tagging data.
  

• Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: Towards Mining Semantic Maturity in Social Bookmarking Systems In: Passant, A., Fernández, S., Breslin, J., and Bojārs, U. (eds.) Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011) (2011).

  URLBibTeXEndNote

  @inproceedings{atzmueller2011towards,
  author = {Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)},
  editor = {Passant, Alexandre and Fernández, Sergio and Breslin, John and Bojārs, Uldis},
  keywords = {social},
  title = {Towards Mining Semantic Maturity in Social Bookmarking Systems},
  year = 2011
  }
  

  %0 Conference Paper
  %1 atzmueller2011towards
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011)
  %D 2011
  %E Passant, Alexandre
  %E Fernández, Sergio
  %E Breslin, John
  %E Bojārs, Uldis
  %T Towards Mining Semantic Maturity in Social Bookmarking Systems
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/atzmueller2011towards.pdf
  

2010

• Benz, D., Hotho, A., Jäschke, R., Krause, B., Stumme, G.: Query Logs as Folksonomies Datenbank-Spektrum. 10, 15–24 (2010).

  URLBibTeXEndNote

  Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system’s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well.

  @article{benz2010query,
  abstract = {Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system’s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well.},
  author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd},
  journal = {Datenbank-Spektrum},
  keywords = {myown},
  month = {jun},
  number = 1,
  pages = {15--24},
  title = {Query Logs as Folksonomies},
  volume = 10,
  year = 2010
  }
  

  %0 Journal Article
  %1 benz2010query
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Krause, Beate
  %A Stumme, Gerd
  %D 2010
  %J Datenbank-Spektrum
  %N 1
  %P 15--24
  %T Query Logs as Folksonomies
  %U http://dx.doi.org/10.1007/s13222-010-0004-8
  %V 10
  %X Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system’s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well.
  

• Benz, D., Hotho, A., Jäschke, R., Krause, B., Mitzlaff, F., Schmitz, C., Stumme, G.: The social bookmark and publication management system bibsonomy The VLDB Journal. 19, 849–875 (2010).

  URLBibTeXEndNote

  Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.

  @article{benz2010social,
  abstract = {Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.},
  address = {Berlin / Heidelberg},
  author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Mitzlaff, Folke and Schmitz, Christoph and Stumme, Gerd},
  journal = {The VLDB Journal},
  keywords = {sitc},
  number = 6,
  pages = {849-875},
  publisher = {Springer},
  title = {The social bookmark and publication management system bibsonomy},
  volume = 19,
  year = 2010
  }
  

  %0 Journal Article
  %1 benz2010social
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Krause, Beate
  %A Mitzlaff, Folke
  %A Schmitz, Christoph
  %A Stumme, Gerd
  %C Berlin / Heidelberg
  %D 2010
  %I Springer
  %J The VLDB Journal
  %N 6
  %P 849-875
  %R 10.1007/s00778-010-0208-4
  %T The social bookmark and publication management system bibsonomy
  %U http://dx.doi.org/10.1007/s00778-010-0208-4
  %V 19
  %X Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.
  

• Benz, D., Hotho, A., Jäschke, R., Stumme, G., Halle, A., Lima-Gerlach, A.S., Steenweg, H., Stefani, S.: Academic Publication Management with PUMA - collect, organize and share publications Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries. pp. 417–420 (2010).

  URLBibTeXEndNote

  @inproceedings{Halle:2010,
  author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd and Halle, Axel and Lima-Gerlach, Angela Sanches and Steenweg, Helge and Stefani, Sven},
  booktitle = {Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries},
  keywords = {puma},
  pages = {417-420.},
  title = {Academic Publication Management with PUMA - collect, organize and share publications},
  year = 2010
  }
  

  %0 Conference Paper
  %1 Halle:2010
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Stumme, Gerd
  %A Halle, Axel
  %A Lima-Gerlach, Angela Sanches
  %A Steenweg, Helge
  %A Stefani, Sven
  %B Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries
  %D 2010
  %P 417-420.
  %T Academic Publication Management with PUMA - collect, organize and share publications
  %U http://www.springerlink.com/content/73128285273l43mp/
  

• Hotho, A., Benz, D., Eisterlehner, F., Jäschke, R., Krause, B., Schmitz, C., Stumme, G.: {Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System für Wissenschaftler} HMD -- Praxis der Wirtschaftsinformatik. Heft 271, 47–58 (2010).

  BibTeXEndNote

  Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer größerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenwärtigkeit, die ständige Verfügbarkeit, aber auch die Möglichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gründe für ihren gegenwärtigen Erfolg. Der Artikel führt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabläufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbezügen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.

  @article{HothoBenzEtAl10hmd,
  abstract = {Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer größerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenwärtigkeit, die ständige Verfügbarkeit, aber auch die Möglichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gründe für ihren gegenwärtigen Erfolg. Der Artikel führt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabläufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbezügen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.},
  author = {Hotho, Andreas and Benz, Dominik and Eisterlehner, Folke and Jäschke, Robert and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},
  journal = {HMD -- Praxis der Wirtschaftsinformatik},
  keywords = {web2.0},
  month = {#feb#},
  pages = {47-58},
  title = {{Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System für Wissenschaftler}},
  volume = {Heft 271},
  year = 2010
  }
  

  %0 Journal Article
  %1 HothoBenzEtAl10hmd
  %A Hotho, Andreas
  %A Benz, Dominik
  %A Eisterlehner, Folke
  %A Jäschke, Robert
  %A Krause, Beate
  %A Schmitz, Christoph
  %A Stumme, Gerd
  %D 2010
  %J HMD -- Praxis der Wirtschaftsinformatik
  %P 47-58
  %T {Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System für Wissenschaftler}
  %V Heft 271
  %X Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer größerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenwärtigkeit, die ständige Verfügbarkeit, aber auch die Möglichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gründe für ihren gegenwärtigen Erfolg. Der Artikel führt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabläufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbezügen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.
  

• Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: Community Assessment using Evidence Networks Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010). , Barcelona, Spain (2010).

  URLBibTeXEndNote

  Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.

  @inproceedings{mitzlaff2010community,
  abstract = {Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.},
  address = {Barcelona, Spain},
  author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)},
  keywords = {pkdd},
  title = {Community Assessment using Evidence Networks},
  year = 2010
  }
  

  %0 Conference Paper
  %1 mitzlaff2010community
  %A Mitzlaff, Folke
  %A Atzmueller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)
  %C Barcelona, Spain
  %D 2010
  %T Community Assessment using Evidence Networks
  %U https://www.kde.cs.uni-kassel.de/atzmueller/paper/mitzlaff-community-assessment-muse-2010.pdf
  %X Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.
  

• Benz, D., Hotho, A., Stützer, S., Stumme, G.: Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge Proceedings of the 2nd Web Science Conference (WebSci10). , Raleigh, NC, USA (2010).

  URLBibTeXEndNote

  @inproceedings{benz2010semantics,
  address = {Raleigh, NC, USA},
  author = {Benz, Dominik and Hotho, Andreas and Stützer, Stefan and Stumme, Gerd},
  booktitle = {Proceedings of the 2nd Web Science Conference (WebSci10)},
  keywords = {websci10},
  title = {Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge},
  year = 2010
  }
  

  %0 Conference Paper
  %1 benz2010semantics
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stützer, Stefan
  %A Stumme, Gerd
  %B Proceedings of the 2nd Web Science Conference (WebSci10)
  %C Raleigh, NC, USA
  %D 2010
  %T Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge
  %U https://www.kde.cs.uni-kassel.de/pub/pdf/benz2010semantics.pdf
  

• Benz, D., Hotho, A., Jäschke, R., Stumme, G., Halle, A., Lima-Gerlach, A.S., Steenweg, H., Stefani, S.: Academic Publication Management with PUMA - collect, organize and share publications Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries. pp. 417–420 (2010).

  BibTeXEndNote

  The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.

  @inproceedings{Halle:2010,
  abstract = {The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.},
  author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd and Halle, Axel and Lima-Gerlach, Angela Sanches and Steenweg, Helge and Stefani, Sven},
  booktitle = {Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries},
  keywords = {myown},
  pages = {417-420},
  title = {Academic Publication Management with PUMA - collect, organize and share publications},
  volume = {6273/2010},
  year = 2010
  }
  

  %0 Conference Paper
  %1 Halle:2010
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Stumme, Gerd
  %A Halle, Axel
  %A Lima-Gerlach, Angela Sanches
  %A Steenweg, Helge
  %A Stefani, Sven
  %B Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries
  %D 2010
  %P 417-420
  %R 10.1007
  %T Academic Publication Management with PUMA - collect, organize and share publications
  %V 6273/2010
  %X The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.
  %@ 978-3-642-15464-5
  

• Hotho, A., Benz, D., Eisterlehner, F., Jäschke, R., Krause, B., Schmitz, C., Stumme, G.: Publikationsmanagement mit BibSonomy - ein Social-Bookmarking-System für Wissenschaftler HMD - Praxis der Wirtschaftsinformatik. 271, 47–58 (2010).

  URLBibTeXEndNote

  Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer größerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenwärtigkeit, die ständige Verfügbarkeit, aber auch die Möglichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gründe für ihren gegenwärtigen Erfolg. Der Artikel führt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente wie Browsing und Suche am Beispiel von BibSonomy anhand typischer Arbeitsabläufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbezügen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.

  @article{hotho2010publikationsmanagement,
  abstract = {Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer größerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenwärtigkeit, die ständige Verfügbarkeit, aber auch die Möglichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gründe für ihren gegenwärtigen Erfolg. Der Artikel führt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente wie Browsing und Suche am Beispiel von BibSonomy anhand typischer Arbeitsabläufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbezügen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.},
  author = {Hotho, Andreas and Benz, Dominik and Eisterlehner, Folke and Jäschke, Robert and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},
  editor = {Hengartner, Urs and Meier, Andreas},
  journal = {HMD - Praxis der Wirtschaftsinformatik},
  keywords = {social},
  month = {feb},
  pages = {47--58},
  publisher = {dpunkt.verlag},
  title = {Publikationsmanagement mit BibSonomy - ein Social-Bookmarking-System für Wissenschaftler},
  volume = 271,
  year = 2010
  }
  

  %0 Journal Article
  %1 hotho2010publikationsmanagement
  %A Hotho, Andreas
  %A Benz, Dominik
  %A Eisterlehner, Folke
  %A Jäschke, Robert
  %A Krause, Beate
  %A Schmitz, Christoph
  %A Stumme, Gerd
  %D 2010
  %E Hengartner, Urs
  %E Meier, Andreas
  %I dpunkt.verlag
  %J HMD - Praxis der Wirtschaftsinformatik
  %P 47--58
  %T Publikationsmanagement mit BibSonomy - ein Social-Bookmarking-System für Wissenschaftler
  %U http://hmd.dpunkt.de/271/05.php
  %V 271
  %X Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer größerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenwärtigkeit, die ständige Verfügbarkeit, aber auch die Möglichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gründe für ihren gegenwärtigen Erfolg. Der Artikel führt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente wie Browsing und Suche am Beispiel von BibSonomy anhand typischer Arbeitsabläufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbezügen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.
  

• Atzmueller, M., Benz, D., Hotho, A., Stumme, G. eds.: {Proceedings of the LWA 2010 - Lernen, Wissen, Adaptivität} Department of Electrical Engineering/Computer Science, Kassel University (2010).

  BibTeXEndNote

  @book{ABHS:10,
  editor = {Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  keywords = {myown},
  publisher = {Department of Electrical Engineering/Computer Science, Kassel University},
  series = {Technical report (KIS), 2010-10},
  title = {{Proceedings of the LWA 2010 - Lernen, Wissen, Adaptivität}},
  year = 2010
  }
  

  %0 Book
  %1 ABHS:10
  %B Technical report (KIS), 2010-10
  %D 2010
  %E Atzmueller, Martin
  %E Benz, Dominik
  %E Hotho, Andreas
  %E Stumme, Gerd
  %I Department of Electrical Engineering/Computer Science, Kassel University
  %T {Proceedings of the LWA 2010 - Lernen, Wissen, Adaptivität}
  

• Lerch, H., Krause, B., Hotho, A., Roßnagel, A., Stumme, G.: Social Bookmarking-Systeme – die unerkannten Datensammler - Ungewollte personenbezogene Datenverabeitung? MultiMedia und Recht. 7, 454–458 (2010).

  BibTeXEndNote

  @article{lerch2010datenschutz,
  author = {Lerch, Hana and Krause, Beate and Hotho, Andreas and Roßnagel, Alexander and Stumme, Gerd},
  journal = {MultiMedia und Recht},
  keywords = {spam},
  pages = {454-458},
  title = {Social Bookmarking-Systeme – die unerkannten Datensammler - Ungewollte personenbezogene Datenverabeitung?},
  volume = 7,
  year = 2010
  }
  

  %0 Journal Article
  %1 lerch2010datenschutz
  %A Lerch, Hana
  %A Krause, Beate
  %A Hotho, Andreas
  %A Roßnagel, Alexander
  %A Stumme, Gerd
  %D 2010
  %J MultiMedia und Recht
  %P 454-458
  %T Social Bookmarking-Systeme – die unerkannten Datensammler - Ungewollte personenbezogene Datenverabeitung?
  %V 7
  

• Körner, C., Benz, D., Strohmaier, M., Hotho, A., Stumme, G.: Stop Thinking, start Tagging - Tag Semantics emerge from Collaborative Verbosity Proceedings of the 19th International World Wide Web Conference (WWW 2010). ACM, Raleigh, NC, USA (2010).

  URLBibTeXEndNote

  Recent research provides evidence for the presence of emergent semantics in collaborative tagging systems. While several methods have been proposed, little is known about the factors that influence the evolution of semantic structures in these systems. A natural hypothesis is that the quality of the emergent semantics depends on the pragmatics of tagging: Users with certain usage patterns might contribute more to the resulting semantics than others. In this work, we propose several measures which enable a pragmatic differentiation of taggers by their degree of contribution to emerging semantic structures. We distinguish between categorizers, who typically use a small set of tags as a replacement for hierarchical classification schemes, and describers, who are annotating resources with a wealth of freely associated, descriptive keywords. To study our hypothesis, we apply semantic similarity measures to 64 different partitions of a real-world and large-scale folksonomy containing different ratios of categorizers and describers. Our results not only show that ‘verbose’ taggers are most useful for the emergence of tag semantics, but also that a subset containing only 40% of the most ‘verbose’ taggers can produce results that match and even outperform the semantic precision obtained from the whole dataset. Moreover, the results suggest that there exists a causal link between the pragmatics of tagging and resulting emergent semantics. This work is relevant for designers and analysts of tagging systems interested (i) in fostering the semantic development of their platforms, (ii) in identifying users introducing “semantic noise”, and (iii) in learning ontologies.

  @inproceedings{koerner2010thinking,
  abstract = {Recent research provides evidence for the presence of emergent semantics in collaborative tagging systems. While several methods have been proposed, little is known about the factors that influence the evolution of semantic structures in these systems. A natural hypothesis is that the quality of the emergent semantics depends on the pragmatics of tagging: Users with certain usage patterns might contribute more to the resulting semantics than others. In this work, we propose several measures which enable a pragmatic differentiation of taggers by their degree of contribution to emerging semantic structures. We distinguish between categorizers, who typically use a small set of tags as a replacement for hierarchical classification schemes, and describers, who are annotating resources with a wealth of freely associated, descriptive keywords. To study our hypothesis, we apply semantic similarity measures to 64 different partitions of a real-world and large-scale folksonomy containing different ratios of categorizers and describers. Our results not only show that ‘verbose’ taggers are most useful for the emergence of tag semantics, but also that a subset containing only 40% of the most ‘verbose’ taggers can produce results that match and even outperform the semantic precision obtained from the whole dataset. Moreover, the results suggest that there exists a causal link between the pragmatics of tagging and resulting emergent semantics. This work is relevant for designers and analysts of tagging systems interested (i) in fostering the semantic development of their platforms, (ii) in identifying users introducing “semantic noise”, and (iii) in learning ontologies.},
  address = {Raleigh, NC, USA},
  author = {Körner, Christian and Benz, Dominik and Strohmaier, Markus and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 19th International World Wide Web Conference (WWW 2010)},
  keywords = {web},
  month = {apr},
  publisher = {ACM},
  title = {Stop Thinking, start Tagging - Tag Semantics emerge from Collaborative Verbosity},
  year = 2010
  }
  

  %0 Conference Paper
  %1 koerner2010thinking
  %A Körner, Christian
  %A Benz, Dominik
  %A Strohmaier, Markus
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 19th International World Wide Web Conference (WWW 2010)
  %C Raleigh, NC, USA
  %D 2010
  %I ACM
  %T Stop Thinking, start Tagging - Tag Semantics emerge from Collaborative Verbosity
  %U https://www.kde.cs.uni-kassel.de/benz/papers/2010/koerner2010thinking.pdf
  %X Recent research provides evidence for the presence of emergent semantics in collaborative tagging systems. While several methods have been proposed, little is known about the factors that influence the evolution of semantic structures in these systems. A natural hypothesis is that the quality of the emergent semantics depends on the pragmatics of tagging: Users with certain usage patterns might contribute more to the resulting semantics than others. In this work, we propose several measures which enable a pragmatic differentiation of taggers by their degree of contribution to emerging semantic structures. We distinguish between categorizers, who typically use a small set of tags as a replacement for hierarchical classification schemes, and describers, who are annotating resources with a wealth of freely associated, descriptive keywords. To study our hypothesis, we apply semantic similarity measures to 64 different partitions of a real-world and large-scale folksonomy containing different ratios of categorizers and describers. Our results not only show that ‘verbose’ taggers are most useful for the emergence of tag semantics, but also that a subset containing only 40% of the most ‘verbose’ taggers can produce results that match and even outperform the semantic precision obtained from the whole dataset. Moreover, the results suggest that there exists a causal link between the pragmatics of tagging and resulting emergent semantics. This work is relevant for designers and analysts of tagging systems interested (i) in fostering the semantic development of their platforms, (ii) in identifying users introducing “semantic noise”, and (iii) in learning ontologies.
  

• Benz, D., Hotho, A., Jäschke, R., Krause, B., Mitzlaff, F., Schmitz, C., Stumme, G.: The social bookmark and publication management system BibSonomy The VLDB Journal. (2010).

  URLBibTeXEndNote

  Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.

  @article{benz2010social,
  abstract = {Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.},
  address = {Berlin / Heidelberg},
  author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Mitzlaff, Folke and Schmitz, Christoph and Stumme, Gerd},
  journal = {The VLDB Journal},
  keywords = {system},
  publisher = {Springer},
  title = {The social bookmark and publication management system BibSonomy},
  year = 2010
  }
  

  %0 Journal Article
  %1 benz2010social
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Krause, Beate
  %A Mitzlaff, Folke
  %A Schmitz, Christoph
  %A Stumme, Gerd
  %C Berlin / Heidelberg
  %D 2010
  %I Springer
  %J The VLDB Journal
  %R 10.1007/s00778-010-0208-4
  %T The social bookmark and publication management system BibSonomy
  %U http://dx.doi.org/10.1007/s00778-010-0208-4
  %X Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.
  

• Krause, B., Lerch, H., Hotho, A., Roßnagel, A., Stumme, G.: Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy Informatik-Spektrum. 1–12 (2010).

  URLBibTeXEndNote

  Soziale Tagging-Systeme gehören zu den in den vergangenen Jahren entstandenen Web2.0-Systemen. Sie ermöglichen es Anwendern, beliebige Informationen in das Internet einzustellen und untereinander auszutauschen. Je nach Anbieter verlinken Nutzer Videos, Fotos oder Webseiten und beschreiben die eingestellten Medien mit entsprechenden Schlagwörtern (Tags). Die damit einhergehende freiwillige Preisgabe oftmals persönlicher Informationen wirft Fragen im Bereich der informationellen Selbstbestimmung auf. Dieses Grundrecht gewährleistet dem Einzelnen, grundsätzlich selbst über die Preisgabe und Verwendung seiner persönlichen Daten zu bestimmen. Für viele Funktionalitäten, wie beispielsweise Empfehlungsdienste oder die Bereitstellung einer API, ist eine solche Kontrolle allerdings schwierig zu gestalten. Oftmals existieren keine Richtlinien, inwieweit Dienstanbieter und weitere Dritte diese öffentlichen Daten (und weitere Daten, die bei der Nutzung des Systems anfallen) nutzen dürfen. Dieser Artikel diskutiert anhand eines konkreten Systems typische, für den Datenschutz relevante Funktionalitäten und gibt Handlungsanweisungen für eine datenschutzkonforme technische Gestaltung.

  @article{springerlink:10.1007/s00287-010-0485-8,
  abstract = {Soziale Tagging-Systeme gehören zu den in den vergangenen Jahren entstandenen Web2.0-Systemen. Sie ermöglichen es Anwendern, beliebige Informationen in das Internet einzustellen und untereinander auszutauschen. Je nach Anbieter verlinken Nutzer Videos, Fotos oder Webseiten und beschreiben die eingestellten Medien mit entsprechenden Schlagwörtern (Tags). Die damit einhergehende freiwillige Preisgabe oftmals persönlicher Informationen wirft Fragen im Bereich der informationellen Selbstbestimmung auf. Dieses Grundrecht gewährleistet dem Einzelnen, grundsätzlich selbst über die Preisgabe und Verwendung seiner persönlichen Daten zu bestimmen. Für viele Funktionalitäten, wie beispielsweise Empfehlungsdienste oder die Bereitstellung einer API, ist eine solche Kontrolle allerdings schwierig zu gestalten. Oftmals existieren keine Richtlinien, inwieweit Dienstanbieter und weitere Dritte diese öffentlichen Daten (und weitere Daten, die bei der Nutzung des Systems anfallen) nutzen dürfen. Dieser Artikel diskutiert anhand eines konkreten Systems typische, für den Datenschutz relevante Funktionalitäten und gibt Handlungsanweisungen für eine datenschutzkonforme technische Gestaltung.},
  address = {Berlin / Heidelberg},
  author = {Krause, Beate and Lerch, Hana and Hotho, Andreas and Roßnagel, Alexander and Stumme, Gerd},
  journal = {Informatik-Spektrum},
  keywords = {web2.0},
  pages = {1-12},
  publisher = {Springer},
  title = {Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy},
  year = 2010
  }
  

  %0 Journal Article
  %1 springerlink:10.1007/s00287-010-0485-8
  %A Krause, Beate
  %A Lerch, Hana
  %A Hotho, Andreas
  %A Roßnagel, Alexander
  %A Stumme, Gerd
  %C Berlin / Heidelberg
  %D 2010
  %I Springer
  %J Informatik-Spektrum
  %P 1-12
  %R 10.1007/s00287-010-0485-8
  %T Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy
  %U http://dx.doi.org/10.1007/s00287-010-0485-8
  %X Soziale Tagging-Systeme gehören zu den in den vergangenen Jahren entstandenen Web2.0-Systemen. Sie ermöglichen es Anwendern, beliebige Informationen in das Internet einzustellen und untereinander auszutauschen. Je nach Anbieter verlinken Nutzer Videos, Fotos oder Webseiten und beschreiben die eingestellten Medien mit entsprechenden Schlagwörtern (Tags). Die damit einhergehende freiwillige Preisgabe oftmals persönlicher Informationen wirft Fragen im Bereich der informationellen Selbstbestimmung auf. Dieses Grundrecht gewährleistet dem Einzelnen, grundsätzlich selbst über die Preisgabe und Verwendung seiner persönlichen Daten zu bestimmen. Für viele Funktionalitäten, wie beispielsweise Empfehlungsdienste oder die Bereitstellung einer API, ist eine solche Kontrolle allerdings schwierig zu gestalten. Oftmals existieren keine Richtlinien, inwieweit Dienstanbieter und weitere Dritte diese öffentlichen Daten (und weitere Daten, die bei der Nutzung des Systems anfallen) nutzen dürfen. Dieser Artikel diskutiert anhand eines konkreten Systems typische, für den Datenschutz relevante Funktionalitäten und gibt Handlungsanweisungen für eine datenschutzkonforme technische Gestaltung.
  

• Hotho, A., Benz, D., Eisterlehner, F., J{ä}schke, R., Krause, B., Schmitz, C., Stumme, G.: {Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f{ü}r Wissenschaftler} HMD -- Praxis der Wirtschaftsinformatik. Heft 271, 47–58 (2010).

  BibTeXEndNote

  Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr{ö}ßerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw{ä}rtigkeit, die st{ä}ndige Verf{ü}gbarkeit, aber auch die M{ö}glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr{ü}nde f{ü}r ihren gegenw{ä}rtigen Erfolg. Der Artikel f{ü}hrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl{ä}ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbez{ü}gen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.

  @article{hotho2010publikationsmanagement,
  abstract = {Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr{ö}ßerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw{ä}rtigkeit, die st{ä}ndige Verf{ü}gbarkeit, aber auch die M{ö}glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr{ü}nde f{ü}r ihren gegenw{ä}rtigen Erfolg. Der Artikel f{ü}hrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl{ä}ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbez{ü}gen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.},
  author = {Hotho, Andreas and Benz, Dominik and Eisterlehner, Folke and J{ä}schke, Robert and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},
  journal = {HMD -- Praxis der Wirtschaftsinformatik},
  keywords = {web2.0},
  month = {#feb#},
  pages = {47-58},
  title = {{Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f{ü}r Wissenschaftler}},
  volume = {Heft 271},
  year = 2010
  }
  

  %0 Journal Article
  %1 hotho2010publikationsmanagement
  %A Hotho, Andreas
  %A Benz, Dominik
  %A Eisterlehner, Folke
  %A J{ä}schke, Robert
  %A Krause, Beate
  %A Schmitz, Christoph
  %A Stumme, Gerd
  %D 2010
  %J HMD -- Praxis der Wirtschaftsinformatik
  %P 47-58
  %T {Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f{ü}r Wissenschaftler}
  %V Heft 271
  %X Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr{ö}ßerer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw{ä}rtigkeit, die st{ä}ndige Verf{ü}gbarkeit, aber auch die M{ö}glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr{ü}nde f{ü}r ihren gegenw{ä}rtigen Erfolg. Der Artikel f{ü}hrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl{ä}ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schließt mit Querbez{ü}gen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.
  

• Mitzlaff, F., Atzmüller, M., Benz, D., Hotho, A., Stumme, G.: Community Assessment using Evidence Networks Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010). , Barcelona, Spain (2010).

  URLBibTeXEndNote

  Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.

  @inproceedings{mitzlaff2010community,
  abstract = {Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.},
  address = {Barcelona, Spain},
  author = {Mitzlaff, Folke and Atzmüller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)},
  keywords = {networks},
  title = {Community Assessment using Evidence Networks},
  year = 2010
  }
  

  %0 Conference Paper
  %1 mitzlaff2010community
  %A Mitzlaff, Folke
  %A Atzmüller, Martin
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)
  %C Barcelona, Spain
  %D 2010
  %T Community Assessment using Evidence Networks
  %U https://www.kde.cs.uni-kassel.de/ws/muse2010
  %X Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.
  

• Benz, D., Hotho, A., Jäschke, R., Stumme, G., Halle, A., Lima, A.G.S., Steenweg, H., Stefani, S.: Academic Publication Management with PUMA - collect, organize and share publications In: Lalmas, M., Jose, J., Rauber, A., Sebastiani, F., and Frommholz, I. (eds.) Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries (ECDL) 2010. pp. 417–420. Springer, Berlin/Heidelberg (2010).

  BibTeXEndNote

  The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.

  @inproceedings{benz2010academic,
  abstract = {The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.},
  address = {Berlin/Heidelberg},
  author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd and Halle, Axel and Lima, Angela Gerlach Sanches and Steenweg, Helge and Stefani, Sven},
  booktitle = {Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries (ECDL) 2010},
  editor = {Lalmas, M. and Jose, J. and Rauber, A. and Sebastiani, F. and Frommholz, I.},
  keywords = {unik},
  pages = {417--420},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Academic Publication Management with PUMA - collect, organize and share publications},
  volume = 6273,
  year = 2010
  }
  

  %0 Conference Paper
  %1 benz2010academic
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Stumme, Gerd
  %A Halle, Axel
  %A Lima, Angela Gerlach Sanches
  %A Steenweg, Helge
  %A Stefani, Sven
  %B Proceedings of the European Conference on Research and Advanced Technology for Digital Libraries (ECDL) 2010
  %C Berlin/Heidelberg
  %D 2010
  %E Lalmas, M.
  %E Jose, J.
  %E Rauber, A.
  %E Sebastiani, F.
  %E Frommholz, I.
  %I Springer
  %P 417--420
  %T Academic Publication Management with PUMA - collect, organize and share publications
  %V 6273
  %X The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.
  

• Körner, C., Benz, D., Hotho, A., Strohmaier, M., Stumme, G.: Social Bookmarking Systems: Verbosity Improves Semantics Proceedings of INSNA Sunbelt XXX. , Riva del Garda Fierecongressi, Trento, Italy (2010).

  BibTeXEndNote

  @inproceedings{koerner2010social,
  address = {Riva del Garda Fierecongressi, Trento, Italy},
  author = {Körner, Christian and Benz, Dominik and Hotho, Andreas and Strohmaier, Markus and Stumme, Gerd},
  booktitle = {Proceedings of INSNA Sunbelt XXX},
  keywords = {myown},
  title = {Social Bookmarking Systems: Verbosity Improves Semantics},
  year = 2010
  }
  

  %0 Conference Paper
  %1 koerner2010social
  %A Körner, Christian
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Strohmaier, Markus
  %A Stumme, Gerd
  %B Proceedings of INSNA Sunbelt XXX
  %C Riva del Garda Fierecongressi, Trento, Italy
  %D 2010
  %T Social Bookmarking Systems: Verbosity Improves Semantics
  

• Mitzlaff, F., Benz, D., Stumme, G., Hotho, A.: Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy Proceedings of the 21st ACM conference on Hypertext and hypermedia. , Toronto, Canada (2010).

  BibTeXEndNote

  @inproceedings{eisterlehner2010visit,
  address = {Toronto, Canada},
  author = {Mitzlaff, Folke and Benz, Dominik and Stumme, Gerd and Hotho, Andreas},
  booktitle = {Proceedings of the 21st ACM conference on Hypertext and hypermedia},
  keywords = {web},
  title = {Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy},
  year = 2010
  }
  

  %0 Conference Paper
  %1 eisterlehner2010visit
  %A Mitzlaff, Folke
  %A Benz, Dominik
  %A Stumme, Gerd
  %A Hotho, Andreas
  %B Proceedings of the 21st ACM conference on Hypertext and hypermedia
  %C Toronto, Canada
  %D 2010
  %T Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy
  

• Berendt, B., Hotho, A., Stumme, G.: Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0 Web Semantics: Science, Services and Agents on the World Wide Web. 8, 95–96 (2010).

  URLBibTeXEndNote

  @article{berendt2010bridging,
  author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd},
  journal = {Web Semantics: Science, Services and Agents on the World Wide Web},
  keywords = {web},
  note = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0; The Future of Knowledge Dissemination: The Elsevier Grand Challenge for the Life Sciences},
  number = {2-3},
  pages = {95 - 96},
  title = {Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0},
  volume = 8,
  year = 2010
  }
  

  %0 Journal Article
  %1 berendt2010bridging
  %A Berendt, Bettina
  %A Hotho, Andreas
  %A Stumme, Gerd
  %D 2010
  %J Web Semantics: Science, Services and Agents on the World Wide Web
  %N 2-3
  %P 95 - 96
  %R DOI: 10.1016/j.websem.2010.04.008
  %T Bridging the Gap--Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2.0
  %U http://www.sciencedirect.com/science/article/B758F-4YXK4HW-1/2/4cb514565477c54160b5e6eb716c32d7
  %V 8
  

• Benz, D., Hotho, A., Stumme, G.: Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge Proceedings of the 2nd Web Science Conference (WebSci10). , Raleigh, NC, USA (2010).

  BibTeXEndNote

  @inproceedings{benz2010semantics,
  address = {Raleigh, NC, USA},
  author = {Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 2nd Web Science Conference (WebSci10)},
  keywords = {websci10},
  title = {Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge},
  year = 2010
  }
  

  %0 Conference Paper
  %1 benz2010semantics
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 2nd Web Science Conference (WebSci10)
  %C Raleigh, NC, USA
  %D 2010
  %T Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge
  

2009

• Jäschke, R., Eisterlehner, F., Hotho, A., Stumme, G.: Testing and Evaluating Tag Recommenders in a Live System In: Benz, D. and Janssen, F. (eds.) Workshop on Knowledge Discovery, Data Mining, and Machine Learning. pp. 44–51 (2009).

  URLBibTeXEndNote

  The challenge to provide tag recommendations for collaborative tagging systems has attracted quite some attention of researchers lately. However, most research focused on evaluation and development of appropriate methods rather than tackling the practical challenges of how to integrate recommendation methods into real tagging systems, record and evaluate their performance. In this paper we describe the tag recommendation framework we developed for our social bookmark and publication sharing system BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. Furthermore, this paper presents an evaluation of two exemplarily deployed recommendation methods, demonstrating the power of the framework.

  @inproceedings{jaeschke2009testingKDML,
  abstract = {The challenge to provide tag recommendations for collaborative tagging systems has attracted quite some attention of researchers lately. However, most research focused on evaluation and development of appropriate methods rather than tackling the practical challenges of how to integrate recommendation methods into real tagging systems, record and evaluate their performance. In this paper we describe the tag recommendation framework we developed for our social bookmark and publication sharing system BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. Furthermore, this paper presents an evaluation of two exemplarily deployed recommendation methods, demonstrating the power of the framework.},
  author = {Jäschke, Robert and Eisterlehner, Folke and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Workshop on Knowledge Discovery, Data Mining, and Machine Learning},
  editor = {Benz, Dominik and Janssen, Frederik},
  keywords = {tagging},
  month = {sep},
  pages = {44 --51},
  title = {Testing and Evaluating Tag Recommenders in a Live System},
  year = 2009
  }
  

  %0 Conference Paper
  %1 jaeschke2009testingKDML
  %A Jäschke, Robert
  %A Eisterlehner, Folke
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Workshop on Knowledge Discovery, Data Mining, and Machine Learning
  %D 2009
  %E Benz, Dominik
  %E Janssen, Frederik
  %P 44 --51
  %T Testing and Evaluating Tag Recommenders in a Live System
  %U http://lwa09.informatik.tu-darmstadt.de/pub/KDML/WebHome/kdml09_R.Jaeschke_et_al.pdf
  %X The challenge to provide tag recommendations for collaborative tagging systems has attracted quite some attention of researchers lately. However, most research focused on evaluation and development of appropriate methods rather than tackling the practical challenges of how to integrate recommendation methods into real tagging systems, record and evaluate their performance. In this paper we describe the tag recommendation framework we developed for our social bookmark and publication sharing system BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. Furthermore, this paper presents an evaluation of two exemplarily deployed recommendation methods, demonstrating the power of the framework.
  

• Benz, D., Krause, B., Kumar, G.P., Hotho, A., Stumme, G.: Characterizing Semantic Relatedness of Search Query Terms Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009). , Bled, Slovenia (2009).

  BibTeXEndNote

  @inproceedings{benz2009characterizing,
  address = {Bled, Slovenia},
  author = {Benz, Dominik and Krause, Beate and Kumar, G. Praveen and Hotho, Andreas and Stumme, Gerd},
  booktitle = {Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009)},
  keywords = {similarity},
  month = {September},
  title = {Characterizing Semantic Relatedness of Search Query Terms},
  year = 2009
  }
  

  %0 Conference Paper
  %1 benz2009characterizing
  %A Benz, Dominik
  %A Krause, Beate
  %A Kumar, G. Praveen
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009)
  %C Bled, Slovenia
  %D 2009
  %T Characterizing Semantic Relatedness of Search Query Terms
  

• Markines, B., Cattuto, C., Menczer, F., Benz, D., Hotho, A., Stumme, G.: Evaluating Similarity Measures for Emergent Semantics of Social Tagging 18th International World Wide Web Conference. pp. 641–650 (2009).

  URLBibTeXEndNote

  Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.

  @inproceedings{markines2009evaluating,
  abstract = {Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.},
  author = {Markines, Benjamin and Cattuto, Ciro and Menczer, Filippo and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  booktitle = {18th International World Wide Web Conference},
  keywords = {www2009},
  month = {April},
  pages = {641--650},
  title = {Evaluating Similarity Measures for Emergent Semantics of Social Tagging},
  year = 2009
  }
  

  %0 Conference Paper
  %1 markines2009evaluating
  %A Markines, Benjamin
  %A Cattuto, Ciro
  %A Menczer, Filippo
  %A Benz, Dominik
  %A Hotho, Andreas
  %A Stumme, Gerd
  %B 18th International World Wide Web Conference
  %D 2009
  %P 641--650
  %T Evaluating Similarity Measures for Emergent Semantics of Social Tagging
  %U http://www2009.eprints.org/65/
  %X Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.
  

• Hotho, A., Jäschke, R., Benz, D., Grahl, M., Krause, B., Schmitz, C., Stumme, G.: Social Bookmarking am Beispiel BibSonomy In: Blumauer, A. and Pellegrini, T. (eds.) Social Semantic Web. pp. 363–391. Springer, Berlin, Heidelberg (2009).

  URLBibTeXEndNote

  BibSonomy ist ein kooperatives Verschlagwortungssystem (Social Bookmarking System), betrieben vom Fachgebiet Wissensverarbeitung der Universit{ä}t Kassel. Es erlaubt das Speichern und Organisieren von Web-Lesezeichen und Metadaten für wissenschaftlichePublikationen. In diesem Beitrag beschreiben wir die von BibSonomy bereitgestellte Funktionalit{ä}t, die dahinter stehende Architektursowie das zugrunde liegende Datenmodell. Ferner erläutern wir Anwendungsbeispiele und gehen auf Methoden zur Analyse der in BibSonomy und ähnlichen Systemen enthaltenen Daten ein.

  @incollection{hotho2008social,
  abstract = {BibSonomy ist ein kooperatives Verschlagwortungssystem (Social Bookmarking System), betrieben vom Fachgebiet Wissensverarbeitung der Universit{ä}t Kassel. Es erlaubt das Speichern und Organisieren von Web-Lesezeichen und Metadaten für wissenschaftlichePublikationen. In diesem Beitrag beschreiben wir die von BibSonomy bereitgestellte Funktionalit{ä}t, die dahinter stehende Architektursowie das zugrunde liegende Datenmodell. Ferner erläutern wir Anwendungsbeispiele und gehen auf Methoden zur Analyse der in BibSonomy und ähnlichen Systemen enthaltenen Daten ein.},
  address = {Berlin, Heidelberg},
  author = {Hotho, Andreas and Jäschke, Robert and Benz, Dominik and Grahl, Miranda and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},
  booktitle = {Social Semantic Web},
  chapter = 18,
  editor = {Blumauer, Andreas and Pellegrini, Tassilo},
  keywords = {tagorapub},
  pages = {363--391},
  publisher = {Springer},
  series = {X.media.press},
  title = {Social Bookmarking am Beispiel BibSonomy},
  year = 2009
  }
  

  %0 Book Section
  %1 hotho2008social
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Benz, Dominik
  %A Grahl, Miranda
  %A Krause, Beate
  %A Schmitz, Christoph
  %A Stumme, Gerd
  %B Social Semantic Web
  %C Berlin, Heidelberg
  %D 2009
  %E Blumauer, Andreas
  %E Pellegrini, Tassilo
  %I Springer
  %P 363--391
  %R 10.1007/978-3-540-72216-8
  %T Social Bookmarking am Beispiel BibSonomy
  %U http://dx.doi.org/10.1007/978-3-540-72216-8_18
  %X BibSonomy ist ein kooperatives Verschlagwortungssystem (Social Bookmarking System), betrieben vom Fachgebiet Wissensverarbeitung der Universit{ä}t Kassel. Es erlaubt das Speichern und Organisieren von Web-Lesezeichen und Metadaten für wissenschaftlichePublikationen. In diesem Beitrag beschreiben wir die von BibSonomy bereitgestellte Funktionalit{ä}t, die dahinter stehende Architektursowie das zugrunde liegende Datenmodell. Ferner erläutern wir Anwendungsbeispiele und gehen auf Methoden zur Analyse der in BibSonomy und ähnlichen Systemen enthaltenen Daten ein.
  %& 18
  %@ 978-3-540-72215-1
  

• Benz, D., Eisterlehner, F., Hotho, A., Jäschke, R., Krause, B., Stumme, G.: Managing publications and bookmarks with BibSonomy In: Cattuto, C., Ruffo, G., and Menczer, F. (eds.) HT ’09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia. pp. 323–324. ACM, New York, NY, USA (2009).

  URLBibTeXEndNote

  In this demo we present BibSonomy, a social bookmark and publication sharing system.

  @inproceedings{benz2009managing,
  abstract = {In this demo we present BibSonomy, a social bookmark and publication sharing system.},
  address = {New York, NY, USA},
  author = {Benz, Dominik and Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd},
  booktitle = {HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia},
  editor = {Cattuto, Ciro and Ruffo, Giancarlo and Menczer, Filippo},
  keywords = {myown},
  month = {jun},
  pages = {323--324},
  publisher = {ACM},
  title = {Managing publications and bookmarks with BibSonomy},
  year = 2009
  }
  

  %0 Conference Paper
  %1 benz2009managing
  %A Benz, Dominik
  %A Eisterlehner, Folke
  %A Hotho, Andreas
  %A Jäschke, Robert
  %A Krause, Beate
  %A Stumme, Gerd
  %B HT '09: Proceedings of the 20th ACM Conference on Hypertext and Hypermedia
  %C New York, NY, USA
  %D 2009
  %E Cattuto, Ciro
  %E Ruffo, Giancarlo
  %E Menczer, Filippo
  %I ACM
  %P 323--324
  %R 10.1145/1557914.1557969
  %T Managing publications and bookmarks with BibSonomy
  %U http://portal.acm.org/citation.cfm?doid=1557914.1557969#
  %X In this demo we present BibSonomy, a social bookmark and publication sharing system.
  %@ 978-1-60558-486-7