The list is generated automatically by BibSonomy. For more details and BibTeX entries, please click on the titles.
- All publications in BibTeX.
- All publications in one list.
- All publications in the SWRC ontology.
- All publications as rss feed.
- All publications in EndNote.
- Search also in DBLP, CiteSeer, Google Scholar, and Zentralblatt MATH.
2024
- 1.Draude, C., Engert, S., Hess, T., Hirth, J., Horn, V., Kropf, J., Lamla, J., Stumme, G., Uhlmann, M., Zwingmann, N.: Verrechnung – Design – Kultivierung: Instrumentenkasten für die Gestaltung fairer Geschäftsmodelle durch Ko-Valuation. Fraunhofer-Institut für System- und Innovationsforschung ISI, Karlsruhe (2024). https://doi.org/10.24406/publica-2497.
@techreport{claude2024verrechnung,
address = {Karlsruhe},
author = {Draude, Claude and Engert, Simon and Hess, Thomas and Hirth, Johannes and Horn, Viktoria and Kropf, Jonathan and Lamla, Jörn and Stumme, Gerd and Uhlmann, Markus and Zwingmann, Nina},
edition = 1,
editor = {Friedewald, Michael and Roßnagel, Alexander and Geminn, Christian and Karaboga, Murat},
howpublished = {White Paper},
keywords = {itegpub},
month = {03},
publisher = {Fraunhofer-Institut für System- und Innovationsforschung ISI},
series = {Plattform Privatheit},
title = {Verrechnung – Design – Kultivierung: Instrumentenkasten für die Gestaltung fairer Geschäftsmodelle durch Ko-Valuation},
year = 2024
}%0 Report
%1 claude2024verrechnung
%A Draude, Claude
%A Engert, Simon
%A Hess, Thomas
%A Hirth, Johannes
%A Horn, Viktoria
%A Kropf, Jonathan
%A Lamla, Jörn
%A Stumme, Gerd
%A Uhlmann, Markus
%A Zwingmann, Nina
%B Plattform Privatheit
%C Karlsruhe
%D 2024
%E Friedewald, Michael
%E Roßnagel, Alexander
%E Geminn, Christian
%E Karaboga, Murat
%I Fraunhofer-Institut für System- und Innovationsforschung ISI
%R 10.24406/publica-2497
%T Verrechnung – Design – Kultivierung: Instrumentenkasten für die Gestaltung fairer Geschäftsmodelle durch Ko-Valuation
%U https://plattform-privatheit.de/p-prv-wAssets/Assets/Veroeffentlichungen_WhitePaper_PolicyPaper/whitepaper/WP_2024_FAIRDIENSTE_1.0.pdf
%7 1 - 1.Draude, C., Dürrschnabel, D., Hirth, J., Horn, V., Kropf, J., Lamla, J., Stumme, G., Uhlmann, M.: Conceptual Mapping of Controversies. In: Cabrera, I.P., Ferré, S., and Obiedkov, S. (eds.) Conceptual Knowledge Structures. pp. 201–216. Springer Nature Switzerland, Cham (2024).With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.
@inproceedings{10.1007/978-3-031-67868-4_14,
abstract = {With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.},
address = {Cham},
author = {Draude, Claude and Dürrschnabel, Dominik and Hirth, Johannes and Horn, Viktoria and Kropf, Jonathan and Lamla, J{ö}rn and Stumme, Gerd and Uhlmann, Markus},
booktitle = {Conceptual Knowledge Structures},
editor = {Cabrera, Inma P. and Ferré, Sébastien and Obiedkov, Sergei},
keywords = {itegpub},
pages = {201--216},
publisher = {Springer Nature Switzerland},
title = {Conceptual Mapping of Controversies},
year = 2024
}%0 Conference Paper
%1 10.1007/978-3-031-67868-4_14
%A Draude, Claude
%A Dürrschnabel, Dominik
%A Hirth, Johannes
%A Horn, Viktoria
%A Kropf, Jonathan
%A Lamla, J{ö}rn
%A Stumme, Gerd
%A Uhlmann, Markus
%B Conceptual Knowledge Structures
%C Cham
%D 2024
%E Cabrera, Inma P.
%E Ferré, Sébastien
%E Obiedkov, Sergei
%I Springer Nature Switzerland
%P 201--216
%T Conceptual Mapping of Controversies
%X With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles.
%@ 978-3-031-67868-4 - 1.Abdulla, M., Hirth, J., Stumme, G.: The Birkhoff Completion of Finite Lattices. In: Cabrera, I.P., Ferré, S., and Obiedkov, S. (eds.) Conceptual Knowledge Structures. pp. 20–35. Springer Nature Switzerland, Cham (2024).We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science.
@inproceedings{10.1007/978-3-031-67868-4_2,
abstract = {We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science.},
address = {Cham},
author = {Abdulla, Mohammad and Hirth, Johannes and Stumme, Gerd},
booktitle = {Conceptual Knowledge Structures},
editor = {Cabrera, Inma P. and Ferré, Sébastien and Obiedkov, Sergei},
keywords = {itegpub},
pages = {20--35},
publisher = {Springer Nature Switzerland},
title = {The Birkhoff Completion of Finite Lattices},
year = 2024
}%0 Conference Paper
%1 10.1007/978-3-031-67868-4_2
%A Abdulla, Mohammad
%A Hirth, Johannes
%A Stumme, Gerd
%B Conceptual Knowledge Structures
%C Cham
%D 2024
%E Cabrera, Inma P.
%E Ferré, Sébastien
%E Obiedkov, Sergei
%I Springer Nature Switzerland
%P 20--35
%T The Birkhoff Completion of Finite Lattices
%X We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's simply-implicational theories. By an example, we show how the Birkhoff completion can be used as a tool for ordinal data science.
%@ 978-3-031-67868-4 - 1.Draude, C., Dürrschnabel, D., Hirth, J., Horn, V., Kropf, J., Lamla, J., Stumme, G., Uhlmann, M.: Conceptual Mapping of Controversies, (2024).With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles
@misc{draude2024conceptual,
abstract = {With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles},
author = {Draude, Claude and Dürrschnabel, Dominik and Hirth, Johannes and Horn, Viktoria and Kropf, Jonathan and Lamla, Jörn and Stumme, Gerd and Uhlmann, Markus},
keywords = {itegpub},
title = {Conceptual Mapping of Controversies},
year = 2024
}%0 Generic
%1 draude2024conceptual
%A Draude, Claude
%A Dürrschnabel, Dominik
%A Hirth, Johannes
%A Horn, Viktoria
%A Kropf, Jonathan
%A Lamla, Jörn
%A Stumme, Gerd
%A Uhlmann, Markus
%D 2024
%T Conceptual Mapping of Controversies
%X With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media. For this, we employ Formal Concept Analysis and the economics of conventions to derive conceptual controversy maps. In our experiments, we analyze two maps from different news journals with methods from ordinal data science. We show how these methods can be used to assess the diversity, complexity and potential bias of controversies. In addition to that, we discuss how the diagrams of concept lattices can be used to navigate between news articles - 1.Abdulla, M., Hirth, J., Stumme, G.: The Birkhoff completion of finite lattices, (2024).
@misc{abdulla2024birkhoff,
author = {Abdulla, Mohammad and Hirth, Johannes and Stumme, Gerd},
keywords = {itegpub},
title = {The Birkhoff completion of finite lattices},
year = 2024
}%0 Generic
%1 abdulla2024birkhoff
%A Abdulla, Mohammad
%A Hirth, Johannes
%A Stumme, Gerd
%D 2024
%T The Birkhoff completion of finite lattices - 1.Horn, V., Hirth, J., Holfeld, J., Behmenburg, J.H., Draude, C., Stumme, G.: Disclosing Diverse Perspectives of News Articles for Navigating between Online Journalism Content. In: Nordic Conference on Human-Computer Interaction. Association for Computing Machinery, Uppsala, Sweden (2024). https://doi.org/10.1145/3679318.3685414.Today, exposure to journalistic online content is predominantly controlled by news recommender systems, which often suggest content that matches user’s interests or is selected according to non-transparent recommendation criteria. To circumvent resulting trade-offs like polarisation or fragmentation whilst ensuring user’s autonomy, we explore how different perspectives within online news can be disclosed instead for guiding navigation. To do so, we developed an interactive prototype that displays article titles in correspondence to their argumentative orientation. In order to investigate how the usage of our novel navigation structure impacts the choice of news articles and user experience, we conducted an exploratory user study assessing the impact of the design parameters chosen. Implications are drawn from the study results and the development of the interactive prototype for the exposure to diversity in the context of navigating news content online.
@inproceedings{hci-lattice,
abstract = {Today, exposure to journalistic online content is predominantly controlled by news recommender systems, which often suggest content that matches user’s interests or is selected according to non-transparent recommendation criteria. To circumvent resulting trade-offs like polarisation or fragmentation whilst ensuring user’s autonomy, we explore how different perspectives within online news can be disclosed instead for guiding navigation. To do so, we developed an interactive prototype that displays article titles in correspondence to their argumentative orientation. In order to investigate how the usage of our novel navigation structure impacts the choice of news articles and user experience, we conducted an exploratory user study assessing the impact of the design parameters chosen. Implications are drawn from the study results and the development of the interactive prototype for the exposure to diversity in the context of navigating news content online.},
address = {New York, NY, USA},
author = {Horn, Viktoria and Hirth, Johannes and Holfeld, Julian and Behmenburg, Jens Hendrik and Draude, Claude and Stumme, Gerd},
booktitle = {Nordic Conference on Human-Computer Interaction},
keywords = {itegpub},
publisher = {Association for Computing Machinery},
series = {NordiCHI 2024},
title = {Disclosing Diverse Perspectives of News Articles for Navigating between Online Journalism Content},
year = 2024
}%0 Conference Paper
%1 hci-lattice
%A Horn, Viktoria
%A Hirth, Johannes
%A Holfeld, Julian
%A Behmenburg, Jens Hendrik
%A Draude, Claude
%A Stumme, Gerd
%B Nordic Conference on Human-Computer Interaction
%C New York, NY, USA
%D 2024
%I Association for Computing Machinery
%R 10.1145/3679318.3685414
%T Disclosing Diverse Perspectives of News Articles for Navigating between Online Journalism Content
%U https://doi.org/10.1145/3679318.3685414
%X Today, exposure to journalistic online content is predominantly controlled by news recommender systems, which often suggest content that matches user’s interests or is selected according to non-transparent recommendation criteria. To circumvent resulting trade-offs like polarisation or fragmentation whilst ensuring user’s autonomy, we explore how different perspectives within online news can be disclosed instead for guiding navigation. To do so, we developed an interactive prototype that displays article titles in correspondence to their argumentative orientation. In order to investigate how the usage of our novel navigation structure impacts the choice of news articles and user experience, we conducted an exploratory user study assessing the impact of the design parameters chosen. Implications are drawn from the study results and the development of the interactive prototype for the exposure to diversity in the context of navigating news content online.
%@ 9798400709661 - 1.Hirth, J., Horn, V., Stumme, G., Hanika, T.: Ordinal motifs in lattices. Information Sciences. 659, 120009 (2024). https://doi.org/https://doi.org/10.1016/j.ins.2023.120009.
@article{HIRTH2024120009,
author = {Hirth, Johannes and Horn, Viktoria and Stumme, Gerd and Hanika, Tom},
journal = {Information Sciences},
keywords = {itegpub},
pages = 120009,
title = {Ordinal motifs in lattices},
volume = 659,
year = 2024
}%0 Journal Article
%1 HIRTH2024120009
%A Hirth, Johannes
%A Horn, Viktoria
%A Stumme, Gerd
%A Hanika, Tom
%D 2024
%J Information Sciences
%P 120009
%R https://doi.org/10.1016/j.ins.2023.120009
%T Ordinal motifs in lattices
%U https://www.sciencedirect.com/science/article/pii/S0020025523015943
%V 659
2023
- 1.Felde, M., Stumme, G.: Interactive collaborative exploration using incomplete contexts. Data & Knowledge Engineering. 143, 102104 (2023). https://doi.org/10.1016/j.datak.2022.102104.
@article{Felde_2023,
author = {Felde, Maximilian and Stumme, Gerd},
journal = {Data & Knowledge Engineering},
keywords = {itegpub},
month = {01},
pages = 102104,
publisher = {Elsevier {BV}},
title = {Interactive collaborative exploration using incomplete contexts},
volume = 143,
year = 2023
}%0 Journal Article
%1 Felde_2023
%A Felde, Maximilian
%A Stumme, Gerd
%D 2023
%I Elsevier {BV}
%J Data & Knowledge Engineering
%P 102104
%R 10.1016/j.datak.2022.102104
%T Interactive collaborative exploration using incomplete contexts
%U https://doi.org/10.1016%2Fj.datak.2022.102104
%V 143 - 1.Hirth, J., Horn, V., Stumme, G., Hanika, T.: Ordinal Motifs in Lattices, https://arxiv.org/abs/2304.04827, (2023).Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.
@misc{hirth2023ordinal,
abstract = {Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.},
author = {Hirth, Johannes and Horn, Viktoria and Stumme, Gerd and Hanika, Tom},
keywords = {itegpub},
title = {Ordinal Motifs in Lattices},
year = 2023
}%0 Generic
%1 hirth2023ordinal
%A Hirth, Johannes
%A Horn, Viktoria
%A Stumme, Gerd
%A Hanika, Tom
%D 2023
%T Ordinal Motifs in Lattices
%U https://arxiv.org/abs/2304.04827
%X Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set. - 1.Koyda, M., Stumme, G.: Factorizing Lattices by Interval Relations. Int. J. Approx. Reason. 157, 70–87 (2023).
@article{koyda2023factorizing,
author = {Koyda, Maren and Stumme, Gerd},
journal = {Int. J. Approx. Reason.},
keywords = {itegpub},
pages = {70-87},
title = {Factorizing Lattices by Interval Relations},
volume = 157,
year = 2023
}%0 Journal Article
%1 koyda2023factorizing
%A Koyda, Maren
%A Stumme, Gerd
%D 2023
%J Int. J. Approx. Reason.
%P 70-87
%T Factorizing Lattices by Interval Relations
%U http://dblp.uni-trier.de/db/journals/ijar/ijar157.html#KoydaS23
%V 157 - 1.Stumme, G., Dürrschnabel, D., Hanika, T.: Towards Ordinal Data Science. Transactions on Graph Data and Knowledge. 1, 6:1–6:39 (2023). https://doi.org/10.4230/TGDK.1.1.6.
@article{DBLP:journals/tgdk/StummeDH23,
author = {Stumme, Gerd and Dürrschnabel, Dominik and Hanika, Tom},
journal = {Transactions on Graph Data and Knowledge},
keywords = {itegpub},
number = 1,
pages = {6:1--6:39},
title = {Towards Ordinal Data Science},
volume = 1,
year = 2023
}%0 Journal Article
%1 DBLP:journals/tgdk/StummeDH23
%A Stumme, Gerd
%A Dürrschnabel, Dominik
%A Hanika, Tom
%D 2023
%J Transactions on Graph Data and Knowledge
%N 1
%P 6:1--6:39
%R 10.4230/TGDK.1.1.6
%T Towards Ordinal Data Science
%U https://doi.org/10.4230/TGDK.1.1.6
%V 1 - 1.Dürrschnabel, D., Stumme, G.: Maximal Ordinal Two-Factorizations. In: Ojeda-Aciego, M., Sauerwald, K., and Jäschke, R. (eds.) Graph-Based Representation and Reasoning. pp. 41–55. Springer Nature Switzerland, Cham (2023).Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an {\$}{\$}{\backslash}textsf{\{}NP{\}}{\$}{\$}NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.
@inproceedings{10.1007/978-3-031-40960-8_5,
abstract = {Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an {\$}{\$}{\backslash}textsf{\{}NP{\}}{\$}{\$}NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.},
address = {Cham},
author = {Dürrschnabel, Dominik and Stumme, Gerd},
booktitle = {Graph-Based Representation and Reasoning},
editor = {Ojeda-Aciego, Manuel and Sauerwald, Kai and Jäschke, Robert},
keywords = {itegpub},
pages = {41--55},
publisher = {Springer Nature Switzerland},
title = {Maximal Ordinal Two-Factorizations},
year = 2023
}%0 Conference Paper
%1 10.1007/978-3-031-40960-8_5
%A Dürrschnabel, Dominik
%A Stumme, Gerd
%B Graph-Based Representation and Reasoning
%C Cham
%D 2023
%E Ojeda-Aciego, Manuel
%E Sauerwald, Kai
%E Jäschke, Robert
%I Springer Nature Switzerland
%P 41--55
%T Maximal Ordinal Two-Factorizations
%X Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an {\$}{\$}{\backslash}textsf{\{}NP{\}}{\$}{\$}NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.
%@ 978-3-031-40960-8 - 1.Dürrschnabel, D., Stumme, G.: Maximal Ordinal Two-Factorizations, http://arxiv.org/abs/2304.03338, (2023).Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.
@misc{durrschnabel2023maximal,
abstract = {Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations.},
author = {Dürrschnabel, Dominik and Stumme, Gerd},
keywords = {itegpub},
note = {cite arxiv:2304.03338Comment: 14 pages, 6 figures, 2 algorithms},
title = {Maximal Ordinal Two-Factorizations},
year = 2023
}%0 Generic
%1 durrschnabel2023maximal
%A Dürrschnabel, Dominik
%A Stumme, Gerd
%D 2023
%T Maximal Ordinal Two-Factorizations
%U http://arxiv.org/abs/2304.03338
%X Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and Glodeanu proposed a biplot based on two ordinal factors. For the biplot to be useful, it is important that these factors comprise as much data points as possible, i.e., that they cover a large part of the incidence relation. In this work, we investigate such ordinal two-factorizations. First, we investigate for formal contexts that omit ordinal two-factorizations the disjointness of the two factors. Then, we show that deciding on the existence of two-factorizations of a given size is an NP-complete problem which makes computing maximal factorizations computationally expensive. Finally, we provide the algorithm Ord2Factor that allows us to compute large ordinal two-factorizations. - 1.Dürrschnabel, D., Stumme, G.: Greedy Discovery of Ordinal Factors, http://arxiv.org/abs/2302.11554, (2023).In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a few tags result in complex and for humans hard-to-navigate systems. In this work, we adopt the method of ordinal factor analysis to address this problem. An ordinal factor arranges a subset of the tags in a linear order based on their underlying structure. A complete ordinal factorization, which consists of such ordinal factors, precisely represents the original dataset. Based on such an ordinal factorization, we provide a way to discover and explain relationships between different items and attributes in the dataset. However, computing even just one ordinal factor of high cardinality is computationally complex. We thus propose the greedy algorithm in this work. This algorithm extracts ordinal factors using already existing fast algorithms developed in formal concept analysis. Then, we leverage to propose a comprehensive way to discover relationships in the dataset. We furthermore introduce a distance measure based on the representation emerging from the ordinal factorization to discover similar items. To evaluate the method, we conduct a case study on different datasets.
@misc{durrschnabel2023greedy,
abstract = {In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a few tags result in complex and for humans hard-to-navigate systems. In this work, we adopt the method of ordinal factor analysis to address this problem. An ordinal factor arranges a subset of the tags in a linear order based on their underlying structure. A complete ordinal factorization, which consists of such ordinal factors, precisely represents the original dataset. Based on such an ordinal factorization, we provide a way to discover and explain relationships between different items and attributes in the dataset. However, computing even just one ordinal factor of high cardinality is computationally complex. We thus propose the greedy algorithm in this work. This algorithm extracts ordinal factors using already existing fast algorithms developed in formal concept analysis. Then, we leverage to propose a comprehensive way to discover relationships in the dataset. We furthermore introduce a distance measure based on the representation emerging from the ordinal factorization to discover similar items. To evaluate the method, we conduct a case study on different datasets.},
author = {Dürrschnabel, Dominik and Stumme, Gerd},
keywords = {itegpub},
note = {cite arxiv:2302.11554Comment: 11 pages, 6 figures, 2 tables, 3 algorithms},
title = {Greedy Discovery of Ordinal Factors},
year = 2023
}%0 Generic
%1 durrschnabel2023greedy
%A Dürrschnabel, Dominik
%A Stumme, Gerd
%D 2023
%T Greedy Discovery of Ordinal Factors
%U http://arxiv.org/abs/2302.11554
%X In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a few tags result in complex and for humans hard-to-navigate systems. In this work, we adopt the method of ordinal factor analysis to address this problem. An ordinal factor arranges a subset of the tags in a linear order based on their underlying structure. A complete ordinal factorization, which consists of such ordinal factors, precisely represents the original dataset. Based on such an ordinal factorization, we provide a way to discover and explain relationships between different items and attributes in the dataset. However, computing even just one ordinal factor of high cardinality is computationally complex. We thus propose the greedy algorithm in this work. This algorithm extracts ordinal factors using already existing fast algorithms developed in formal concept analysis. Then, we leverage to propose a comprehensive way to discover relationships in the dataset. We furthermore introduce a distance measure based on the representation emerging from the ordinal factorization to discover similar items. To evaluate the method, we conduct a case study on different datasets. - 1.Hirth, J., Horn, V., Stumme, G., Hanika, T.: Ordinal Motifs in Lattices. Information Sciences. 120009 (2023). https://doi.org/https://doi.org/10.1016/j.ins.2023.120009.Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.
@article{hirth2023ordinal,
abstract = {Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.},
author = {Hirth, Johannes and Horn, Viktoria and Stumme, Gerd and Hanika, Tom},
journal = {Information Sciences},
keywords = {itegpub},
pages = 120009,
title = {Ordinal Motifs in Lattices},
year = 2023
}%0 Journal Article
%1 hirth2023ordinal
%A Hirth, Johannes
%A Horn, Viktoria
%A Stumme, Gerd
%A Hanika, Tom
%D 2023
%J Information Sciences
%P 120009
%R https://doi.org/10.1016/j.ins.2023.120009
%T Ordinal Motifs in Lattices
%U https://www.sciencedirect.com/science/article/pii/S0020025523015943
%X Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set. - 1.Stumme, G., Dürrschnabel, D., Hanika, T.: Towards Ordinal Data Science, https://doi.org/10.48550/arXiv.2307.09477, (2023). https://doi.org/10.48550/arXiv.2307.09477.
@misc{DBLP:journals/corr/abs-2307-09477,
author = {Stumme, Gerd and Dürrschnabel, Dominik and Hanika, Tom},
journal = {CoRR},
keywords = {itegpub},
title = {Towards Ordinal Data Science},
volume = {abs/2307.09477},
year = 2023
}%0 Generic
%1 DBLP:journals/corr/abs-2307-09477
%A Stumme, Gerd
%A Dürrschnabel, Dominik
%A Hanika, Tom
%D 2023
%J CoRR
%R 10.48550/arXiv.2307.09477
%T Towards Ordinal Data Science
%U https://doi.org/10.48550/arXiv.2307.09477
%V abs/2307.09477 - 1.Hirth, J., Horn, V., Stumme, G., Hanika, T.: Automatic Textual Explanations of Concept Lattices. In: Ojeda-Aciego, M., Sauerwald, K., and Jäschke, R. (eds.) Graph-Based Representation and Reasoning. pp. 138–152. Springer Nature Switzerland, Cham (2023).Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales. We show the computational complexity of identifying a small number of standard scales that cover most of the lattice structure. For these, we provide textual explanation templates, which can be applied to any occurrence of a scale in any data domain. These templates are derived using principles from human-computer interaction and allow for a comprehensive textual explanation of lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.
@inproceedings{10.1007/978-3-031-40960-8_12,
abstract = {Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales. We show the computational complexity of identifying a small number of standard scales that cover most of the lattice structure. For these, we provide textual explanation templates, which can be applied to any occurrence of a scale in any data domain. These templates are derived using principles from human-computer interaction and allow for a comprehensive textual explanation of lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.},
address = {Cham},
author = {Hirth, Johannes and Horn, Viktoria and Stumme, Gerd and Hanika, Tom},
booktitle = {Graph-Based Representation and Reasoning},
editor = {Ojeda-Aciego, Manuel and Sauerwald, Kai and Jäschke, Robert},
keywords = {itegpub},
pages = {138--152},
publisher = {Springer Nature Switzerland},
title = {Automatic Textual Explanations of Concept Lattices},
year = 2023
}%0 Conference Paper
%1 10.1007/978-3-031-40960-8_12
%A Hirth, Johannes
%A Horn, Viktoria
%A Stumme, Gerd
%A Hanika, Tom
%B Graph-Based Representation and Reasoning
%C Cham
%D 2023
%E Ojeda-Aciego, Manuel
%E Sauerwald, Kai
%E Jäschke, Robert
%I Springer Nature Switzerland
%P 138--152
%T Automatic Textual Explanations of Concept Lattices
%X Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales. We show the computational complexity of identifying a small number of standard scales that cover most of the lattice structure. For these, we provide textual explanation templates, which can be applied to any occurrence of a scale in any data domain. These templates are derived using principles from human-computer interaction and allow for a comprehensive textual explanation of lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard scales.
%@ 978-3-031-40960-8 - 1.Stubbemann, M., Stumme, G.: The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks. In: Machine Learning and Knowledge Discovery in Databases: Research Track - European Conference, {ECML} {PKDD} 2023, Turin, Italy, September 18-22, 2023, Proceedings, Part {III}. pp. 177–192. Springer (2023). https://doi.org/10.1007/978-3-031-43418-1\_11.
@inproceedings{DBLP:conf/pkdd/StubbemannS23,
author = {Stubbemann, Maximilian and Stumme, Gerd},
booktitle = {Machine Learning and Knowledge Discovery in Databases: Research Track - European Conference, {ECML} {PKDD} 2023, Turin, Italy, September 18-22, 2023, Proceedings, Part {III}},
keywords = {itegpub},
pages = {177--192},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks},
volume = 14171,
year = 2023
}%0 Conference Paper
%1 DBLP:conf/pkdd/StubbemannS23
%A Stubbemann, Maximilian
%A Stumme, Gerd
%B Machine Learning and Knowledge Discovery in Databases: Research Track - European Conference, {ECML} {PKDD} 2023, Turin, Italy, September 18-22, 2023, Proceedings, Part {III}
%D 2023
%I Springer
%P 177--192
%R 10.1007/978-3-031-43418-1\_11
%T The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks
%U https://doi.org/10.1007/978-3-031-43418-1_11
%V 14171
2022
- 1.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). https://doi.org/10.1007/978-3-031-16663-1_5.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 = {itegpub},
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 - 1.Hanika, T., Schneider, F.M., Stumme, G.: {Intrinsic dimension of geometric data sets}. Tohoku Mathematical Journal. 74, 23–52 (2022). https://doi.org/10.2748/tmj.20201015a.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 = {itegpub},
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. - 1.Dürrschnabel, D., Hanika, T., Stumme, G.: Discovering Locally Maximal Bipartite Subgraphs, http://arxiv.org/abs/2211.10446, (2022).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 = {itegpub},
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 - 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).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 = {itegpub},
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 - 1.Schäfermeier, B., Stumme, G., Hanika, T.: Mapping Research Trajectories, https://arxiv.org/abs/2204.11859, (2022). https://doi.org/10.48550/ARXIV.2204.11859.
@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
2021
- 1.Koyda, M., Stumme, G.: Boolean Substructures in Formal Concept Analysis. In: ICFCA: International Conference on Formal Concept Analysis. pp. 38–53. Springer (2021).
@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 = {itegpub},
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 - 1.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).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 = {itegpub},
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 - 1.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). https://doi.org/10.1007/978-3-030-77867-5_11.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 = {itegpub},
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 - 1.Dürrschnabel, D., Stumme, G.: Force-Directed Layout of Order Diagrams using Dimensional Reduction, http://arxiv.org/abs/2102.02684, (2021).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 = {Graph_Drawing},
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. - 1.Stubbemann, M., Stumme, G.: LG4AV: Combining Language Models and Graph Neural Networks for Author Verification. (2021).
@article{stubbemann2021lg4av,
author = {Stubbemann, Maximilian and Stumme, Gerd},
keywords = {itegpub},
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 - 1.Schaefermeier, B., Stumme, G., Hanika, T.: Topological Indoor Mapping through WiFi Signals. (2021).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 = {itegpub},
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. - 1.Stubbemann, M., Stumme, G.: The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks. arXiv preprint arXiv:2110.13774. (2021).
@article{stubbemann2021mont,
author = {Stubbemann, Maximilian and Stumme, Gerd},
journal = {arXiv preprint arXiv:2110.13774},
keywords = {itegpub},
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 - 1.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).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 = {itegpub},
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 - 1.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). https://doi.org/https://doi.org/10.1007/s11192-021-03922-1.
@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 = {itegpub},
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 - 1.Schaefermeier, B., Stumme, G., Hanika, T.: Topic space trajectories. Scientometrics. 126, 5759–5795 (2021). https://doi.org/10.1007/s11192-021-03931-0.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 = {itegpub},
month = {05},
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. - 1.Draude, C., Gruhl, C., Hornung, G., Kropf, J., Lamla, J., Leimeister, J.M., Sick, B., Stumme, G.: Social Machines. Informatik Spektrum. (2021). https://doi.org/10.1007/s00287-021-01421-4.
@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 = {itegpub},
month = 11,
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
- 1.Hanika, T., Schneider, F.M., Stumme, G.: Intrinsic Dimension of Geometric Data Sets. Accepted for publication in: Tohoku Mathematical Journal. (2020).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 = {itegpub},
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. - 1.Felde, M., Hanika, T., Stumme, G.: Null Models for Formal Contexts. Information. 11, 135 (2020).
@article{felde2020null,
author = {Felde, Maximilian and Hanika, Tom and Stumme, Gerd},
journal = {Information},
keywords = {itegpub},
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 - 1.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).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 = {itegpub},
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 - 1.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). https://doi.org/10.1007/978-3-030-44584-3\_39.
@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 = {itegpub},
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 - 1.Schäfermeier, B., Stumme, G., Hanika, T.: Topic Space Trajectories: A case study on machine learning literature, http://arxiv.org/abs/2010.12294, (2020).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 = {itegpub},
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.
2019
- 1.Dürrschnabel, D., Hanika, T., Stumme, G.: Drawing Order Diagrams Through Two-Dimension Extension, http://arxiv.org/abs/1906.06208, (2019).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 = {itegpub},
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. - 1.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).
@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 = {itegpub},
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 - 1.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).
@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 = {itegpub},
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 - 1.Felde, M., Stumme, G.: Interactive Collaborative Exploration using Incomplete Contexts, https://arxiv.org/abs/1908.08740, (2019).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 = {itegpub},
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. - 1.Dürrschnabel, D., Hanika, T., Stumme, G.: Drawing Order Diagrams Through Two-Dimension Extension. CoRR. abs/1906.06208, (2019).
@article{journals/corr/abs-1906-06208,
author = {Dürrschnabel, Dominik and Hanika, Tom and Stumme, Gerd},
journal = {CoRR},
keywords = {linear_extension},
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 - 1.Stubbemann, M., Hanika, T., Stumme, G.: Orometric Methods in Bounded Metric Data. CoRR. abs/1907.09239, (2019).
@article{journals/corr/abs-1907-09239,
author = {Stubbemann, Maximilian and Hanika, Tom and Stumme, Gerd},
journal = {CoRR},
keywords = {itegpub},
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 - 1.Hanika, T., Marx, M., Stumme, G.: Discovering Implicational Knowledge in Wikidata, http://arxiv.org/abs/1902.00916, (2019).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 = {itegpub},
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. - 1.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).
@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 = {itegpub},
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 - 1.Schäfermeier, B., Hanika, T., Stumme, G.: Distances for WiFi Based Topological Indoor Mapping. In: 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous), November 12--14, 2019, Houston, TX, USA (2019). https://doi.org/10.1145/3360774.3360780.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 = {itegpub},
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 - 1.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).
@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 = {itegpub},
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 - 1.Schaefermeier, B., Hanika, T., Stumme, G.: Distances for wifi based topological indoor mapping. In: Proceedings of the 16th {EAI} International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services. {ACM} (2019). https://doi.org/10.1145/3360774.3360780.
@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 = {ordinal},
month = 11,
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 - 1.Kibanov, M., Heiberger, R.H., R{ö}dder, S., Atzmueller, M., Stumme, G.: Social studies of scholarly life with sensor-based ethnographic observations. Scientometrics. (2019). https://doi.org/10.1007/s11192-019-03097-w.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 = {homophily},
month = {05},
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.
2018
- 1.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).
@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 = {itegpub},
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 - 1.Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Analyzing Group Interaction on Networks of Face-to-Face Proximity using Wearable Sensors}. In: Proc. IEEE International Conference on Future IoT Technologies. IEEE Press, Boston, MA, USA (2018).
@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 = {behavior},
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 - 1.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).
@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 = {itegpub},
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 - 1.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). https://doi.org/10.1007/978-3-319-90092-6_9.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 = {itegpub},
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 - 1.Kibanov, M., Becker, M., Müller, J., Atzmueller, M., Hotho, A., Stumme, G.: {Adaptive kNN Using Expected Accuracy for Classification of Geo-Spatial Data}. In: Proc. 33rd ACM Symposium On Applied Computing. ACM Press, New York, NY, USA (2018).
@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 = {classification},
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} - 1.Hanika, T., Koyda, M., Stumme, G.: Relevant Attributes in Formal Contexts. CoRR. abs/1812.08868, (2018).
@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 - 1.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). https://doi.org/10.4236/psych.2018.94040.
@article{thiele2018frequent,
author = {Thiele, Lisa and Atzmueller, Martin and Stumme, Gerd and Kauffeld, Simone},
journal = {Psychology},
keywords = {itegpub},
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 - 1.Doerfel, S., Hanika, T., Stumme, G.: Clones in Social Networks. CoRR. abs/1802.07849, (2018).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 = {itegpub},
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. - 1.Schäfermeier, B., Hanika, T., Stumme, G.: Distances for WiFi Based Topological Indoor Mapping, http://arxiv.org/abs/1809.07405, (2018).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 = {itegpub},
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. - 1.Hanika, T., Schneider, F.M., Stumme, G.: Intrinsic Dimension of Geometric Data Sets, http://arxiv.org/abs/1801.07985, (2018).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 = {itegpub},
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. - 1.Hanika, T., Schneider, F.M., Stumme, G.: Intrinsic dimension of concept lattices. CoRR. abs/1801.07985, (2018).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 = {dimension},
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. - 1.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).
@article{TASK:18,
author = {Thiele, Lisa and Atzmueller, Martin and Stumme, Gerd and Kauffeld, Simone},
journal = {Psychology},
keywords = {face-to-face},
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}
2017
- 1.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). https://doi.org/10.1007/s13278-017-0446-1.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 = 2017,
month = {07},
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. - 1.Mueller, J., Stumme, G.: Predicting Rising Follower Counts on Twitter Using Profile Information. In: 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). https://doi.org/10.1145/3091478.3091490.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 = {KDE},
month = {06},
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 - 1.Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Contact Patterns, Group Interaction and Dynamics on Socio-Behavioral Multiplex Networks}. In: Proc. Annual Machine Learning Conference of the Benelux (Benelearn 2017). Eindhoven University of Technology, Eindhoven, The Netherlands (2017).
@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 = {contacts},
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 - 1.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).
@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
2016
- 1.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).
@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 = {big},
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 - 1.Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Analyzing Group Interaction and Dynamics on Socio-Behavioral Networks of Face-to-Face Proximity}. In: Proc. ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication. ACM Press, New York, NY, USA (2016).
@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 = {behavior},
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 - 1.Atzmueller, M., Ernst, A., Krebs, F., Scholz, C., Stumme, G.: {Formation and Temporal Evolution of Social Groups During Coffee Breaks}. In: Postproceedings of the International Workshops MUSE & SenseML 2014, Nancy, France, and MSM 2014, Seoul, Korea. Springer Verlag, Heidelberg, Germany (2016).
@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 = {group},
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 - 1.Atzmueller, M., Hanika, T., Stumme, G., Schaller, R., Ludwig, B.: {Social Event Network Analysis: Structure, Preferences, and Reality}. In: Proc. IEEE/ACM ASONAM. IEEE Press, Boston, MA, USA (2016).
@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 = {spatial},
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 - 1.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).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 = {02},
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. - 1.Mueller, J., Stumme, G.: Gender Inference using Statistical Name Characteristics in Twitter. In: 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). https://doi.org/10.1145/2955129.2955182.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 = {arXiv},
month = {08},
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 - 1.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). https://doi.org/http://dx.doi.org/10.1016/j.joi.2016.03.005.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 = {posted},
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
- 1.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).
@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 = {face-to-face},
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/ - 1.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).
@article{doerfel2015cores,
author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd},
journal = {Transactions on Intelligent Systems and Technology},
keywords = {benchmark},
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 - 1.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. In: 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).
@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 = {mark},
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 - 1.Schmidt, A., Atzmueller, M., Stumme, G.: The FEE Project: Introduction and First Insights. In: Proc. UIS Workshop (2015).
@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 - 1.Atzmueller, M., Kibanov, M., Scholz, C., Mueller, J., Stumme, G.: {Conferator – A Ubiquitous System for Enhancing Social Networking at Conferences}. In: Proc. UIS Workshop (2015).
@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 - 1.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}. In: Proc. ASONAM. IEEE Press, Boston, MA, USA (2015).
@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 = {sociopatterns},
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 - 1.Zoller, D., Doerfel, S., Jäschke, R., Stumme, G., Hotho, A.: On Publication Usage in a Social Bookmarking System. In: Proceedings of the 2015 ACM Conference on Web Science. pp. 67:1–67:2. ACM, Oxford, United Kingdom (2015). https://doi.org/10.1145/2786451.2786927.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 = {bookmarking},
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 - 1.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).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 = {pollution},
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. - 1.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). https://doi.org/10.1371/journal.pone.0136763.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 = {itegpub},
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.
2014
- 1.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).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 - 1.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).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 = {itegpub},
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. - 1.Scholz, C., Macek, B.-E., Atzmueller, M., Doerfel, S., Stumme, G.: {Socio-technical Design of Ubiquitous Computing Systems}. Presented at the , Heidelberg, Germany (2014).
@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 = 2014,
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} - 1.Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: On the Predictability of Talk Attendance at Academic Conferences. CoRR. abs/1407.0613, (2014).
@article{DBLP:journals/corr/SIAS_Arxiv14,
author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
journal = {CoRR},
keywords = {itegpub},
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 - 1.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).
@article{DBLP:journals/chinaf/KASS14,
author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
journal = {SCIENCE CHINA Information Sciences},
keywords = {itegpub},
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 - 1.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).
@article{SAS:14c,
author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
journal = {Journal of Social Network Analysis and Mining},
keywords = {itegpub},
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 - 1.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). https://doi.org/10.1080/13614568.2013.873488.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 = {applications},
month = {03},
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. - 1.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).
@article{SAS:14c,
author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
journal = {Journal of Social Network Analysis and Mining},
keywords = {itegpub},
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 - 1.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).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 = {everyaware},
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. - 1.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).
@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 = {itegpub},
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 - 1.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}. In: Proc. Measuring Behavior. , Wageningen, The Netherlands (2014).
@inproceedings{TAKS:14,
address = {Wageningen, The Netherlands},
author = {Thiele, Lisa and Atzmueller, Martin and Kauffeld, Simone and Stumme, Gerd},
booktitle = {Proc. Measuring Behavior},
keywords = {itegpub},
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} - 1.Macek, B.-E., Atzmueller, M., Stumme, G.: {Predicting the Stability of User Interaction Ties in Twitter}. In: Proc. I-KNOW 2014. ACM Press, New York, NY, USA (2014).
@inproceedings{MAS:14,
address = {New York, NY, USA},
author = {Macek, Bjoern-Elmar and Atzmueller, Martin and Stumme, Gerd},
booktitle = {Proc. I-KNOW 2014},
keywords = {analysis},
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} - 1.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).
@article{KASS:14,
author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
journal = {Science China},
keywords = {itegpub},
month = {03},
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 - 1.Scholz, C., Atzmueller, M., Stumme, G.: Unsupervised and Hybrid Approaches for On-Line RFID Localization with Mixed Context Knowledge. In: ISMIS (2014).
@inproceedings{DBLP:conf/ismis/SAS14,
author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
booktitle = {ISMIS},
keywords = {itegpub},
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 - 1.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). https://doi.org/10.1080/13614568.2013.873488.
@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 = {itegpub},
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 - 1.Mitzlaff, F., Atzmueller, M., Hotho, A., Stumme, G.: {The Social Distributional Hypothesis}. Journal of Social Network Analysis and Mining. 4, (2014).
@article{MAHS:14,
author = {Mitzlaff, Folke and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},
journal = {Journal of Social Network Analysis and Mining},
keywords = {itegpub},
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 - 1.Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences}. In: Proc. 25th ACM Conference on Hypertext and Social Media. ACM Press, New York, NY, USA (2014).
@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 = {itegpub},
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} - 1.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). https://doi.org/10.1007/978-3-319-05044-7_15.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 = {itegpub},
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 - 1.Scholz, C., Atzmueller, M., Stumme, G.: {On the Predictability of Recurring Links in Networks of Face-to-Face Proximity}. In: Proc. WWW 2014 (Companion). IW3C2 / ACM (2014).
@inproceedings{SAS:14a,
author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
booktitle = {Proc. WWW 2014 (Companion)},
keywords = {itegpub},
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} - 1.Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: On the Predictability of Talk Attendance at Academic Conferences. In: 25th ACM Conference on Hypertext and Social Media (to appear). ACM, Santiago, Chile, September 1-4 (2014).
@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 = {itegpub},
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 - 1.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).
@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 = {itegpub},
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 - 1.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). https://doi.org/10.1080/13614568.2013.873488.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 = {itegpub},
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. - 1.Atzmueller, M., Thiele, L., Stumme, G., Kauffeld, S.: {Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity}. In: Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK. , London, UK (2014).
@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 = {itegpub},
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} - 1.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).
@article{DBLP:journals/corr/SAS_Arxiv14,
author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
journal = {CoRR},
keywords = {itegpub},
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 - 1.Atzmueller, M., Ernst, A., Krebs, F., Scholz, C., Stumme, G.: {On the Evolution of Social Groups During Coffee Breaks}. In: Proc. WWW 2014 (Companion). IW3C2 / ACM (2014).
@inproceedings{AEKSS:14,
author = {Atzmueller, Martin and Ernst, Andreas and Krebs, Friedrich and Scholz, Christoph and Stumme, Gerd},
booktitle = {Proc. WWW 2014 (Companion)},
keywords = {itegpub},
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} - 1.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). https://doi.org/10.1007/978-3-319-05044-7_7.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 = {itegpub},
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 - 1.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).
@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 = {itegpub},
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} - 1.Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract)}. In: Proc. LWA 2014 (KDML Special Track). RTWH Aachen University, Aachen, Germany (2014).
@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 - 1.Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences (Extended Version)}. CoRR. abs/1407.0613, (2014).
@article{SIAS:14c,
author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
journal = {CoRR},
keywords = {itegpub},
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 - 1.Scholz, C., Illig, J., Atzmueller, M., Stumme, G.: {On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)}. In: Proc. LWA 2014 (KDML Special Track). RTWH Aachen University, Aachen, Germany (2014).
@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 = {itegpub},
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)} - 1.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). https://doi.org/10.1007/s13278-014-0216-2.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 = {itegpub},
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
2013
- 1.Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks. In: ASONAM (2013).
@inproceedings{scholz2013people,
author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
booktitle = {ASONAM},
keywords = {itegpub},
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 - 1.Atzmueller, M., Kibanov, M., Scholz, C., Stumme, G.: Conferator - a Social System for Conference and Contact Management, (2013).
@misc{atzmueller2013conferator,
author = {Atzmueller, Martin and Kibanov, Mark and Scholz, Christoph and Stumme, Gerd},
howpublished = {INFORMATIK 2013, Poster},
keywords = {itegpub},
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 - 1.Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract, Resubmission)}. In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).
@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 = {itegpub},
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)} - 1.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).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 = {itegpub},
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. - 1.Mueller, J., Doerfel, S., Becker, M., Hotho, A., Stumme, G.: Tag Recommendations for SensorFolkSonomies. In: 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).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 = {iteg},
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. - 1.Mueller, J., Doerfel, S., Becker, M., Hotho, A., Stumme, G.: Tag Recommendations for SensorFolkSonomies. In: 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).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 = {itegpub},
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. - 1.Atzmueller, M., Kibanov, M., Scholz, C., Stumme, G.: {Conferator - a Social System for Conference and Contact Management}, (2013).
@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 = {itegpub},
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} - 1.Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: {On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity}. In: Proc. IEEE CPSCom 2013. IEEE Computer Society, Boston, MA, USA (2013).
@inproceedings{kibanov2013evolution,
address = {Boston, MA, USA},
author = {Kibanov, Mark and Atzmueller, Martin and Scholz, Christoph and Stumme, Gerd},
booktitle = {Proc. IEEE CPSCom 2013},
keywords = {iteg},
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} - 1.Mitzlaff, F., Stumme, G.: Onomastics 2.0 - The Power of Social Co-Occurrences, http://arxiv.org/abs/1303.0484, (2013).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 = {nameling},
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. - 1.Mitzlaff, F., Stumme, G.: Recommending Given Names, http://arxiv.org/abs/1302.4412, (2013).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 = {nameling},
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. - 1.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).
@book{doerfel2013informationelle,
author = {Doerfel, Stephan and Hotho, Andreas and Kartal-Aydemir, Aliye and Roßnagel, Alexander and Stumme, Gerd},
keywords = {itegpub},
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 - 1.Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: {On the Semantics of User Interaction in Social Media (Extended Abstract)}. In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).
@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 = {itegpub},
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 - 1.Scholz, {Christoph, Atzmueller, M., Barrat, A., Cattuto, C., Gerd Stumme}: {New Insights and Methods For Predicting Face-To-Face Contacts}. In: Proc. 7th Intl. AAAI Conference on Weblogs and Social Media. AAAI Press, Palo Alto, CA, USA (2013).
@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 = {iteg},
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} - 1.Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: {Evolution of Contacts and Communities in Networks of Face-to-Face Proximity (Extended Abstract)}. In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2013).
@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 = {itegpub},
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 - 1.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).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. - 1.Becker, M., Mueller, J., Hotho, A., Stumme, G.: A Generic Platform for Ubiquitous and Subjective Data. In: 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). https://doi.org/10.1145/2494091.2499776.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 = {itegpub},
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. - 1.Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: {User-Relatedness and Community Structure in Social Interaction Networks}. CoRR/abs. 1309.3888, (2013).
@article{mitzlaff2013userrelatedness,
author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
journal = {CoRR/abs},
keywords = {itegpub},
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 - 1.Kibanov, M., Atzmueller, M., Scholz, C., Stumme, G.: On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity. In: Cyber, Physical and Social Computing (CPSCom), 2013 IEEE International Conference on. IEEE Computer Society, Los Alamitos, CA, USA (2013).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 = {itegpub},
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. - 1.Doerfel, S., Jäschke, R.: An Analysis of Tag-Recommender Evaluation Procedures. In: Proceedings of the 7th ACM conference on Recommender systems. pp. 343–346. ACM, Hong Kong, China (2013). https://doi.org/10.1145/2507157.2507222.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 = {itegpub},
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 - 1.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).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 = {itegpub},
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. - 1.Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: {How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks}. In: Proc. ASONAM 2013. ACM Press, New York, NY, USA (2013).
@inproceedings{scholz2013people,
address = {New York, NY, USA},
author = {Scholz, Christoph and Atzmueller, Martin and Kibanov, Mark and Stumme, Gerd},
booktitle = {Proc. ASONAM 2013},
keywords = {face-to-face},
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} - 1.Scholz, C., Atzmueller, M., Kibanov, M., Stumme, G.: How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks. In: Advances in Social Networks Analysis and Mining (ASONAM), 2013 International Conference on. , Los Alamitos, CA, USA (2013).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 = {itegpub},
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. - 1.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). https://doi.org/10.1007/978-3-642-36844-8_2.
@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 = {itegpub},
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
2012
- 1.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).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 = {itegpub},
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. - 1.Mitzlaff, F., Stumme, G.: Relatedness of Given Names. Human Journal. 1, 205–217 (2012).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 = {nameling},
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. - 1.Scholz, C., Atzmueller, M., Stumme, G.: On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties. In: 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). https://doi.org/10.1109/SocialCom-PASSAT.2012.49.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 = {contacts},
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 - 1.Behrenbruch, K., Atzmueller, M., Evers, C., Schmidt, L., Stumme, G., Geihs, K.: {A Personality Based Design Approach Using Subgroup Discovery}. In: Human-Centred Software Engineering. pp. 259–266. Springer, Heidelberg, Germany (2012).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 = {itegpub},
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. - 1.Macek, B.E., Scholz, C., Atzmueller, M., Stumme, G.: Anatomy of a Conference. In: 23rd ACM Conference on Hypertext and Social Media, HT ’12. pp. 245–254. ACM, Milwaukee, WI, USA, June 25-28, 2012 (2012).
@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 = {itegpub},
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 - 1.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. In: IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2012, Besançon, France, 20-23 November, 2012. IEEE, Washington, DC, USA (2012).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 = {physical},
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. - 1.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).
@article{journals/insk/KrauseLHRS12,
author = {Krause, Beate and Lerch, Hana and Hotho, Andreas and Roßnagel, Alexander and Stumme, Gerd},
journal = {Informatik Spektrum},
keywords = {itegpub},
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 - 1.Scholz, C., Atzmueller, M., Stumme, G.: {Analyzing the Predictability of Human Contacts: On Influence Factors and Stronger Ties (Extended Abstract)}. In: Proc. LWA 2012 (KDML Special Track). University of Dortmund, Dortmund, Germany (2012).
@inproceedings{SAS:12b,
address = {Dortmund, Germany.},
author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
booktitle = {Proc. LWA 2012 (KDML Special Track)},
keywords = {itegpub},
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 - 1.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).
@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 = {itegpub},
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 - 1.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).
@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 = {nameling},
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 - 1.Scholz, C., Atzmueller, M., Stumme, G.: {On the Predictability of Human Contacts: Influence Factors and the Strength of Stronger Ties}. In: Proc. Fourth ASE/IEEE International Conference on Social Computing (SocialCom). IEEE Computer Society, Boston, MA, USA (2012).
@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 = {socialnetworks},
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 - 1.Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: Face-to-Face Contacts at a Conference: Dynamics of Communities and Roles. In: {Modeling and Mining Ubiquitous Social Media}. Springer Verlag, Heidelberg, Germany (2012).
@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 = {contacts},
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 - 1.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). https://doi.org/10.1007/978-1-4614-1894-8.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 = {bookmarking},
month = {02},
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 - 1.Doerfel, S., Jäschke, R., Hotho, A., Stumme, G.: Leveraging Publication Metadata and Social Data into FolkRank for Scientific Publication Recommendation. In: Proceedings of the 4th ACM RecSys workshop on Recommender systems and the social web. pp. 9–16. ACM, Dublin, Ireland (2012). https://doi.org/10.1145/2365934.2365937.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 = {bookmarking},
month = {09},
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 - 1.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. In: 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).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 = 2012,
month = 11,
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. - 1.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). https://doi.org/10.1007/978-3-642-25694-3_3.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 = {bookmarking},
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
2011
- 1.Benz, D., Körner, C., Hotho, A., Stumme, G., Strohmaier, M.: One Tag to Bind Them All: Measuring Term Abstractness in Social Metadata. In: Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).
@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 = {itegpub},
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 - 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). https://doi.org/10.1524/itit.2011.0631.
@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 = {conferences},
month = {05},
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 - 1.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). https://doi.org/10.1007/978-0-387-85820-3_19.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 = {itegpub},
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 - 1.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).
@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 = {itegpub},
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 - 1.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).
@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 = 2011,
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 - 1.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. In: GfA-Frühjahrskongress. , Chemnitz (2011).
@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 = {itegpub},
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 - 1.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). https://doi.org/10.1524/itit.2011.0631.
@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 = {conferator},
month = {05},
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 - 1.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).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 = {itegpub},
month = {05},
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. - 1.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).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 = {summer},
month = {05},
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. - 1.Scholz, C., Doerfel, S., Atzmueller, M., Hotho, A., Stumme, G.: Resource-Aware On-Line RFID Localization Using Proximity Data. In: Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).
@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 = {itegpub},
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 - 1.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).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 = {itegpub},
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. - 1.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). https://doi.org/10.1007/978-3-642-22140-8_9.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 = {content},
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 - 1.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).
@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 = {COMMUNE},
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 - 1.Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players. In: Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML/PKDD 2011 (2011).
@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 = {itegpub},
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 - 1.Mitzlaff, F., Atzmueller, M., Stumme, G., Hotho, A.: {On the Semantics of User Interaction in Social Media (Extended Abstract, Resubmission)}. In: Proc. LWA 2013 (KDML Special Track). University of Bamberg, Bamberg, Germany (2011).
@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 = {itegpub},
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)} - 1.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).
@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 = {bookmarking},
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 - 1.{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).
@proceedings{bjrnelmarmacek2011profile,
address = {Boston, MA, USA},
author = {{Björn-Elmar Macek, Martin Atzmueller, Gerd Stumme}},
keywords = {CVS},
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 - 1.Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: Structure and Consistency: Assessment of Social Bookmarking Communities. In: Proceedings from Sunbelt XXXI. , Trade Winds Beach Resort (2011).
@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 = 2011,
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 - 1.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). https://doi.org/10.1007/978-3-642-23599-3_5.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 = {COMMUNE},
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 - 1.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).
@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 = 2011,
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 - 1.Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: {Community Assessment using Evidence Networks}. In: Analysis of Social Media and Ubiquitous Data (2011).
@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 = {itegpub},
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 - 1.Bullock, B.N., Lerch, H., Ro\ssnagel, A., Hotho, A., Stumme, G.: Privacy-aware spam detection in social bookmarking systems. In: Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies. pp. 15:1–15:8. ACM, Graz, Austria (2011). https://doi.org/10.1145/2024288.2024306.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 = {spam},
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 - 1.Atzmueller, M., Doerfel, S., Hotho, A., Mitzlaff, F., Stumme, G.: Face-to-Face Contacts during LWA 2010 - Communities, Roles, and Key Players. In: Working Notes of the LWA 2011 - Learning, Knowledge, Adaptation (2011).
@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 = {contacts},
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
2010
- 1.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. In: Proceedings of the 2nd Web Science Conference (WebSci10). , Raleigh, NC, USA (2010).
@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 = {ontologies},
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 - 1.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. In: Proceedings of the 21st ACM conference on Hypertext and hypermedia. , Toronto, Canada (2010).
@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 = {itegpub},
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 - 1.Benz, D., Hotho, A., Jäschke, R., Krause, B., Stumme, G.: Query Logs as Folksonomies. Datenbank-Spektrum. 10, 15–24 (2010).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 = {itegpub},
month = {06},
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. - 1.Körner, C., Benz, D., Strohmaier, M., Hotho, A., Stumme, G.: Stop Thinking, start Tagging - Tag Semantics emerge from Collaborative Verbosity. In: Proceedings of the 19th International World Wide Web Conference (WWW 2010). ACM, Raleigh, NC, USA (2010).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 = {bibsonomy},
month = {04},
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. - 1.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).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 = {itegpub},
month = {02},
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. - 1.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).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 = {social-bookmarking},
month = {02},
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. - 1.Körner, C., Benz, D., Hotho, A., Strohmaier, M., Stumme, G.: Social Bookmarking Systems: Verbosity Improves Semantics. In: Proceedings of INSNA Sunbelt XXX. , Riva del Garda Fierecongressi, Trento, Italy (2010).
@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 = 2010,
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 - 1.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).
@book{ABHS:10,
editor = {Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
keywords = {itegpub},
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} - 1.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).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 = {itegpub},
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. - 1.Mitzlaff, F., Atzmueller, M., Benz, D., Hotho, A., Stumme, G.: Community Assessment using Evidence Networks. In: Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010). , Barcelona, Spain (2010).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 = {itegpub},
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. - 1.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). https://doi.org/10.1007/s00778-010-0208-4.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 = {itegpub},
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. - 1.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).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 = {bookmarking},
month = {02},
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. - 1.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. In: Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries. pp. 417–420 (2010).
@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 = {publikationswesen},
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/ - 1.Benz, D., Hotho, A., Stumme, G.: Semantics made by you and me: Self-emerging ontologies can capture the diversity of shared knowledge. In: Proceedings of the 2nd Web Science Conference (WebSci10). , Raleigh, NC, USA (2010).
@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 = {ontology},
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 - 1.Mitzlaff, F., Atzmüller, M., Benz, D., Hotho, A., Stumme, G.: Community Assessment using Evidence Networks. In: Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010). , Barcelona, Spain (2010).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 = {itegpub},
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. - 1.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). https://doi.org/10.1007/s00287-010-0485-8.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 = {itegpub},
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. - 1.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). https://doi.org/10.1007/s00778-010-0208-4.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 = {itegpub},
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. - 1.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. In: Proceedings of the 14. European Conference on Research and Advanced Technology for Digital Libraries. pp. 417–420 (2010). https://doi.org/10.1007.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 = {Publication},
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 - 1.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).
@article{lerch2010datenschutz,
author = {Lerch, Hana and Krause, Beate and Hotho, Andreas and Roßnagel, Alexander and Stumme, Gerd},
journal = {MultiMedia und Recht},
keywords = {itegpub},
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 - 1.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). https://doi.org/DOI: 10.1016/j.websem.2010.04.008.
@article{berendt2010bridging,
author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd},
journal = {Web Semantics: Science, Services and Agents on the World Wide Web},
keywords = {itegpub},
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
2009
- 1.Markines, B., Cattuto, C., Menczer, F., Benz, D., Hotho, A., Stumme, G.: Evaluating Similarity Measures for Emergent Semantics of Social Tagging. In: 18th International World Wide Web Conference. pp. 641–650 (2009).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 = {social_similarity},
month = {04},
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. - 1.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). https://doi.org/10.1007/978-3-540-72216-8.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 = {itegpub},
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 - 1.Benz, D., Krause, B., Kumar, G.P., Hotho, A., Stumme, G.: Characterizing Semantic Relatedness of Search Query Terms. In: Proceedings of the 1st Workshop on Explorative Analytics of Information Networks (EIN2009). , Bled, Slovenia (2009).
@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 = {pkdd},
month = {09},
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 - 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). https://doi.org/10.1145/1557914.1557969.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 = {bibsonomy},
month = {06},
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 - 1.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).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 = {pkdd},
month = {09},
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.
2008
- 1.Krause, B., Jäschke, R., Hotho, A., Stumme, G.: Logsonomy - Social Information Retrieval with Logdata. In: HT ’08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia. pp. 157–166. ACM, Pittsburgh, PA, USA (2008). https://doi.org/http://doi.acm.org/10.1145/1379092.1379123.Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today’s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.
@inproceedings{krause2008logsonomy,
abstract = {Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today’s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.},
address = {New York, NY, USA},
author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd},
booktitle = {HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia},
keywords = {information},
pages = {157--166},
publisher = {ACM},
title = {Logsonomy - Social Information Retrieval with Logdata},
year = 2008
}%0 Conference Paper
%1 krause2008logsonomy
%A Krause, Beate
%A Jäschke, Robert
%A Hotho, Andreas
%A Stumme, Gerd
%B HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia
%C New York, NY, USA
%D 2008
%I ACM
%P 157--166
%R http://doi.acm.org/10.1145/1379092.1379123
%T Logsonomy - Social Information Retrieval with Logdata
%U http://portal.acm.org/citation.cfm?id=1379092.1379123&coll=ACM&dl=ACM&type=series&idx=SERIES399&part=series&WantType=Journals&title=Proceedings%20of%20the%20nineteenth%20ACM%20conference%20on%20Hypertext%20and%20hypermedia
%X Social bookmarking systems constitute an established part of the Web 2.0. In such systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Today’s search engines represent the gateway to retrieve information from the World Wide Web. Short queries typically consisting of two to three words describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. This clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. The resulting network structure, which we will term logsonomy is very similar to the one of folksonomies. In order to find out about its properties, we analyze the topological characteristics of the tripartite hypergraph of queries, users and bookmarks on a large snapshot of del.icio.us and on query logs of two large search engines. All of the three datasets show small world properties. The tagging behavior of users, which is explained by preferential attachment of the tags in social bookmark systems, is reflected in the distribution of single query words in search engines. We can conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of social bookmarking users is driven by similar dynamics.
%@ 978-1-59593-985-2 - 1.Krause, B., Hotho, A., Stumme, G.: A Comparison of Social Bookmarking with Traditional Search. In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., and White, R.W. (eds.) Advances in Information Retrieval, 30th European Conference on IR Research, ECIR 2008. pp. 101–113. Springer, Heidelberg (2008).Social bookmarking systems allow users to store links to internet resources on a web page. As social bookmarking systems are growing in popularity, search algorithms have been developed that transfer the idea of link-based rankings in the Web to a social bookmarking system’s data structure. These rankings differ from traditional search engine rankings in that they incorporate the rating of users. In this study, we compare search in social bookmarking systems with traditionalWeb search. In the first part, we compare the user activity and behaviour in both kinds of systems, as well as the overlap of the underlying sets of URLs. In the second part,we compare graph-based and vector space rankings for social bookmarking systems with commercial search engine rankings. Our experiments are performed on data of the social bookmarking system Del.icio.us and on rankings and log data from Google, MSN, and AOL. We will show that part of the difference between the systems is due to different behaviour (e. g., the concatenation of multi-word lexems to single terms in Del.icio.us), and that real-world events may trigger similar behaviour in both kinds of systems. We will also show that a graph-based ranking approach on folksonomies yields results that are closer to the rankings of the commercial search engines than vector space retrieval, and that the correlation is high in particular for the domains that are well covered by the social bookmarking system.
@inproceedings{krause2008comparison,
abstract = {Social bookmarking systems allow users to store links to internet resources on a web page. As social bookmarking systems are growing in popularity, search algorithms have been developed that transfer the idea of link-based rankings in the Web to a social bookmarking system’s data structure. These rankings differ from traditional search engine rankings in that they incorporate the rating of users. In this study, we compare search in social bookmarking systems with traditionalWeb search. In the first part, we compare the user activity and behaviour in both kinds of systems, as well as the overlap of the underlying sets of URLs. In the second part,we compare graph-based and vector space rankings for social bookmarking systems with commercial search engine rankings. Our experiments are performed on data of the social bookmarking system Del.icio.us and on rankings and log data from Google, MSN, and AOL. We will show that part of the difference between the systems is due to different behaviour (e. g., the concatenation of multi-word lexems to single terms in Del.icio.us), and that real-world events may trigger similar behaviour in both kinds of systems. We will also show that a graph-based ranking approach on folksonomies yields results that are closer to the rankings of the commercial search engines than vector space retrieval, and that the correlation is high in particular for the domains that are well covered by the social bookmarking system.},
address = {Heidelberg},
author = {Krause, Beate and Hotho, Andreas and Stumme, Gerd},
booktitle = {Advances in Information Retrieval, 30th European Conference on IR Research, ECIR 2008},
editor = {Macdonald, Craig and Ounis, Iadh and Plachouras, Vassilis and Ruthven, Ian and White, Ryen W.},
keywords = {bookmarking},
pages = {101-113},
publisher = {Springer},
series = {LNAI},
title = {A Comparison of Social Bookmarking with Traditional Search},
volume = 4956,
year = 2008
}%0 Conference Paper
%1 krause2008comparison
%A Krause, Beate
%A Hotho, Andreas
%A Stumme, Gerd
%B Advances in Information Retrieval, 30th European Conference on IR Research, ECIR 2008
%C Heidelberg
%D 2008
%E Macdonald, Craig
%E Ounis, Iadh
%E Plachouras, Vassilis
%E Ruthven, Ian
%E White, Ryen W.
%I Springer
%P 101-113
%T A Comparison of Social Bookmarking with Traditional Search
%V 4956
%X Social bookmarking systems allow users to store links to internet resources on a web page. As social bookmarking systems are growing in popularity, search algorithms have been developed that transfer the idea of link-based rankings in the Web to a social bookmarking system’s data structure. These rankings differ from traditional search engine rankings in that they incorporate the rating of users. In this study, we compare search in social bookmarking systems with traditionalWeb search. In the first part, we compare the user activity and behaviour in both kinds of systems, as well as the overlap of the underlying sets of URLs. In the second part,we compare graph-based and vector space rankings for social bookmarking systems with commercial search engine rankings. Our experiments are performed on data of the social bookmarking system Del.icio.us and on rankings and log data from Google, MSN, and AOL. We will show that part of the difference between the systems is due to different behaviour (e. g., the concatenation of multi-word lexems to single terms in Del.icio.us), and that real-world events may trigger similar behaviour in both kinds of systems. We will also show that a graph-based ranking approach on folksonomies yields results that are closer to the rankings of the commercial search engines than vector space retrieval, and that the correlation is high in particular for the domains that are well covered by the social bookmarking system. - 1.Jäschke, R., Marinho, L., Hotho, A., Schmidt-Thieme, L., Stumme, G.: Tag Recommendations in Social Bookmarking Systems. AI Communications. 21, 231–247 (2008). https://doi.org/10.3233/AIC-2008-0438.Collaborative tagging systems allow users to assign keywords - so called "tags" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender.
@article{jaeschke2008tag,
abstract = {Collaborative tagging systems allow users to assign keywords - so called "tags" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender.},
address = {Amsterdam},
author = {Jäschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},
editor = {Giunchiglia, Enrico},
journal = {AI Communications},
keywords = {bookmarking},
number = 4,
pages = {231-247},
publisher = {IOS Press},
title = {Tag Recommendations in Social Bookmarking Systems},
volume = 21,
year = 2008
}%0 Journal Article
%1 jaeschke2008tag
%A Jäschke, Robert
%A Marinho, Leandro
%A Hotho, Andreas
%A Schmidt-Thieme, Lars
%A Stumme, Gerd
%C Amsterdam
%D 2008
%E Giunchiglia, Enrico
%I IOS Press
%J AI Communications
%N 4
%P 231-247
%R 10.3233/AIC-2008-0438
%T Tag Recommendations in Social Bookmarking Systems
%U http://dx.doi.org/10.3233/AIC-2008-0438
%V 21
%X Collaborative tagging systems allow users to assign keywords - so called "tags" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. - 1.Jäschke, R., Krause, B., Hotho, A., Stumme, G.: Logsonomy -- A Search Engine Folksonomy. In: Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008). AAAI Press (2008).In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. The clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. This poster analyzes the topological characteristics of the resulting tripartite hypergraph of queries, users and bookmarks of two query logs and compares it two a snapshot of the folksonomy del.icio.us.
@inproceedings{Jaeschke2008logsonomy,
abstract = {In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. The clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. This poster analyzes the topological characteristics of the resulting tripartite hypergraph of queries, users and bookmarks of two query logs and compares it two a snapshot of the folksonomy del.icio.us.},
author = {Jäschke, Robert and Krause, Beate and Hotho, Andreas and Stumme, Gerd},
booktitle = {Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)},
keywords = {itegpub},
publisher = {AAAI Press},
title = {Logsonomy -- A Search Engine Folksonomy},
year = 2008
}%0 Conference Paper
%1 Jaeschke2008logsonomy
%A Jäschke, Robert
%A Krause, Beate
%A Hotho, Andreas
%A Stumme, Gerd
%B Proceedings of the Second International Conference on Weblogs and Social Media(ICWSM 2008)
%D 2008
%I AAAI Press
%T Logsonomy -- A Search Engine Folksonomy
%U https://www.kde.cs.uni-kassel.de/hotho/pub/2008/Krause2008logsonomy_short.pdf
%X In social bookmarking systems users describe bookmarks by keywords called tags. The structure behind these social systems, called folksonomies, can be viewed as a tripartite hypergraph of user, tag and resource nodes. This underlying network shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Search engines filter the vast information of the web. Queries describe a user’s information need. In response to the displayed results of the search engine, users click on the links of the result page as they expect the answer to be of relevance. The clickdata can be represented as a folksonomy in which queries are descriptions of clicked URLs. This poster analyzes the topological characteristics of the resulting tripartite hypergraph of queries, users and bookmarks of two query logs and compares it two a snapshot of the folksonomy del.icio.us. - 1.Krause, B., Schmitz, C., Hotho, A., Stumme, G.: The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems. In: Proc. of the Fourth International Workshop on Adversarial Information Retrieval on the Web (2008).
@inproceedings{krause2008antisocial,
author = {Krause, Beate and Schmitz, Christoph and Hotho, Andreas and Stumme, Gerd},
booktitle = {Proc. of the Fourth International Workshop on Adversarial Information Retrieval on the Web},
keywords = {bookmarking},
title = {The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems},
year = 2008
}%0 Conference Paper
%1 krause2008antisocial
%A Krause, Beate
%A Schmitz, Christoph
%A Hotho, Andreas
%A Stumme, Gerd
%B Proc. of the Fourth International Workshop on Adversarial Information Retrieval on the Web
%D 2008
%T The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems
%U http://airweb.cse.lehigh.edu/2008/submissions/krause_2008_anti_social_tagger.pdf - 1.Jäschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Discovering Shared Conceptualizations in Folksonomies. Journal of Web Semantics. 6, 38–53 (2008).
@article{jaeschke08discovering,
author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
journal = {Journal of Web Semantics},
keywords = {bibsonomy},
number = 1,
pages = {38-53},
title = {Discovering Shared Conceptualizations in Folksonomies},
volume = 6,
year = 2008
}%0 Journal Article
%1 jaeschke08discovering
%A Jäschke, Robert
%A Hotho, Andreas
%A Schmitz, Christoph
%A Ganter, Bernhard
%A Stumme, Gerd
%D 2008
%J Journal of Web Semantics
%N 1
%P 38-53
%T Discovering Shared Conceptualizations in Folksonomies
%U http://dx.doi.org/10.1016/j.websem.2007.11.004
%V 6 - 1.Cattuto, C., Benz, D., Hotho, A., Stumme, G.: {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}. In: Sheth, A., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., and Thirunarayan, K. (eds.) The Semantic Web - ISWC 2008. pp. 615–631. Springer Berlin / Heidelberg (2008). https://doi.org/10.1007/978-3-540-88564-1\_39.{Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Even though most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptions on the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity in terms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures of tag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding is provided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measures of semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of the investigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}
@incollection{tagging-cattuto,
abstract = {{Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Even though most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptions on the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity in terms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures of tag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding is provided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measures of semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of the investigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}},
author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
booktitle = {The Semantic Web - ISWC 2008},
editor = {Sheth, Amit and Staab, Steffen and Dean, Mike and Paolucci, Massimo and Maynard, Diana and Finin, Timothy and Thirunarayan, Krishnaprasad},
journal = {The Semantic Web - ISWC 2008},
keywords = {grounding},
pages = {615--631},
publisher = {Springer Berlin / Heidelberg},
series = {Lecture Notes in Computer Science},
title = {{Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}},
volume = 5318,
year = 2008
}%0 Book Section
%1 tagging-cattuto
%A Cattuto, Ciro
%A Benz, Dominik
%A Hotho, Andreas
%A Stumme, Gerd
%B The Semantic Web - ISWC 2008
%D 2008
%E Sheth, Amit
%E Staab, Steffen
%E Dean, Mike
%E Paolucci, Massimo
%E Maynard, Diana
%E Finin, Timothy
%E Thirunarayan, Krishnaprasad
%I Springer Berlin / Heidelberg
%J The Semantic Web - ISWC 2008
%P 615--631
%R 10.1007/978-3-540-88564-1\_39
%T {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}
%U http://tagora-project.eu/wp-content/2009/09/cattuto_iswc2008.pdf
%V 5318
%X {Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Even though most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptions on the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity in terms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures of tag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding is provided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measures of semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of the investigated similarity measures and indicates which ones are better suited in the context of a given semantic application.} - 1.Cattuto, C., Benz, D., Hotho, A., Stumme, G.: Semantic Grounding of Tag Relatedness in Social Bookmarking Systems. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T.W., and Thirunarayan, K. (eds.) The Semantic Web -- ISWC 2008, Proc.Intl. Semantic Web Conference 2008. pp. 615–631. Springer, Heidelberg (2008).Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.
@inproceedings{cattuto2008semantic,
abstract = {Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.},
address = {Heidelberg},
author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
booktitle = {The Semantic Web -- ISWC 2008, Proc.Intl. Semantic Web Conference 2008},
editor = {Sheth, Amit P. and Staab, Steffen and Dean, Mike and Paolucci, Massimo and Maynard, Diana and Finin, Timothy W. and Thirunarayan, Krishnaprasad},
keywords = {grounding},
pages = {615--631},
publisher = {Springer},
series = {LNAI},
title = {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems},
volume = 5318,
year = 2008
}%0 Conference Paper
%1 cattuto2008semantic
%A Cattuto, Ciro
%A Benz, Dominik
%A Hotho, Andreas
%A Stumme, Gerd
%B The Semantic Web -- ISWC 2008, Proc.Intl. Semantic Web Conference 2008
%C Heidelberg
%D 2008
%E Sheth, Amit P.
%E Staab, Steffen
%E Dean, Mike
%E Paolucci, Massimo
%E Maynard, Diana
%E Finin, Timothy W.
%E Thirunarayan, Krishnaprasad
%I Springer
%P 615--631
%T Semantic Grounding of Tag Relatedness in Social Bookmarking Systems
%U http://dx.doi.org/10.1007/978-3-540-88564-1_39
%V 5318
%X Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application. - 1.J{ä}schke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Discovering shared conceptualizations in folksonomies. Web Semant. 6, 38–53 (2008). https://doi.org/http://dx.doi.org/10.1016/j.websem.2007.11.004.Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.
@article{1346701,
abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.},
address = {Amsterdam, The Netherlands, The Netherlands},
author = {J{ä}schke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
journal = {Web Semant.},
keywords = {analysis},
number = 1,
pages = {38--53},
publisher = {Elsevier Science Publishers B. V.},
title = {Discovering shared conceptualizations in folksonomies},
volume = 6,
year = 2008
}%0 Journal Article
%1 1346701
%A J{ä}schke, Robert
%A Hotho, Andreas
%A Schmitz, Christoph
%A Ganter, Bernhard
%A Stumme, Gerd
%C Amsterdam, The Netherlands, The Netherlands
%D 2008
%I Elsevier Science Publishers B. V.
%J Web Semant.
%N 1
%P 38--53
%R http://dx.doi.org/10.1016/j.websem.2007.11.004
%T Discovering shared conceptualizations in folksonomies
%U http://portal.acm.org/citation.cfm?id=1346701
%V 6
%X Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples. - 1.Krause, B., Schmitz, C., Hotho, A., Stumme, G.: The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems. In: AIRWeb ’08: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web. pp. 61–68. ACM, Beijing, China (2008). https://doi.org/10.1145/1451983.1451998.The annotation of web sites in social bookmarking systemshas become a popular way to manage and find informationon the web. The community structure of such systems attractsspammers: recent post pages, popular pages or specifictag pages can be manipulated easily. As a result, searchingor tracking recent posts does not deliver quality resultsannotated in the community, but rather unsolicited, oftencommercial, web sites. To retain the benefits of sharingone’s web content, spam-fighting mechanisms that can facethe flexible strategies of spammers need to be developed.
@inproceedings{krause2008antisocial,
abstract = {The annotation of web sites in social bookmarking systemshas become a popular way to manage and find informationon the web. The community structure of such systems attractsspammers: recent post pages, popular pages or specifictag pages can be manipulated easily. As a result, searchingor tracking recent posts does not deliver quality resultsannotated in the community, but rather unsolicited, oftencommercial, web sites. To retain the benefits of sharingone’s web content, spam-fighting mechanisms that can facethe flexible strategies of spammers need to be developed.},
address = {New York, NY, USA},
author = {Krause, Beate and Schmitz, Christoph and Hotho, Andreas and Stumme, Gerd},
booktitle = {AIRWeb '08: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web},
keywords = {summer},
month = {04},
pages = {61--68},
publisher = {ACM},
title = {The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems},
year = 2008
}%0 Conference Paper
%1 krause2008antisocial
%A Krause, Beate
%A Schmitz, Christoph
%A Hotho, Andreas
%A Stumme, Gerd
%B AIRWeb '08: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web
%C New York, NY, USA
%D 2008
%I ACM
%P 61--68
%R 10.1145/1451983.1451998
%T The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems
%U http://airweb.cse.lehigh.edu/2008/submissions/krause_2008_anti_social_tagger.pdf
%X The annotation of web sites in social bookmarking systemshas become a popular way to manage and find informationon the web. The community structure of such systems attractsspammers: recent post pages, popular pages or specifictag pages can be manipulated easily. As a result, searchingor tracking recent posts does not deliver quality resultsannotated in the community, but rather unsolicited, oftencommercial, web sites. To retain the benefits of sharingone’s web content, spam-fighting mechanisms that can facethe flexible strategies of spammers need to be developed.
%@ 978-1-60558-159-0 - 1.Alani, H., Staab, S., Stumme, G. eds.: Proceedings of the Dagstuhl Seminar on Social Web Communities. Schloss Dagstuhl (2008).
@book{alani2008proceedings,
editor = {Alani, Harith and Staab, Steffen and Stumme, Gerd},
keywords = {itegpub},
month = {09},
publisher = {Schloss Dagstuhl},
title = {Proceedings of the Dagstuhl Seminar on Social Web Communities},
year = 2008
}%0 Book
%1 alani2008proceedings
%D 2008
%E Alani, Harith
%E Staab, Steffen
%E Stumme, Gerd
%I Schloss Dagstuhl
%T Proceedings of the Dagstuhl Seminar on Social Web Communities
%U http://www.dagstuhl.de/en/program/calendar/semhp/?semnr=08391 - 1.Cattuto, C., Benz, D., Hotho, A., Stumme, G.: Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems. In: Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3). , Patras, Greece (2008).Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose different characteristics of the selected measures of relatedness, making them applicable to different subtasks of knowledge extraction such as synonym detection or discovery of concept hierarchies.
@inproceedings{cattuto08-semantic,
abstract = {Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose different characteristics of the selected measures of relatedness, making them applicable to different subtasks of knowledge extraction such as synonym detection or discovery of concept hierarchies.},
address = {Patras, Greece},
author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
booktitle = {Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3)},
keywords = {itegpub},
month = {07},
title = {Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems},
year = 2008
}%0 Conference Paper
%1 cattuto08-semantic
%A Cattuto, Ciro
%A Benz, Dominik
%A Hotho, Andreas
%A Stumme, Gerd
%B Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3)
%C Patras, Greece
%D 2008
%T Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems
%U http://olp.dfki.de/olp3/
%X Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose different characteristics of the selected measures of relatedness, making them applicable to different subtasks of knowledge extraction such as synonym detection or discovery of concept hierarchies.
2007
- 1.Jäschke, R., Grahl, M., Hotho, A., Krause, B., Schmitz, C., Stumme, G.: Organizing Publications and Bookmarks in BibSonomy. In: Alani, H., Noy, N., Stumme, G., Mika, P., Sure, Y., and Vrandecic, D. (eds.) Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007. , Banff, Canada (2007).
@inproceedings{jaeschke07organizing,
address = {Banff, Canada},
author = {Jäschke, Robert and Grahl, Miranda and Hotho, Andreas and Krause, Beate and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007},
editor = {Alani, Harith and Noy, Natasha and Stumme, Gerd and Mika, Peter and Sure, York and Vrandecic, Denny},
keywords = {itegpub},
title = {Organizing Publications and Bookmarks in BibSonomy},
year = 2007
}%0 Conference Paper
%1 jaeschke07organizing
%A Jäschke, Robert
%A Grahl, Miranda
%A Hotho, Andreas
%A Krause, Beate
%A Schmitz, Christoph
%A Stumme, Gerd
%B Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007
%C Banff, Canada
%D 2007
%E Alani, Harith
%E Noy, Natasha
%E Stumme, Gerd
%E Mika, Peter
%E Sure, York
%E Vrandecic, Denny
%T Organizing Publications and Bookmarks in BibSonomy
%U http://www2007.org/workshops/paper_25.pdf - 1.Hotho, A., Stumme, G.: Mining the World Wide Web -- Methods, Ap- plications, and Perspectives. Künstliche Intelligenz. 5–8 (2007).
@article{themenheft2007webmining,
author = {Hotho, Andreas and Stumme, Gerd},
journal = {Künstliche Intelligenz},
keywords = {itegpub},
number = 3,
pages = {5-8},
title = {Mining the World Wide Web -- Methods, Ap- plications, and Perspectives},
year = 2007
}%0 Journal Article
%1 themenheft2007webmining
%A Hotho, Andreas
%A Stumme, Gerd
%D 2007
%J Künstliche Intelligenz
%N 3
%P 5-8
%T Mining the World Wide Web -- Methods, Ap- plications, and Perspectives
%U http://www.kuenstliche-intelligenz.de/index.php?id=7758 - 1.Hotho, A., Stumme, G.: Mining the World Wide Web. Künstliche Intelligenz. 5–8 (2007).
@article{hotho2007mining,
author = {Hotho, Andreas and Stumme, Gerd},
journal = {Künstliche Intelligenz},
keywords = {ml},
number = 3,
pages = {5-8},
title = {Mining the World Wide Web},
year = 2007
}%0 Journal Article
%1 hotho2007mining
%A Hotho, Andreas
%A Stumme, Gerd
%D 2007
%J Künstliche Intelligenz
%N 3
%P 5-8
%T Mining the World Wide Web
%U http://kobra.bibliothek.uni-kassel.de/bitstream/urn:nbn:de:hebis:34-2008021320337/3/HothoStummeMiningWWW.pdf - 1.Hotho, A., Stumme, G. eds.: Themenheft Web Mining, Künstliche Intelligenz. (2007).
@proceedings{themenheft2007webmining,
editor = {Hotho, Andreas and Stumme, Gerd},
journal = {Künstliche Intelligenz},
keywords = {itegpub},
number = 3,
pages = {5-8},
title = {Themenheft Web Mining, Künstliche Intelligenz},
year = 2007
}%0 Conference Proceedings
%1 themenheft2007webmining
%D 2007
%E Hotho, Andreas
%E Stumme, Gerd
%J Künstliche Intelligenz
%N 3
%P 5-8
%T Themenheft Web Mining, Künstliche Intelligenz
%U http://www.kuenstliche-intelligenz.de/index.php?id=7758 - 1.Catutto, C., Schmitz, C., Baldassarri, A., Servedio, V.D.P., Loreto, V., Hotho, and A., Grahl, M., Stumme, G.: Network Properties of Folksonomies. AI Communications Journal, Special Issue on "Network Analysis in Natural Sciences and Engineering". (2007).
@article{cattuto2007network,
author = {Catutto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and and Andreas Hotho and Grahl, Miranda and Stumme, Gerd},
editor = {Hoche, Susanne and Nürnberger, Andreas and Flach, Jürgen},
journal = {AI Communications Journal, Special Issue on "Network Analysis in Natural Sciences and Engineering"},
keywords = {collective},
publisher = {IOS Press},
title = {Network Properties of Folksonomies},
year = 2007
}%0 Journal Article
%1 cattuto2007network
%A Catutto, Ciro
%A Schmitz, Christoph
%A Baldassarri, Andrea
%A Servedio, Vito D. P.
%A Loreto, Vittorio
%A Hotho, and Andreas
%A Grahl, Miranda
%A Stumme, Gerd
%D 2007
%E Hoche, Susanne
%E Nürnberger, Andreas
%E Flach, Jürgen
%I IOS Press
%J AI Communications Journal, Special Issue on "Network Analysis in Natural Sciences and Engineering"
%T Network Properties of Folksonomies - 1.Hotho, A., Stumme, G.: Mining the World Wide Web --- Methods, Applications, and Perspectives. Künstliche Intelligenz. 5–8 (2007).
@article{hotho2007webmining,
author = {Hotho, Andreas and Stumme, Gerd},
editor = {Hotho, Andreas and Stumme, Gerd},
journal = {Künstliche Intelligenz},
keywords = {itegpub},
number = 3,
pages = {5-8},
title = {Mining the World Wide Web --- Methods, Applications, and Perspectives},
year = 2007
}%0 Journal Article
%1 hotho2007webmining
%A Hotho, Andreas
%A Stumme, Gerd
%D 2007
%E Hotho, Andreas
%E Stumme, Gerd
%J Künstliche Intelligenz
%N 3
%P 5-8
%T Mining the World Wide Web --- Methods, Applications, and Perspectives
%U http://www.kuenstliche-intelligenz.de/index.php?id=7758 - 1.Cao, Y., Ehms, K., Fiedler, S., Hofer, M., Kaiamo, A.-K., Kieslinger, B., Klamma, R., Krause, B., Kravcik, M., Ryyppö, T., Spaniol, M., Stumme, G., Wild, F.: Case study on social software use in distributed working environments, http://www.prolearn-project.org/deliverables/view?id=1432, (2007).
@misc{cao07casestudy,
author = {Cao, Yiwei and Ehms, Karsten and Fiedler, Sebastian and Hofer, Margit and Kaiamo, Anna-Kaarina and Kieslinger, Barbara and Klamma, Ralf and Krause, Beate and Kravcik, Milos and Ryyppö, Tommi and Spaniol, Marc and Stumme, Gerd and Wild, Fridolin},
keywords = {itegpub},
note = {Deliverable 15.2, European Network of Excellence ``Prolearn - Professional E-Learning''},
title = {Case study on social software use in distributed working environments},
year = 2007
}%0 Generic
%1 cao07casestudy
%A Cao, Yiwei
%A Ehms, Karsten
%A Fiedler, Sebastian
%A Hofer, Margit
%A Kaiamo, Anna-Kaarina
%A Kieslinger, Barbara
%A Klamma, Ralf
%A Krause, Beate
%A Kravcik, Milos
%A Ryyppö, Tommi
%A Spaniol, Marc
%A Stumme, Gerd
%A Wild, Fridolin
%D 2007
%T Case study on social software use in distributed working environments
%U http://www.prolearn-project.org/deliverables/view?id=1432 - 1.Jäschke, R., Marinho, L.B., Hotho, A., Schmidt-Thieme, L., Stumme, G.: Tag Recommendations in Folksonomies. In: Kok, J.N., Koronacki, J., de Mántaras, R.L., Matwin, S., Mladenic, D., and Skowron, A. (eds.) Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases. pp. 506–514. Springer, Berlin, Heidelberg (2007).Collaborative tagging systems allow users to assign keywords—so called “tags”—to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare two recommendation algorithms on largescale real life datasets: an adaptation of user-based collaborative filtering and a graph-based recommender built on top of FolkRank. We show that both provide better results than non-personalized baseline methods. Especially the graph-based recommender outperforms existing methods considerably.
@inproceedings{jaeschke2007tag,
abstract = {Collaborative tagging systems allow users to assign keywords—so called “tags”—to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare two recommendation algorithms on largescale real life datasets: an adaptation of user-based collaborative filtering and a graph-based recommender built on top of FolkRank. We show that both provide better results than non-personalized baseline methods. Especially the graph-based recommender outperforms existing methods considerably.},
address = {Berlin, Heidelberg},
author = {Jäschke, Robert and Marinho, Leandro Balby and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},
booktitle = {Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases},
editor = {Kok, Joost N. and Koronacki, Jacek and de Mántaras, Ramon López and Matwin, Stan and Mladenic, Dunja and Skowron, Andrzej},
keywords = {itegpub},
pages = {506-514},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {Tag Recommendations in Folksonomies},
volume = 4702,
year = 2007
}%0 Conference Paper
%1 jaeschke2007tag
%A Jäschke, Robert
%A Marinho, Leandro Balby
%A Hotho, Andreas
%A Schmidt-Thieme, Lars
%A Stumme, Gerd
%B Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases
%C Berlin, Heidelberg
%D 2007
%E Kok, Joost N.
%E Koronacki, Jacek
%E de Mántaras, Ramon López
%E Matwin, Stan
%E Mladenic, Dunja
%E Skowron, Andrzej
%I Springer
%P 506-514
%T Tag Recommendations in Folksonomies
%U http://dx.doi.org/10.1007/978-3-540-74976-9_52
%V 4702
%X Collaborative tagging systems allow users to assign keywords—so called “tags”—to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare two recommendation algorithms on largescale real life datasets: an adaptation of user-based collaborative filtering and a graph-based recommender built on top of FolkRank. We show that both provide better results than non-personalized baseline methods. Especially the graph-based recommender outperforms existing methods considerably.
%@ 978-3-540-74975-2 - 1.Alani, H., Noy, N., Stumme, G., Mika, P., Sure, Y., Vrandecic, D. eds.: Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007. , Banff, Canada (2007).
@proceedings{alani2007workshop,
address = {Banff, Canada},
editor = {Alani, Harith and Noy, Natasha and Stumme, Gerd and Mika, Peter and Sure, York and Vrandecic, Denny},
keywords = {itegpub},
title = {Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007},
year = 2007
}%0 Conference Proceedings
%1 alani2007workshop
%C Banff, Canada
%D 2007
%E Alani, Harith
%E Noy, Natasha
%E Stumme, Gerd
%E Mika, Peter
%E Sure, York
%E Vrandecic, Denny
%T Workshop on Social and Collaborative Construction of Structured Knowledge (CKC 2007) at WWW 2007
%U http://www2007.org/workshop-W7.php - 1.Cattuto, C., Schmitz, C., Baldassarri, A., Servedio, V.D.P., Loreto, V., Hotho, A., Grahl, M., Stumme, G.: Network Properties of Folksonomies. AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering’’. 20, 245–262 (2007).
@article{cattuto2007network,
author = {Cattuto, Ciro and Schmitz, Christoph and Baldassarri, Andrea and Servedio, Vito D. P. and Loreto, Vittorio and Hotho, Andreas and Grahl, Miranda and Stumme, Gerd},
editor = {Hoche, Susanne and Nürnberger, Andreas and Flach, Jürgen},
journal = {AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering''},
keywords = {itegpub},
number = 4,
pages = {245-262},
publisher = {IOS Press},
title = {Network Properties of Folksonomies},
volume = 20,
year = 2007
}%0 Journal Article
%1 cattuto2007network
%A Cattuto, Ciro
%A Schmitz, Christoph
%A Baldassarri, Andrea
%A Servedio, Vito D. P.
%A Loreto, Vittorio
%A Hotho, Andreas
%A Grahl, Miranda
%A Stumme, Gerd
%D 2007
%E Hoche, Susanne
%E Nürnberger, Andreas
%E Flach, Jürgen
%I IOS Press
%J AI Communications Journal, Special Issue on ``Network Analysis in Natural Sciences and Engineering''
%N 4
%P 245-262
%T Network Properties of Folksonomies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2007/cattuto2007network.pdf
%V 20 - 1.Schmitz, C., Grahl, M., Hotho, A., Stumme, G., Catutto, C., Baldassarri, A., Loreto, V., Servedio, V.D.P.: Network Properties of Folksonomies. In: Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization’’. , Banff (2007).
@inproceedings{schmitz07network,
address = {Banff},
author = {Schmitz, Christoph and Grahl, Miranda and Hotho, Andreas and Stumme, Gerd and Catutto, Ciro and Baldassarri, Andrea and Loreto, Vittorio and Servedio, Vito D. P.},
booktitle = {Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''},
keywords = {itegpub},
month = {05},
title = {Network Properties of Folksonomies},
year = 2007
}%0 Conference Paper
%1 schmitz07network
%A Schmitz, Christoph
%A Grahl, Miranda
%A Hotho, Andreas
%A Stumme, Gerd
%A Catutto, Ciro
%A Baldassarri, Andrea
%A Loreto, Vittorio
%A Servedio, Vito D. P.
%B Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''
%C Banff
%D 2007
%T Network Properties of Folksonomies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2007/schmitz07network.pdf - 1.Jäschke, R., Hotho, A., Schmitz, C., Stumme, G.: Analysis of the Publication Sharing Behaviour in {BibSonomy}. In: Priss, U., Polovina, S., and Hill, R. (eds.) Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007). pp. 283–295. Springer-Verlag, Berlin, Heidelberg (2007).BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.
@inproceedings{jaeschke2007analysis,
abstract = {BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.},
address = {Berlin, Heidelberg},
author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)},
editor = {Priss, U. and Polovina, S. and Hill, R.},
keywords = {bookmarking},
month = {07},
pages = {283--295},
publisher = {Springer-Verlag},
series = {Lecture Notes in Artificial Intelligence},
title = {Analysis of the Publication Sharing Behaviour in {BibSonomy}},
volume = 4604,
year = 2007
}%0 Conference Paper
%1 jaeschke2007analysis
%A Jäschke, Robert
%A Hotho, Andreas
%A Schmitz, Christoph
%A Stumme, Gerd
%B Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)
%C Berlin, Heidelberg
%D 2007
%E Priss, U.
%E Polovina, S.
%E Hill, R.
%I Springer-Verlag
%P 283--295
%T Analysis of the Publication Sharing Behaviour in {BibSonomy}
%V 4604
%X BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.
%@ 3-540-73680-8 - 1.Grahl, M., Hotho, A., Stumme, G.: Conceptual Clustering of Social Bookmark Sites. In: Hinneburg, A. (ed.) Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivität (LWA 2007). pp. 50–54. Martin-Luther-Universität Halle-Wittenberg (2007).
@inproceedings{grahl07conceptualKdml,
author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd},
booktitle = {Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivität (LWA 2007)},
editor = {Hinneburg, Alexander},
keywords = {bookmarking},
month = {09},
pages = {50-54},
publisher = {Martin-Luther-Universität Halle-Wittenberg},
title = {Conceptual Clustering of Social Bookmark Sites},
year = 2007
}%0 Conference Paper
%1 grahl07conceptualKdml
%A Grahl, Miranda
%A Hotho, Andreas
%A Stumme, Gerd
%B Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivität (LWA 2007)
%D 2007
%E Hinneburg, Alexander
%I Martin-Luther-Universität Halle-Wittenberg
%P 50-54
%T Conceptual Clustering of Social Bookmark Sites
%U https://www.kde.cs.uni-kassel.de/hotho/pub/2007/kdml_recommender_final.pdf
%@ 978-3-86010-907-6 - 1.Jaeschke, R., Marinho, L., Hotho, A., Schmidt-Thieme, L., Stumme, G.: Tag Recommendations in Folksonomies. In: Hinneburg, A. (ed.) Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007). pp. 13–20. Martin-Luther-Universität Halle-Wittenberg (2007).
@inproceedings{jaeschke07tagKdml,
author = {Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},
booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007)},
editor = {Hinneburg, Alexander},
keywords = {bookmarking},
month = {09},
pages = {13-20},
publisher = {Martin-Luther-Universität Halle-Wittenberg},
title = {Tag Recommendations in Folksonomies},
year = 2007
}%0 Conference Paper
%1 jaeschke07tagKdml
%A Jaeschke, Robert
%A Marinho, Leandro
%A Hotho, Andreas
%A Schmidt-Thieme, Lars
%A Stumme, Gerd
%B Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007)
%D 2007
%E Hinneburg, Alexander
%I Martin-Luther-Universität Halle-Wittenberg
%P 13-20
%T Tag Recommendations in Folksonomies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2007/jaeschke07tagrecommendationsKDML.pdf
%@ 978-3-86010-907-6 - 1.Grahl, M., Hotho, A., Stumme, G.: Conceptual Clustering of Social Bookmarking Sites. In: 7th International Conference on Knowledge Management (I-KNOW ’07). pp. 356–364. Know-Center, Graz, Austria (2007).Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but it does not allow a conceptual drill-down, e. g., along a conceptual hierarchy. In this paper, we present a clustering approach for computing such a conceptual hierarchy for a given folksonomy. The hierarchy is complemented with ranked lists of users and resources most related to each cluster. The rankings are computed using our FolkRank algorithm. We have evaluated our approach on large scale data from the del.icio.us bookmarking system.
@inproceedings{grahl2007clustering,
abstract = {Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but it does not allow a conceptual drill-down, e. g., along a conceptual hierarchy. In this paper, we present a clustering approach for computing such a conceptual hierarchy for a given folksonomy. The hierarchy is complemented with ranked lists of users and resources most related to each cluster. The rankings are computed using our FolkRank algorithm. We have evaluated our approach on large scale data from the del.icio.us bookmarking system.},
address = {Graz, Austria},
author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd},
booktitle = {7th International Conference on Knowledge Management (I-KNOW '07)},
keywords = {itegpub},
month = {09},
pages = {356-364},
publisher = {Know-Center},
title = {Conceptual Clustering of Social Bookmarking Sites},
year = 2007
}%0 Conference Paper
%1 grahl2007clustering
%A Grahl, Miranda
%A Hotho, Andreas
%A Stumme, Gerd
%B 7th International Conference on Knowledge Management (I-KNOW '07)
%C Graz, Austria
%D 2007
%I Know-Center
%P 356-364
%T Conceptual Clustering of Social Bookmarking Sites
%X Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but it does not allow a conceptual drill-down, e. g., along a conceptual hierarchy. In this paper, we present a clustering approach for computing such a conceptual hierarchy for a given folksonomy. The hierarchy is complemented with ranked lists of users and resources most related to each cluster. The rankings are computed using our FolkRank algorithm. We have evaluated our approach on large scale data from the del.icio.us bookmarking system.
2006
- 1.Schmitz, C., Hotho, A., Jäschke, R., Stumme, G.: Content Aggregation on Knowledge Bases using Graph Clustering. In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 530–544. Springer, Heidelberg (2006).Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper provides a graph clustering technique on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.
@inproceedings{schmitz2006content,
abstract = {Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper provides a graph clustering technique on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.},
address = {Heidelberg},
author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
booktitle = {The Semantic Web: Research and Applications},
editor = {Sure, York and Domingue, John},
keywords = {theory},
pages = {530-544},
publisher = {Springer},
series = {LNAI},
title = {Content Aggregation on Knowledge Bases using Graph Clustering},
volume = 4011,
year = 2006
}%0 Conference Paper
%1 schmitz2006content
%A Schmitz, Christoph
%A Hotho, Andreas
%A Jäschke, Robert
%A Stumme, Gerd
%B The Semantic Web: Research and Applications
%C Heidelberg
%D 2006
%E Sure, York
%E Domingue, John
%I Springer
%P 530-544
%T Content Aggregation on Knowledge Bases using Graph Clustering
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf
%V 4011
%X Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper provides a graph clustering technique on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario. - 1.Schmitz, C., Hotho, A., Jäschke, R., Stumme, G.: Kollaboratives Wissensmanagement. In: Pellegrini, T. and Blumauer, A. (eds.) Semantic Web - Wege zur vernetzten Wissensgesellschaft. pp. 273–290. Springer (2006).Wissensmanagement in zentralisierten Wissensbasen erfordert einen hohen Aufwand für Erstellung und Wartung, und es entspricht nicht immer den Anforderungen der Benutzer. Wir geben in diesem Kapitel einen Überblick über zwei aktuelle Ansätze, die durch kollaboratives Wissensmanagement diese Probleme lösen können. Im Peer-to-Peer-Wissensmanagement unterhalten Benutzer dezentrale Wissensbasen, die dann vernetzt werden können, um andere Benutzer eigene Inhalte nutzen zu lassen. Folksonomies versprechen, die Wissensakquisition so einfach wie möglich zu gestalten und so viele Benutzer in den Aufbau und die Pflege einer gemeinsamen Wissensbasis einzubeziehen.
@inbook{schmitz2006kollaboratives,
abstract = {Wissensmanagement in zentralisierten Wissensbasen erfordert einen hohen Aufwand für Erstellung und Wartung, und es entspricht nicht immer den Anforderungen der Benutzer. Wir geben in diesem Kapitel einen Überblick über zwei aktuelle Ansätze, die durch kollaboratives Wissensmanagement diese Probleme lösen können. Im Peer-to-Peer-Wissensmanagement unterhalten Benutzer dezentrale Wissensbasen, die dann vernetzt werden können, um andere Benutzer eigene Inhalte nutzen zu lassen. Folksonomies versprechen, die Wissensakquisition so einfach wie möglich zu gestalten und so viele Benutzer in den Aufbau und die Pflege einer gemeinsamen Wissensbasis einzubeziehen.},
author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
booktitle = {Semantic Web - Wege zur vernetzten Wissensgesellschaft},
editor = {Pellegrini, Tassilo and Blumauer, Andreas},
keywords = {knowledge},
pages = {273-290},
publisher = {Springer},
title = {Kollaboratives Wissensmanagement},
year = 2006
}%0 Book Section
%1 schmitz2006kollaboratives
%A Schmitz, Christoph
%A Hotho, Andreas
%A Jäschke, Robert
%A Stumme, Gerd
%B Semantic Web - Wege zur vernetzten Wissensgesellschaft
%D 2006
%E Pellegrini, Tassilo
%E Blumauer, Andreas
%I Springer
%P 273-290
%T Kollaboratives Wissensmanagement
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006kollaboratives.pdf
%X Wissensmanagement in zentralisierten Wissensbasen erfordert einen hohen Aufwand für Erstellung und Wartung, und es entspricht nicht immer den Anforderungen der Benutzer. Wir geben in diesem Kapitel einen Überblick über zwei aktuelle Ansätze, die durch kollaboratives Wissensmanagement diese Probleme lösen können. Im Peer-to-Peer-Wissensmanagement unterhalten Benutzer dezentrale Wissensbasen, die dann vernetzt werden können, um andere Benutzer eigene Inhalte nutzen zu lassen. Folksonomies versprechen, die Wissensakquisition so einfach wie möglich zu gestalten und so viele Benutzer in den Aufbau und die Pflege einer gemeinsamen Wissensbasis einzubeziehen.
%@ 3-540-29324-8 - 1.Jäschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: TRIAS - An Algorithm for Mining Iceberg Tri-Lattices. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06). pp. 907–911. IEEE Computer Society, Hong Kong (2006). https://doi.org/http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162.
@inproceedings{jaeschke06trias,
address = {Hong Kong},
author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
booktitle = {Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)},
keywords = {algorithm},
month = 12,
pages = {907-911},
publisher = {IEEE Computer Society},
title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
year = 2006
}%0 Conference Paper
%1 jaeschke06trias
%A Jäschke, Robert
%A Hotho, Andreas
%A Schmitz, Christoph
%A Ganter, Bernhard
%A Stumme, Gerd
%B Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)
%C Hong Kong
%D 2006
%I IEEE Computer Society
%P 907-911
%R http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162
%T TRIAS - An Algorithm for Mining Iceberg Tri-Lattices
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006trias.pdf
%@ 0-7695-2701-9 - 1.Hotho, A., Jäschke, R., Schmitz, C., Stumme, G.: Emergent Semantics in BibSonomy. In: Hochberger, C. and Liskowsky, R. (eds.) Informatik 2006 -- Informatik für Menschen. Band 2. Gesellschaft für Informatik, Bonn (2006).Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies, briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references, and discuss first steps towards emergent semantics.
@inproceedings{hotho2006emergent,
abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies, briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references, and discuss first steps towards emergent semantics.},
address = {Bonn},
author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Informatik 2006 -- Informatik für Menschen. Band 2},
editor = {Hochberger, Christian and Liskowsky, Rüdiger},
keywords = {hotho},
month = 10,
note = {Proc. Workshop on Applications of Semantic Technologies, Informatik 2006},
publisher = {Gesellschaft für Informatik},
series = {Lecture Notes in Informatics},
title = {Emergent Semantics in BibSonomy},
volume = {P-94},
year = 2006
}%0 Conference Paper
%1 hotho2006emergent
%A Hotho, Andreas
%A Jäschke, Robert
%A Schmitz, Christoph
%A Stumme, Gerd
%B Informatik 2006 -- Informatik für Menschen. Band 2
%C Bonn
%D 2006
%E Hochberger, Christian
%E Liskowsky, Rüdiger
%I Gesellschaft für Informatik
%T Emergent Semantics in BibSonomy
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006emergent.pdf
%V P-94
%X Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies, briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references, and discuss first steps towards emergent semantics. - 1.Hotho, A., Jäschke, R., Schmitz, C., Stumme, G.: Trend Detection in Folksonomies. In: Avrithis, Y.S., Kompatsiaris, Y., Staab, S., and O’Connor, N.E. (eds.) Proc. First International Conference on Semantics And Digital Media Technology (SAMT). pp. 56–70. Springer, Heidelberg (2006).As the number of resources on the web exceeds by far the number of documents one can track, it becomes increasingly difficult to remain up to date on ones own areas of interest. The problem becomes more severe with the increasing fraction of multimedia data, from which it is difficult to extract some conceptual description of their contents. One way to overcome this problem are social bookmark tools, which are rapidly emerging on the web. In such systems, users are setting up lightweight conceptual structures called folksonomies, and overcome thus the knowledge acquisition bottleneck. As more and more people participate in the effort, the use of a common vocabulary becomes more and more stable. We present an approach for discovering topic-specific trends within folksonomies. It is based on a differential adaptation of the PageRank algorithm to the triadic hypergraph structure of a folksonomy. The approach allows for any kind of data, as it does not rely on the internal structure of the documents. In particular, this allows to consider different data types in the same analysis step. We run experiments on a large-scale real-world snapshot of a social bookmarking system.
@inproceedings{hotho2006trend,
abstract = {As the number of resources on the web exceeds by far the number of documents one can track, it becomes increasingly difficult to remain up to date on ones own areas of interest. The problem becomes more severe with the increasing fraction of multimedia data, from which it is difficult to extract some conceptual description of their contents. One way to overcome this problem are social bookmark tools, which are rapidly emerging on the web. In such systems, users are setting up lightweight conceptual structures called folksonomies, and overcome thus the knowledge acquisition bottleneck. As more and more people participate in the effort, the use of a common vocabulary becomes more and more stable. We present an approach for discovering topic-specific trends within folksonomies. It is based on a differential adaptation of the PageRank algorithm to the triadic hypergraph structure of a folksonomy. The approach allows for any kind of data, as it does not rely on the internal structure of the documents. In particular, this allows to consider different data types in the same analysis step. We run experiments on a large-scale real-world snapshot of a social bookmarking system.},
address = {Heidelberg},
author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Proc. First International Conference on Semantics And Digital Media Technology (SAMT)},
editor = {Avrithis, Yannis S. and Kompatsiaris, Yiannis and Staab, Steffen and O'Connor, Noel E.},
keywords = {hotho},
month = 12,
pages = {56-70},
publisher = {Springer},
series = {LNCS},
title = {Trend Detection in Folksonomies},
volume = 4306,
year = 2006
}%0 Conference Paper
%1 hotho2006trend
%A Hotho, Andreas
%A Jäschke, Robert
%A Schmitz, Christoph
%A Stumme, Gerd
%B Proc. First International Conference on Semantics And Digital Media Technology (SAMT)
%C Heidelberg
%D 2006
%E Avrithis, Yannis S.
%E Kompatsiaris, Yiannis
%E Staab, Steffen
%E O'Connor, Noel E.
%I Springer
%P 56-70
%T Trend Detection in Folksonomies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006trend.pdf
%V 4306
%X As the number of resources on the web exceeds by far the number of documents one can track, it becomes increasingly difficult to remain up to date on ones own areas of interest. The problem becomes more severe with the increasing fraction of multimedia data, from which it is difficult to extract some conceptual description of their contents. One way to overcome this problem are social bookmark tools, which are rapidly emerging on the web. In such systems, users are setting up lightweight conceptual structures called folksonomies, and overcome thus the knowledge acquisition bottleneck. As more and more people participate in the effort, the use of a common vocabulary becomes more and more stable. We present an approach for discovering topic-specific trends within folksonomies. It is based on a differential adaptation of the PageRank algorithm to the triadic hypergraph structure of a folksonomy. The approach allows for any kind of data, as it does not rely on the internal structure of the documents. In particular, this allows to consider different data types in the same analysis step. We run experiments on a large-scale real-world snapshot of a social bookmarking system.
%@ 3-540-49335-2 - 1.Jäschke, R., Hotho, A., Schmitz, C., Stumme, G.: Wege zur Entdeckung von Communities in Folksonomies. In: Braß, S. and Hinneburg, A. (eds.) Proc. 18. Workshop Grundlagen von Datenbanken. pp. 80–84. Martin-Luther-Universität, Halle-Wittenberg (2006).Ein wichtiger Baustein des neu entdeckten World Wide Web -- des "`Web 2.0"' -- stellen Folksonomies dar. In diesen Systemen können Benutzer gemeinsam Ressourcen verwalten und mit Schlagwörtern versehen. Die dadurch entstehenden begrifflichen Strukturen stellen ein interessantes Forschungsfeld dar. Dieser Artikel untersucht Ansätze und Wege zur Entdeckung und Strukturierung von Nutzergruppen ("Communities") in Folksonomies.
@inproceedings{jaeschke2006wege,
abstract = {Ein wichtiger Baustein des neu entdeckten World Wide Web -- des "`Web 2.0"' -- stellen Folksonomies dar. In diesen Systemen können Benutzer gemeinsam Ressourcen verwalten und mit Schlagwörtern versehen. Die dadurch entstehenden begrifflichen Strukturen stellen ein interessantes Forschungsfeld dar. Dieser Artikel untersucht Ansätze und Wege zur Entdeckung und Strukturierung von Nutzergruppen ("Communities") in Folksonomies.},
address = {Halle-Wittenberg},
author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Proc. 18. Workshop Grundlagen von Datenbanken},
editor = {Braß, Stefan and Hinneburg, Alexander},
keywords = {itegpub},
month = {06},
pages = {80-84},
publisher = {Martin-Luther-Universität},
title = {Wege zur Entdeckung von Communities in Folksonomies},
year = 2006
}%0 Conference Paper
%1 jaeschke2006wege
%A Jäschke, Robert
%A Hotho, Andreas
%A Schmitz, Christoph
%A Stumme, Gerd
%B Proc. 18. Workshop Grundlagen von Datenbanken
%C Halle-Wittenberg
%D 2006
%E Braß, Stefan
%E Hinneburg, Alexander
%I Martin-Luther-Universität
%P 80-84
%T Wege zur Entdeckung von Communities in Folksonomies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006wege.pdf
%X Ein wichtiger Baustein des neu entdeckten World Wide Web -- des "`Web 2.0"' -- stellen Folksonomies dar. In diesen Systemen können Benutzer gemeinsam Ressourcen verwalten und mit Schlagwörtern versehen. Die dadurch entstehenden begrifflichen Strukturen stellen ein interessantes Forschungsfeld dar. Dieser Artikel untersucht Ansätze und Wege zur Entdeckung und Strukturierung von Nutzergruppen ("Communities") in Folksonomies. - 1.Hoser, B., Hotho, A., Jäschke, R., Schmitz, C., Stumme, G.: Semantic Network Analysis of Ontologies. In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 514–529. Springer, Heidelberg (2006).A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.
@inproceedings{hoser2006semantic,
abstract = {A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.},
address = {Heidelberg},
author = {Hoser, Bettina and Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
booktitle = {The Semantic Web: Research and Applications},
editor = {Sure, York and Domingue, John},
keywords = {ontology},
month = {06},
pages = {514-529},
publisher = {Springer},
series = {LNAI},
title = {Semantic Network Analysis of Ontologies},
volume = 4011,
year = 2006
}%0 Conference Paper
%1 hoser2006semantic
%A Hoser, Bettina
%A Hotho, Andreas
%A Jäschke, Robert
%A Schmitz, Christoph
%A Stumme, Gerd
%B The Semantic Web: Research and Applications
%C Heidelberg
%D 2006
%E Sure, York
%E Domingue, John
%I Springer
%P 514-529
%T Semantic Network Analysis of Ontologies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/hoser2006semantic.pdf
%V 4011
%X A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size. - 1.Hotho, A., J�schke, R., Schmitz, C., Stumme, G.: Information Retrieval in Folksonomies: Search and Ranking. In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 411–426. Springer, Heidelberg (2006).
@inproceedings{hotho2006information,
address = {Heidelberg},
author = {Hotho, Andreas and J�schke, Robert and Schmitz, Christoph and Stumme, Gerd},
booktitle = {The Semantic Web: Research and Applications},
editor = {Sure, York and Domingue, John},
keywords = {pagerank},
month = {06},
pages = {411-426},
publisher = {Springer},
series = {LNAI},
title = {Information Retrieval in Folksonomies: Search and Ranking},
volume = 4011,
year = 2006
}%0 Conference Paper
%1 hotho2006information
%A Hotho, Andreas
%A J�schke, Robert
%A Schmitz, Christoph
%A Stumme, Gerd
%B The Semantic Web: Research and Applications
%C Heidelberg
%D 2006
%E Sure, York
%E Domingue, John
%I Springer
%P 411-426
%T Information Retrieval in Folksonomies: Search and Ranking
%V 4011 - 1.Schmitz, C., Hotho, A., Jäschke, R., Stumme, G.: Mining Association Rules in Folksonomies. In: Batagelj, V., Bock, H.-H., Ferligoj, A., and Žiberna, A. (eds.) Data Science and Classification. Proceedings of the 10th IFCS Conf. pp. 261–270. Springer, Heidelberg (2006).Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. These systems provide currently relatively few structure. We discuss in this paper, how association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics. We demonstrate our approach on a large scale dataset stemming from an online system.
@inproceedings{schmitz2006mining,
abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. These systems provide currently relatively few structure. We discuss in this paper, how association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics. We demonstrate our approach on a large scale dataset stemming from an online system.},
address = {Heidelberg},
author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
booktitle = {Data Science and Classification. Proceedings of the 10th IFCS Conf.},
editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and Žiberna, A.},
keywords = {network},
month = {07},
pages = {261--270},
publisher = {Springer},
series = {Studies in Classification, Data Analysis, and Knowledge Organization},
title = {Mining Association Rules in Folksonomies},
year = 2006
}%0 Conference Paper
%1 schmitz2006mining
%A Schmitz, Christoph
%A Hotho, Andreas
%A Jäschke, Robert
%A Stumme, Gerd
%B Data Science and Classification. Proceedings of the 10th IFCS Conf.
%C Heidelberg
%D 2006
%E Batagelj, V.
%E Bock, H.-H.
%E Ferligoj, A.
%E Žiberna, A.
%I Springer
%P 261--270
%T Mining Association Rules in Folksonomies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006mining.pdf
%X Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. These systems provide currently relatively few structure. We discuss in this paper, how association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics. We demonstrate our approach on a large scale dataset stemming from an online system. - 1.Schmitz, C., Hotho, A., J{ä}schke, R., Stumme, G.: Content Aggregation on Knowledge Bases Using Graph Clustering. In: ESWC. pp. 530–544 (2006).
@inproceedings{DBLP:conf/esws/SchmitzHJS06,
author = {Schmitz, Christoph and Hotho, Andreas and J{ä}schke, Robert and Stumme, Gerd},
booktitle = {ESWC},
crossref = {DBLP:conf/esws/2006},
keywords = {proceedings},
pages = {530-544},
title = {Content Aggregation on Knowledge Bases Using Graph Clustering.},
year = 2006
}%0 Conference Paper
%1 DBLP:conf/esws/SchmitzHJS06
%A Schmitz, Christoph
%A Hotho, Andreas
%A J{ä}schke, Robert
%A Stumme, Gerd
%B ESWC
%D 2006
%P 530-544
%T Content Aggregation on Knowledge Bases Using Graph Clustering. - 1.Hotho, A., Jäschke, R., Schmitz, C., Stumme, G.: {BibSonomy}: A Social Bookmark and Publication Sharing System. In: de Moor, A., Polovina, S., and Delugach, H. (eds.) Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures. pp. 87–102. Aalborg Universitetsforlag, Aalborg (2006).Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies and briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references in a kind of personal library.
@inproceedings{hotho2006bibsonomy,
abstract = {Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies and briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references in a kind of personal library.},
address = {Aalborg},
author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures},
editor = {de Moor, Aldo and Polovina, Simon and Delugach, Harry},
keywords = {bookmarking},
pages = {87-102},
publisher = {Aalborg Universitetsforlag},
title = {{BibSonomy}: A Social Bookmark and Publication Sharing System},
year = 2006
}%0 Conference Paper
%1 hotho2006bibsonomy
%A Hotho, Andreas
%A Jäschke, Robert
%A Schmitz, Christoph
%A Stumme, Gerd
%B Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures
%C Aalborg
%D 2006
%E de Moor, Aldo
%E Polovina, Simon
%E Delugach, Harry
%I Aalborg Universitetsforlag
%P 87-102
%T {BibSonomy}: A Social Bookmark and Publication Sharing System
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006bibsonomy.pdf
%X Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies and briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references in a kind of personal library.
%@ 87-7307-769-0 - 1.Hotho, A., Jäschke, R., Schmitz, C., Stumme, G.: FolkRank: A Ranking Algorithm for Folksonomies. In: Proc. FGIR 2006 (2006).In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006.
@inproceedings{hotho2006folkrank,
abstract = {In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006.},
author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Proc. FGIR 2006},
keywords = {itegpub},
title = {FolkRank: A Ranking Algorithm for Folksonomies},
year = 2006
}%0 Conference Paper
%1 hotho2006folkrank
%A Hotho, Andreas
%A Jäschke, Robert
%A Schmitz, Christoph
%A Stumme, Gerd
%B Proc. FGIR 2006
%D 2006
%T FolkRank: A Ranking Algorithm for Folksonomies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006folkrank.pdf
%X In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006. - 1.Ackermann, M., Berendt, B., Grobelnik, M., Hotho, A., Mladenic, D., Semeraro, G., Spiliopoulou, M., Stumme, G., Svatek, V., van Someren, M. eds.: Semantics, Web and Mining. Springer, Heidelberg (2006).
@book{Semantic2006Ackermann,
address = {Heidelberg},
editor = {Ackermann, Markus and Berendt, Bettina and Grobelnik, Marko and Hotho, Andreas and Mladenic, Dunja and Semeraro, Giovanni and Spiliopoulou, Myra and Stumme, Gerd and Svatek, Vojtech and van Someren, Maarten},
keywords = {itegpub},
publisher = {Springer},
title = {Semantics, Web and Mining},
year = 2006
}%0 Book
%1 Semantic2006Ackermann
%C Heidelberg
%D 2006
%E Ackermann, Markus
%E Berendt, Bettina
%E Grobelnik, Marko
%E Hotho, Andreas
%E Mladenic, Dunja
%E Semeraro, Giovanni
%E Spiliopoulou, Myra
%E Stumme, Gerd
%E Svatek, Vojtech
%E van Someren, Maarten
%I Springer
%T Semantics, Web and Mining
%U http://dx.doi.org/10.1007/11908678 - 1.Stumme, G., Hotho, A., Berendt, B.: Semantic Web Mining - State of the Art and Future Directions. Journal of Web Semantics. 4, 124–143 (2006).SemanticWeb Mining aims at combining the two fast-developing research areas SemanticWeb andWeb Mining. This survey analyzes the convergence of trends from both areas: an increasing number of researchers is working on improving the results ofWeb Mining by exploiting semantic structures in theWeb, and they make use ofWeb Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today’s Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Furthermore, mining the Semantic Web itself is another upcoming application. We argue that the two areas Web Mining and Semantic Web need each other to fulfill their goals, but that the full potential of this convergence is not yet realized. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable.
@article{jws2006Semantic,
abstract = {SemanticWeb Mining aims at combining the two fast-developing research areas SemanticWeb andWeb Mining. This survey analyzes the convergence of trends from both areas: an increasing number of researchers is working on improving the results ofWeb Mining by exploiting semantic structures in theWeb, and they make use ofWeb Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today’s Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Furthermore, mining the Semantic Web itself is another upcoming application. We argue that the two areas Web Mining and Semantic Web need each other to fulfill their goals, but that the full potential of this convergence is not yet realized. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable.},
author = {Stumme, Gerd and Hotho, Andreas and Berendt, Bettina},
journal = {Journal of Web Semantics},
keywords = {sota},
number = 2,
pages = {124-143},
publisher = {Elsevier},
title = {Semantic Web Mining - State of the Art and Future Directions},
volume = 4,
year = 2006
}%0 Journal Article
%1 jws2006Semantic
%A Stumme, Gerd
%A Hotho, Andreas
%A Berendt, Bettina
%D 2006
%I Elsevier
%J Journal of Web Semantics
%N 2
%P 124-143
%T Semantic Web Mining - State of the Art and Future Directions
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2006/stumme2006semantic.pdf
%V 4
%X SemanticWeb Mining aims at combining the two fast-developing research areas SemanticWeb andWeb Mining. This survey analyzes the convergence of trends from both areas: an increasing number of researchers is working on improving the results ofWeb Mining by exploiting semantic structures in theWeb, and they make use ofWeb Mining techniques for building the Semantic Web. Last but not least, these techniques can be used for mining the Semantic Web itself. The Semantic Web is the second-generation WWW, enriched by machine-processable information which supports the user in his tasks. Given the enormous size even of today’s Web, it is impossible to manually enrich all of these resources. Therefore, automated schemes for learning the relevant information are increasingly being used. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of the data being mined, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web sites and navigation behavior are becoming more and more common. Furthermore, mining the Semantic Web itself is another upcoming application. We argue that the two areas Web Mining and Semantic Web need each other to fulfill their goals, but that the full potential of this convergence is not yet realized. This paper gives an overview of where the two areas meet today, and sketches ways of how a closer integration could be profitable. - 1.Schmitz, C., Hotho, A., Jäschke, R., Stumme, G.: Mining Association Rules in Folksonomies. In: Batagelj, V., Bock, H.-H., Ferligoj, A., and {\v Z}iberna, A. (eds.) Data Science and Classification: Proc. of the 10th IFCS Conf. pp. 261–270. Springer, Berlin, Heidelberg (2006).
@inproceedings{schmitz2006mining,
address = {Berlin, Heidelberg},
author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
booktitle = {Data Science and Classification: Proc. of the 10th IFCS Conf.},
editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and {\v Z}iberna, A.},
keywords = {itegpub},
pages = {261--270},
publisher = {Springer},
series = {Studies in Classification, Data Analysis, and Knowledge Organization},
title = {Mining Association Rules in Folksonomies},
year = 2006
}%0 Conference Paper
%1 schmitz2006mining
%A Schmitz, Christoph
%A Hotho, Andreas
%A Jäschke, Robert
%A Stumme, Gerd
%B Data Science and Classification: Proc. of the 10th IFCS Conf.
%C Berlin, Heidelberg
%D 2006
%E Batagelj, V.
%E Bock, H.-H.
%E Ferligoj, A.
%E {\v Z}iberna, A.
%I Springer
%P 261--270
%T Mining Association Rules in Folksonomies - 1.Alani, H., Hoser, B., Schmitz, C., Stumme, G. eds.: Proceedings of the 2nd Workshop on Semantic Network Analysis. (2006).
@proceedings{alani2006proceedings,
editor = {Alani, Harith and Hoser, Bettina and Schmitz, Christoph and Stumme, Gerd},
keywords = {network},
title = {Proceedings of the 2nd Workshop on Semantic Network Analysis},
year = 2006
}%0 Conference Proceedings
%1 alani2006proceedings
%D 2006
%E Alani, Harith
%E Hoser, Bettina
%E Schmitz, Christoph
%E Stumme, Gerd
%T Proceedings of the 2nd Workshop on Semantic Network Analysis
%U https://www.kde.cs.uni-kassel.de/ws/sna2006/ - 1.Hotho, A., Jäschke, R., Schmitz, C., Stumme, G.: Information Retrieval in Folksonomies: Search and Ranking. In: Sure, Y. and Domingue, J. (eds.) The Semantic Web: Research and Applications. pp. 411–426. Springer, Heidelberg (2006).
@inproceedings{hotho2006information,
address = {Heidelberg},
author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
booktitle = {The Semantic Web: Research and Applications},
editor = {Sure, York and Domingue, John},
keywords = {pagerank},
month = {06},
pages = {411-426},
publisher = {Springer},
series = {LNAI},
title = {Information Retrieval in Folksonomies: Search and Ranking},
volume = 4011,
year = 2006
}%0 Conference Paper
%1 hotho2006information
%A Hotho, Andreas
%A Jäschke, Robert
%A Schmitz, Christoph
%A Stumme, Gerd
%B The Semantic Web: Research and Applications
%C Heidelberg
%D 2006
%E Sure, York
%E Domingue, John
%I Springer
%P 411-426
%T Information Retrieval in Folksonomies: Search and Ranking
%V 4011
2005
- 1.Ganter, B., Stumme, G., Wille, R. eds.: Formal Concept Analysis -- Foundations and Applications. Springer, Heidelberg (2005).
@proceedings{ganter05formal,
address = {Heidelberg},
editor = {Ganter, B. and Stumme, G. and Wille, R.},
keywords = {itegpub},
publisher = {Springer},
series = {LNAI},
title = {Formal Concept Analysis -- Foundations and Applications},
volume = 3626,
year = 2005
}%0 Conference Proceedings
%1 ganter05formal
%B LNAI
%C Heidelberg
%D 2005
%E Ganter, B.
%E Stumme, G.
%E Wille, R.
%I Springer
%T Formal Concept Analysis -- Foundations and Applications
%V 3626 - 1.Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a Condensed Representation for Association Rules. Journal Intelligent Information Systems (JIIS). 24, 29–60 (2005).
@article{pasquier2005generating,
author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi},
journal = {Journal Intelligent Information Systems (JIIS)},
keywords = {closed},
number = 1,
pages = {29-60},
publisher = {Kluwer Academic Publishers},
title = {Generating a Condensed Representation for Association Rules},
volume = 24,
year = 2005
}%0 Journal Article
%1 pasquier2005generating
%A Pasquier, Nicolas
%A Taouil, Rafik
%A Bastide, Yves
%A Stumme, Gerd
%A Lakhal, Lotfi
%D 2005
%I Kluwer Academic Publishers
%J Journal Intelligent Information Systems (JIIS)
%N 1
%P 29-60
%T Generating a Condensed Representation for Association Rules
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
%V 24 - 1.Ganter, B., Stumme, G., Wille, R. eds.: Formal Concept Analysis: Foundations and Applications. Springer, Heidelberg (2005).
@proceedings{ganter05formal,
address = {Heidelberg},
editor = {Ganter, B. and Stumme, G. and Wille, R.},
keywords = {l3s},
note = {http://www.informatik.uni-trier.de/~ley/db/conf/fca/fca2005.html},
publisher = {Springer},
series = {LNAI},
title = {Formal Concept Analysis: Foundations and Applications},
volume = 3626,
year = 2005
}%0 Conference Proceedings
%1 ganter05formal
%B LNAI
%C Heidelberg
%D 2005
%E Ganter, B.
%E Stumme, G.
%E Wille, R.
%I Springer
%T Formal Concept Analysis: Foundations and Applications
%U http://www.springerlink.com/content/978-3-540-27891-7/
%V 3626 - 1.Hitzler, P., Lutz, C., Stumme, G. eds.: Foundational Aspects of Ontologies. Universität Koblenz-Landau (2005).
@proceedings{hitzler05foundational,
editor = {Hitzler, Pascal and Lutz, Carsten and Stumme, Gerd},
keywords = {ontologies},
publisher = {Universität Koblenz-Landau},
series = {Fachberichte Informatik der Universit{ä}t Koblenz-Landau},
title = {Foundational Aspects of Ontologies},
volume = {9-2005},
year = 2005
}%0 Conference Proceedings
%1 hitzler05foundational
%B Fachberichte Informatik der Universit{ä}t Koblenz-Landau
%D 2005
%E Hitzler, Pascal
%E Lutz, Carsten
%E Stumme, Gerd
%I Universität Koblenz-Landau
%T Foundational Aspects of Ontologies
%U http://www.aifb.uni-karlsruhe.de/WBS/phi/FOnt2005/
%V 9-2005 - 1.Stumme, G., Hoser, B., Schmitz, C., Alani, H. eds.: Proceedings of the First Workshop on Semantic Network Analysis. CEUR Proceedings, Aachen (2005).
@proceedings{stumme05semanticnetworkanalysis,
address = {Aachen},
editor = {Stumme, Gerd and Hoser, Bettina and Schmitz, Christoph and Alani, Harith},
keywords = {proceedings},
publisher = {CEUR Proceedings},
title = {Proceedings of the First Workshop on Semantic Network Analysis},
year = 2005
}%0 Conference Proceedings
%1 stumme05semanticnetworkanalysis
%C Aachen
%D 2005
%E Stumme, Gerd
%E Hoser, Bettina
%E Schmitz, Christoph
%E Alani, Harith
%I CEUR Proceedings
%T Proceedings of the First Workshop on Semantic Network Analysis
%U http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-171/ - 1.Lakhal, L., Stumme, G.: Efficient Mining of Association Rules Based on Formal Concept Analysis. In: Ganter, B., Stumme, G., and Wille, R. (eds.) Formal Concept Analysis: Foundations and Applications. pp. 180–195. Springer, Heidelberg (2005).Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, \titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.
@inbook{lakhal2005efficient,
abstract = {Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, \titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.},
address = {Heidelberg},
author = {Lakhal, Lotfi and Stumme, Gerd},
booktitle = {Formal Concept Analysis: Foundations and Applications},
editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
keywords = {itemsets},
pages = {180-195},
publisher = {Springer},
series = {LNAI},
title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
volume = 3626,
year = 2005
}%0 Book Section
%1 lakhal2005efficient
%A Lakhal, Lotfi
%A Stumme, Gerd
%B Formal Concept Analysis: Foundations and Applications
%C Heidelberg
%D 2005
%E Ganter, Bernhard
%E Stumme, Gerd
%E Wille, Rudolf
%I Springer
%P 180-195
%T Efficient Mining of Association Rules Based on Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf
%V 3626
%X Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, \titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining. - 1.Berendt, B., Hotho, A., Mladenic, D., Semerano, G., Spiliopoulou, M., Stumme, G., van Someren, M. eds.: Proc. of the European Web Mining Forum 2005. (2005).
@proceedings{berendt05european,
editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and Semerano, Giovanni and Spiliopoulou, Myra and Stumme, Gerd and van Someren, Maarten},
keywords = {proceedings},
title = {Proc. of the European Web Mining Forum 2005},
year = 2005
}%0 Conference Proceedings
%1 berendt05european
%D 2005
%E Berendt, Bettina
%E Hotho, Andreas
%E Mladenic, Dunja
%E Semerano, Giovanni
%E Spiliopoulou, Myra
%E Stumme, Gerd
%E van Someren, Maarten
%T Proc. of the European Web Mining Forum 2005
%U https://www.kde.cs.uni-kassel.de/ws/ewmf05 - 1.Stumme, G.: Conceptual Knowledge Processing (Invited Talk). In: Collard, M. and Cavarero, J.-L. (eds.) Ontologies-based techniques for DataBases and Information Systems. p. 5. , Trondheim (2005).
@inproceedings{stumme05conceptual,
address = {Trondheim},
author = {Stumme, Gerd},
booktitle = {Ontologies-based techniques for DataBases and Information Systems},
editor = {Collard, Martine and Cavarero, Jean-Louis},
keywords = {ontologies},
pages = 5,
title = {Conceptual Knowledge Processing (Invited Talk)},
year = 2005
}%0 Conference Paper
%1 stumme05conceptual
%A Stumme, Gerd
%B Ontologies-based techniques for DataBases and Information Systems
%C Trondheim
%D 2005
%E Collard, Martine
%E Cavarero, Jean-Louis
%P 5
%T Conceptual Knowledge Processing (Invited Talk)
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005some_slides.pdf - 1.Berendt, B., Hotho, A., Stumme, G.: Semantic Web Mining and the Representation, Analysis, and Evolution of Web Space. In: Svatek, V. and Snasel, V. (eds.) Proc. of the 1st Intl. Workshop on Representation and Analysis of Web Space. pp. 1–16. Technical University of Ostrava (2005).
@inproceedings{berendt05semantic,
author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd},
booktitle = {Proc. of the 1st Intl. Workshop on Representation and Analysis of Web Space},
editor = {Svatek, Vojtech and Snasel, Vaclav},
keywords = {itegpub},
pages = {1-16},
publisher = {Technical University of Ostrava},
title = {Semantic Web Mining and the Representation, Analysis, and Evolution of Web Space},
year = 2005
}%0 Conference Paper
%1 berendt05semantic
%A Berendt, Bettina
%A Hotho, Andreas
%A Stumme, Gerd
%B Proc. of the 1st Intl. Workshop on Representation and Analysis of Web Space
%D 2005
%E Svatek, Vojtech
%E Snasel, Vaclav
%I Technical University of Ostrava
%P 1-16
%T Semantic Web Mining and the Representation, Analysis, and Evolution of Web Space
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2005/berendt2005semantic.pdf
%@ 80-248-0864-1 - 1.Stumme, G.: Ontology Merging with Formal Concept Analysis. In: Kalfoglou, Y., Schorlemmer, W.M., Sheth, A.P., Staab, S., and Uschold, M. (eds.) Semantic Interoperability and Integration. IBFI, Schloss Dagstuhl, Germany (2005).
@inproceedings{conf/dagstuhl/Stumme05,
author = {Stumme, Gerd},
booktitle = {Semantic Interoperability and Integration},
editor = {Kalfoglou, Yannis and Schorlemmer, W. Marco and Sheth, Amit P. and Staab, Steffen and Uschold, Michael},
keywords = {ontology},
publisher = {IBFI, Schloss Dagstuhl, Germany},
series = {Dagstuhl Seminar Proceedings},
title = {Ontology Merging with Formal Concept Analysis},
volume = {04391},
year = 2005
}%0 Conference Paper
%1 conf/dagstuhl/Stumme05
%A Stumme, Gerd
%B Semantic Interoperability and Integration
%D 2005
%E Kalfoglou, Yannis
%E Schorlemmer, W. Marco
%E Sheth, Amit P.
%E Staab, Steffen
%E Uschold, Michael
%I IBFI, Schloss Dagstuhl, Germany
%T Ontology Merging with Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005ontology.pdf
%V 04391 - 1.Ganter, B., Stumme, G., Wille, R. eds.: Formal Concept Analysis: Foundations and Applications. Springer (2005).
@book{noauthororeditor,
editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
keywords = {FCA},
publisher = {Springer},
title = {Formal Concept Analysis: Foundations and Applications},
year = 2005
}%0 Book
%1 noauthororeditor
%D 2005
%E Ganter, Bernhard
%E Stumme, Gerd
%E Wille, Rudolf
%I Springer
%T Formal Concept Analysis: Foundations and Applications - 1.Stumme, G.: A Finite State Model for On-Line Analytical Processing in Triadic Contexts. In: Ganter, B. and Godin, R. (eds.) Proc. 3rd Intl. Conf. on Formal Concept Analysis. pp. 315–328. Springer (2005).
@inproceedings{stumme05finite,
author = {Stumme, Gerd},
booktitle = {Proc. 3rd Intl. Conf. on Formal Concept Analysis},
editor = {Ganter, Bernhard and Godin, Robert},
keywords = {olap},
pages = {315-328},
publisher = {Springer},
series = {LNCS},
title = {A Finite State Model for On-Line Analytical Processing in Triadic Contexts.},
volume = 3403,
year = 2005
}%0 Conference Paper
%1 stumme05finite
%A Stumme, Gerd
%B Proc. 3rd Intl. Conf. on Formal Concept Analysis
%D 2005
%E Ganter, Bernhard
%E Godin, Robert
%I Springer
%P 315-328
%T A Finite State Model for On-Line Analytical Processing in Triadic Contexts.
%V 3403
%@ 3-540-24525-1 - 1.Stumme, G.: A Finite State Model for On-Line Analytical Processing in Triadic Contexts. In: Ganter, B. and Godin, R. (eds.) Proc. 3rd Intl. Conf. on Formal Concept Analysis. pp. 315–328. Springer, Heidelberg (2005).
@inproceedings{stumme05finite,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {Proc. 3rd Intl. Conf. on Formal Concept Analysis},
editor = {Ganter, Bernhard and Godin, Robert},
keywords = {olap},
pages = {315-328},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {A Finite State Model for On-Line Analytical Processing in Triadic Contexts},
volume = 3403,
year = 2005
}%0 Conference Paper
%1 stumme05finite
%A Stumme, Gerd
%B Proc. 3rd Intl. Conf. on Formal Concept Analysis
%C Heidelberg
%D 2005
%E Ganter, Bernhard
%E Godin, Robert
%I Springer
%P 315-328
%T A Finite State Model for On-Line Analytical Processing in Triadic Contexts
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005finite.pdf
%V 3403
%@ 3-540-24525-1 - 1.Dau, F., Mugnier, M.-L., Stumme, G. eds.: Contributions to ICCS 2005. kassel university press, Kassel (2005).
@proceedings{dau05contributions,
address = {Kassel},
booktitle = {Contributions to ICCS 2005},
editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},
keywords = {Germany},
publisher = {kassel university press},
title = {Contributions to ICCS 2005},
year = 2005
}%0 Conference Proceedings
%1 dau05contributions
%B Contributions to ICCS 2005
%C Kassel
%D 2005
%E Dau, Frithjof
%E Mugnier, Marie-Laure
%E Stumme, Gerd
%I kassel university press
%T Contributions to ICCS 2005
%U https://www.kde.cs.uni-kassel.de/conf/iccs05
%@ 3-89958-138-5 - 1.Dau, F., Mugnier, M.-L., Stumme, G. eds.: Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings. Springer (2005).
@proceedings{conf/iccs/2005,
booktitle = {ICCS},
editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},
keywords = {Germany},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings},
volume = 3596,
year = 2005
}%0 Conference Proceedings
%1 conf/iccs/2005
%B ICCS
%D 2005
%E Dau, Frithjof
%E Mugnier, Marie-Laure
%E Stumme, Gerd
%I Springer
%T Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings
%U https://www.kde.cs.uni-kassel.de/conf/iccs05
%V 3596
%@ 3-540-27783-8
2004
- 1.Tane, J., Schmitz, C., Stumme, G.: Semantic resource management for the web: an e-learning application. In: Proc. 13th International World Wide Web Conference (WWW 2004). pp. 1–10 (2004).
@inproceedings{tane04semantic,
author = {Tane, Julien and Schmitz, Christoph and Stumme, Gerd},
booktitle = {Proc. 13th International World Wide Web Conference (WWW 2004)},
keywords = 2004,
pages = {1-10},
title = {Semantic resource management for the web: an e-learning application},
year = 2004
}%0 Conference Paper
%1 tane04semantic
%A Tane, Julien
%A Schmitz, Christoph
%A Stumme, Gerd
%B Proc. 13th International World Wide Web Conference (WWW 2004)
%D 2004
%P 1-10
%T Semantic resource management for the web: an e-learning application
%U http://www.www2004.org/proceedings/docs/2p1.pdf - 1.Cimiano, P., Hotho, A., Stumme, G., Tane, J.: Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies. In: Eklund, P. (ed.) Concept Lattices. pp. 189–207. Springer, Heidelberg (2004).Among many other knowledge representations formalisms, Ontologies and Formal Concept Analysis (FCA) aim at modeling 'concepts'. We discuss how these two formalisms may complement another from an application point of view. In particular, we will see how FCA can be used to support Ontology Engineering, and how ontologies can be exploited in FCA applications. The interplay of FCA and ontologies is studied along the life cycle of an ontology: (i) FCA can support the building of the ontology as a learning technique. (ii) The established ontology can be analyzed and navigated by using techniques of FCA. (iii) Last but not least, the ontology may be used to improve an FCA application.
@inproceedings{cimiano2004concept,
abstract = {Among many other knowledge representations formalisms, Ontologies and Formal Concept Analysis (FCA) aim at modeling 'concepts'. We discuss how these two formalisms may complement another from an application point of view. In particular, we will see how FCA can be used to support Ontology Engineering, and how ontologies can be exploited in FCA applications. The interplay of FCA and ontologies is studied along the life cycle of an ontology: (i) FCA can support the building of the ontology as a learning technique. (ii) The established ontology can be analyzed and navigated by using techniques of FCA. (iii) Last but not least, the ontology may be used to improve an FCA application.},
address = {Heidelberg},
author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},
booktitle = {Concept Lattices},
editor = {Eklund, Peter},
keywords = {ontologies},
organization = {Second International Conference on Formal Concept Analysis, ICFCA 2004},
pages = {189-207},
publisher = {Springer},
series = {LNAI},
title = {Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies},
volume = 2961,
year = 2004
}%0 Conference Paper
%1 cimiano2004concept
%A Cimiano, Philipp
%A Hotho, Andreas
%A Stumme, Gerd
%A Tane, Julien
%B Concept Lattices
%C Heidelberg
%D 2004
%E Eklund, Peter
%I Springer
%P 189-207
%T Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2004/cimiano2004concept.pdf
%V 2961
%X Among many other knowledge representations formalisms, Ontologies and Formal Concept Analysis (FCA) aim at modeling 'concepts'. We discuss how these two formalisms may complement another from an application point of view. In particular, we will see how FCA can be used to support Ontology Engineering, and how ontologies can be exploited in FCA applications. The interplay of FCA and ontologies is studied along the life cycle of an ontology: (i) FCA can support the building of the ontology as a learning technique. (ii) The established ontology can be analyzed and navigated by using techniques of FCA. (iii) Last but not least, the ontology may be used to improve an FCA application.
%@ 3-540-23258-3 - 1.Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., Stumme, G. eds.: Web Mining: From Web to Semantic Web, First European Web Mining Forum, EMWF 2003, Cavtat-Dubrovnik, Croatia, September 22, 2003, Revised Selected and Invited Papers. Springer, Heidelberg (2004).
@proceedings{berendt2004web,
address = {Heidelberg},
editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},
keywords = {itegpub},
note = {http://km.aifb.uni-karlsruhe.de/ws/ewmf03/},
publisher = {Springer},
series = {LNAI},
title = {Web Mining: From Web to Semantic Web, First European Web Mining Forum, EMWF 2003, Cavtat-Dubrovnik, Croatia, September 22, 2003, Revised Selected and Invited Papers},
volume = 3209,
year = 2004
}%0 Conference Proceedings
%1 berendt2004web
%B LNAI
%C Heidelberg
%D 2004
%E Berendt, Bettina
%E Hotho, Andreas
%E Mladenic, Dunja
%E van Someren, Maarten
%E Spiliopoulou, Myra
%E Stumme, Gerd
%I Springer
%T Web Mining: From Web to Semantic Web, First European Web Mining Forum, EMWF 2003, Cavtat-Dubrovnik, Croatia, September 22, 2003, Revised Selected and Invited Papers
%U http://springerlink.metapress.com/content/unvvag26dttf/
%V 3209
%@ 3-540-23258-3 - 1.Maedche, A., Sattler, K.-U., Stumme, G. eds.: Information Integration and Mining in Databases and on the Web. Proceedings of the 2nd International Workshop on Databases, Documents, and Information Fusion (DBFusion 2002). , Aachen (2004).
@proceedings{maedche02information,
address = {Aachen},
editor = {Maedche, Alexander and Sattler, Kai-Uwe and Stumme, Gerd},
journal = {CEUR-WS},
keywords = {integration},
series = {CEUR Workshop Proceedings},
title = {Information Integration and Mining in Databases and on the Web. Proceedings of the 2nd International Workshop on Databases, Documents, and Information Fusion (DBFusion 2002)},
volume = 124,
year = 2004
}%0 Conference Proceedings
%1 maedche02information
%B CEUR Workshop Proceedings
%C Aachen
%D 2004
%E Maedche, Alexander
%E Sattler, Kai-Uwe
%E Stumme, Gerd
%J CEUR-WS
%T Information Integration and Mining in Databases and on the Web. Proceedings of the 2nd International Workshop on Databases, Documents, and Information Fusion (DBFusion 2002)
%U http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-124/
%V 124 - 1.Berendt, B., Hotho, A., Stumme, G.: Usage Mining for and on the Semantic Web. In: Kargupta, H., Joshi, A., Sivakumar, K., and Yesha, Y. (eds.) Data Mining Next Generation Challenges and Future Directions. pp. 461–481. AAAI Press, Boston (2004).Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of data Web mining operates on, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web resources and navigation behavior are increasingly being used. This fits exactly with the aims of the Semantic Web: the Semantic Web enriches the WWW by machine-processable information which supports the user in his tasks. In this paper, we discuss the interplay of the Semantic Web with Web Mining, with a specific focus on usage mining.
@incollection{berendt04usage,
abstract = {Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of data Web mining operates on, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web resources and navigation behavior are increasingly being used. This fits exactly with the aims of the Semantic Web: the Semantic Web enriches the WWW by machine-processable information which supports the user in his tasks. In this paper, we discuss the interplay of the Semantic Web with Web Mining, with a specific focus on usage mining.},
address = {Boston},
author = {Berendt, Bettina and Hotho, Andreas and Stumme, Gerd},
booktitle = {Data Mining Next Generation Challenges and Future Directions},
editor = {Kargupta, Hillol and Joshi, Anupam and Sivakumar, Krishnamoorthy and Yesha, Yelena},
keywords = {itegpub},
pages = {461-481},
publisher = {AAAI Press},
title = {Usage Mining for and on the Semantic Web},
year = 2004
}%0 Book Section
%1 berendt04usage
%A Berendt, Bettina
%A Hotho, Andreas
%A Stumme, Gerd
%B Data Mining Next Generation Challenges and Future Directions
%C Boston
%D 2004
%E Kargupta, Hillol
%E Joshi, Anupam
%E Sivakumar, Krishnamoorthy
%E Yesha, Yelena
%I AAAI Press
%P 461-481
%T Usage Mining for and on the Semantic Web
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2004/berendt04usage.pdf
%X Semantic Web Mining aims at combining the two fast-developing research areas Semantic Web and Web Mining. Web Mining aims at discovering insights about the meaning of Web resources and their usage. Given the primarily syntactical nature of data Web mining operates on, the discovery of meaning is impossible based on these data only. Therefore, formalizations of the semantics of Web resources and navigation behavior are increasingly being used. This fits exactly with the aims of the Semantic Web: the Semantic Web enriches the WWW by machine-processable information which supports the user in his tasks. In this paper, we discuss the interplay of the Semantic Web with Web Mining, with a specific focus on usage mining.
%@ 0-262-61203-8 - 1.Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., Stumme, G.: A Roadmap for Web Mining: From Web to Semantic Web. In: Berendt, B., Hotho, A., Mladenic, D., van Someren, M., Spiliopoulou, M., and Stumme, G. (eds.) Web Mining: From Web to Semantic Web. pp. 1–22. Springer, Heidelberg (2004).The purpose of Web mining is to develop methods and systems for discovering models of objects and processes on the World Wide Web and for web-based systems that show adaptive performance. Web Mining integrates three parent areas: Data Mining (we use this term here also for the closely related areas of Machine Learning and Knowledge Discovery), Internet technology and World Wide Web, and for the more recent Semantic Web. The World Wide Web has made an enormous amount of information electronically accessible. The use of email, news and markup languages like HTML allow users to publish and read documents at a world-wide scale and to communicate via chat connections, including information in the form of images and voice records. The HTTP protocol that enables access to documents over the network via Web browsers created an immense improvement in communication and access to information. For some years these possibilities were used mostly in the scientific world but recent years have seen an immense growth in popularity, supported by the wide availability of computers and broadband communication. The use of the internet for other tasks than finding information and direct communication is increasing, as can be seen from the interest in ldquoe-activitiesrdquo such as e-commerce, e-learning, e-government, e-science.
@inproceedings{berendt2004roadmap,
abstract = {The purpose of Web mining is to develop methods and systems for discovering models of objects and processes on the World Wide Web and for web-based systems that show adaptive performance. Web Mining integrates three parent areas: Data Mining (we use this term here also for the closely related areas of Machine Learning and Knowledge Discovery), Internet technology and World Wide Web, and for the more recent Semantic Web. The World Wide Web has made an enormous amount of information electronically accessible. The use of email, news and markup languages like HTML allow users to publish and read documents at a world-wide scale and to communicate via chat connections, including information in the form of images and voice records. The HTTP protocol that enables access to documents over the network via Web browsers created an immense improvement in communication and access to information. For some years these possibilities were used mostly in the scientific world but recent years have seen an immense growth in popularity, supported by the wide availability of computers and broadband communication. The use of the internet for other tasks than finding information and direct communication is increasing, as can be seen from the interest in ldquoe-activitiesrdquo such as e-commerce, e-learning, e-government, e-science.},
address = {Heidelberg},
author = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},
booktitle = {Web Mining: From Web to Semantic Web},
crossref = {DBLP:conf/ewmf/2003},
editor = {Berendt, Bettina and Hotho, Andreas and Mladenic, Dunja and van Someren, Maarten and Spiliopoulou, Myra and Stumme, Gerd},
keywords = {proceedings},
pages = {1-22},
publisher = {Springer},
title = {A Roadmap for Web Mining: From Web to Semantic Web.},
volume = 3209,
year = 2004
}%0 Conference Paper
%1 berendt2004roadmap
%A Berendt, Bettina
%A Hotho, Andreas
%A Mladenic, Dunja
%A van Someren, Maarten
%A Spiliopoulou, Myra
%A Stumme, Gerd
%B Web Mining: From Web to Semantic Web
%C Heidelberg
%D 2004
%E Berendt, Bettina
%E Hotho, Andreas
%E Mladenic, Dunja
%E van Someren, Maarten
%E Spiliopoulou, Myra
%E Stumme, Gerd
%I Springer
%P 1-22
%T A Roadmap for Web Mining: From Web to Semantic Web.
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2004/berendt2004roadmap.pdf
%V 3209
%X The purpose of Web mining is to develop methods and systems for discovering models of objects and processes on the World Wide Web and for web-based systems that show adaptive performance. Web Mining integrates three parent areas: Data Mining (we use this term here also for the closely related areas of Machine Learning and Knowledge Discovery), Internet technology and World Wide Web, and for the more recent Semantic Web. The World Wide Web has made an enormous amount of information electronically accessible. The use of email, news and markup languages like HTML allow users to publish and read documents at a world-wide scale and to communicate via chat connections, including information in the form of images and voice records. The HTTP protocol that enables access to documents over the network via Web browsers created an immense improvement in communication and access to information. For some years these possibilities were used mostly in the scientific world but recent years have seen an immense growth in popularity, supported by the wide availability of computers and broadband communication. The use of the internet for other tasks than finding information and direct communication is increasing, as can be seen from the interest in ldquoe-activitiesrdquo such as e-commerce, e-learning, e-government, e-science. - 1.Stumme, G.: Iceberg Query Lattices for Datalog. In: Wolff, K.E., Pfeiffer, H.D., and Delugach, H.S. (eds.) Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004). pp. 109–125. Springer, Heidelberg (2004).
@inproceedings{stumme2004iceberg,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)},
editor = {Wolff, Karl Erich and Pfeiffer, Heather D. and Delugach, Harry S.},
keywords = {lattices},
pages = {109-125},
publisher = {Springer},
series = {LNCS},
title = {Iceberg Query Lattices for Datalog},
volume = 3127,
year = 2004
}%0 Conference Paper
%1 stumme2004iceberg
%A Stumme, Gerd
%B Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)
%C Heidelberg
%D 2004
%E Wolff, Karl Erich
%E Pfeiffer, Heather D.
%E Delugach, Harry S.
%I Springer
%P 109-125
%T Iceberg Query Lattices for Datalog
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf
%V 3127 - 1.Cimiano, P., Hotho, A., Stumme, G., Tane, J.: Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies. In: Eklund, P. (ed.) Concept Lattices. pp. 189–207. Springer, Berlin/Heidelberg (2004).
@incollection{cimiano2004conceptual,
address = {Berlin/Heidelberg},
author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},
booktitle = {Concept Lattices},
editor = {Eklund, Peter},
keywords = {icfca},
pages = {189--207},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies},
volume = 2961,
year = 2004
}%0 Book Section
%1 cimiano2004conceptual
%A Cimiano, Philipp
%A Hotho, Andreas
%A Stumme, Gerd
%A Tane, Julien
%B Concept Lattices
%C Berlin/Heidelberg
%D 2004
%E Eklund, Peter
%I Springer
%P 189--207
%T Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies
%U http://dx.doi.org/10.1007/978-3-540-24651-0_18
%V 2961
%@ 978-3-540-21043-6 - 1.Schmidt-Thieme, L., Stumme, G., Rusnak, U., Eberhart, A. eds.: Semantische Technologien für Informationsportale. Gesellschaft für Informatik, Bonn (2004).
@proceedings{schmidt2004semantische,
address = {Bonn},
booktitle = {INFORMATIK 2004 - Informatik verbindet},
editor = {Schmidt-Thieme, Lars and Stumme, Gerd and Rusnak, Ute and Eberhart, Andreas},
journal = {LNI},
keywords = {itegpub},
pages = {158-212},
publisher = {Gesellschaft für Informatik},
series = {LNI},
title = {Semantische Technologien für Informationsportale},
volume = 51,
year = 2004
}%0 Conference Proceedings
%1 schmidt2004semantische
%B INFORMATIK 2004 - Informatik verbindet
%C Bonn
%D 2004
%E Schmidt-Thieme, Lars
%E Stumme, Gerd
%E Rusnak, Ute
%E Eberhart, Andreas
%I Gesellschaft für Informatik
%J LNI
%P 158-212
%T Semantische Technologien für Informationsportale
%U http://www.gi-ev.de/service/publikationen/gi-edition-lecture-notes-in-informatics-lni-2005/mehr-zu-diesem-buch/gi-edition-lecture-notes-in-informatics-lni-p-51/
%V 51
2003
- 1.Hotho, A., Staab, S., Stumme, G.: Wordnet improves text document clustering. In: Proc. SIGIR Semantic Web Workshop. , Toronto (2003).
@inproceedings{hotho03wordnet,
address = {Toronto},
author = {Hotho, A and Staab, S. and Stumme, G.},
booktitle = {Proc. SIGIR Semantic Web Workshop},
keywords = {information},
title = {Wordnet improves text document clustering},
year = 2003
}%0 Conference Paper
%1 hotho03wordnet
%A Hotho, A
%A Staab, S.
%A Stumme, G.
%B Proc. SIGIR Semantic Web Workshop
%C Toronto
%D 2003
%T Wordnet improves text document clustering
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003wordnet.pdf - 1.Hereth, J., Stumme, G., Wille, R., Wille, U.: Conceptual Knowledge Discovery - a Human-Centered Approach. Journal of Applied Artificial Intelligence (AAI). 17, 281–301 (2003).In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge Processing. Conceptual Knowledge Processing is based on the mathematical theory of Formal Concept Analysis which has become a successful theory for data analysis during the last two decades. CKDD aims to support a human-centered process of discovering knowledge from data by visualizing and analyzing the conceptual structure of the data. We dicuss how the management system TOSCANA for conceptual information systems supports CKDD, and illustrate it by two applications in database marketing and flight movement analysis. Finally, we present a new tool for conceptual deviation discovery, Chianti.
@article{hereth03conceptual,
abstract = {In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge Processing. Conceptual Knowledge Processing is based on the mathematical theory of Formal Concept Analysis which has become a successful theory for data analysis during the last two decades. CKDD aims to support a human-centered process of discovering knowledge from data by visualizing and analyzing the conceptual structure of the data. We dicuss how the management system TOSCANA for conceptual information systems supports CKDD, and illustrate it by two applications in database marketing and flight movement analysis. Finally, we present a new tool for conceptual deviation discovery, Chianti.},
author = {Hereth, Joachim and Stumme, Gerd and Wille, Rudolf and Wille, Uta},
journal = {Journal of Applied Artificial Intelligence (AAI)},
keywords = {knowledge},
number = 3,
pages = {281-301},
title = {Conceptual Knowledge Discovery - a Human-Centered Approach},
volume = 17,
year = 2003
}%0 Journal Article
%1 hereth03conceptual
%A Hereth, Joachim
%A Stumme, Gerd
%A Wille, Rudolf
%A Wille, Uta
%D 2003
%J Journal of Applied Artificial Intelligence (AAI)
%N 3
%P 281-301
%T Conceptual Knowledge Discovery - a Human-Centered Approach
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/hereth2003conceptual.pdf
%V 17
%X In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge Processing. Conceptual Knowledge Processing is based on the mathematical theory of Formal Concept Analysis which has become a successful theory for data analysis during the last two decades. CKDD aims to support a human-centered process of discovering knowledge from data by visualizing and analyzing the conceptual structure of the data. We dicuss how the management system TOSCANA for conceptual information systems supports CKDD, and illustrate it by two applications in database marketing and flight movement analysis. Finally, we present a new tool for conceptual deviation discovery, Chianti. - 1.Hotho, A., Stumme, G., Studer, R., Volz, R.: Semantic Web -- State of the Art and Future Directions. Künstliche Intelligenz. 5–9 (2003).The paper presents the vision of the Se- mantic Web and describes ontologies and associated metadata as the building blocks of the SemanticWeb. Current research topics and promising application ar- eas are discussed as well.
@article{hotho03semantic,
abstract = {The paper presents the vision of the Se- mantic Web and describes ontologies and associated metadata as the building blocks of the SemanticWeb. Current research topics and promising application ar- eas are discussed as well.},
author = {Hotho, Andreas and Stumme, Gerd and Studer, Rudi and Volz, Raphael},
journal = {Künstliche Intelligenz},
keywords = 2003,
number = 3,
pages = {5-9},
title = {Semantic Web -- State of the Art and Future Directions},
year = 2003
}%0 Journal Article
%1 hotho03semantic
%A Hotho, Andreas
%A Stumme, Gerd
%A Studer, Rudi
%A Volz, Raphael
%D 2003
%J Künstliche Intelligenz
%N 3
%P 5-9
%T Semantic Web -- State of the Art and Future Directions
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/KI03_Themenheft.pdf
%X The paper presents the vision of the Se- mantic Web and describes ontologies and associated metadata as the building blocks of the SemanticWeb. Current research topics and promising application ar- eas are discussed as well. - 1.Agarwal, S., Fankhauser, P., Gonzalez-Ollala, J., Hartmann, J., Hollfelder, S., Jameson, A., Klink, S., Lehti, P., Ley, M., Rabbidge, E., Schwarzkopf, E., Shrestha, N., Stojanovic, N., Studer, R., Stumme, G., Walter, B.: Semantic Methods and Tools for Information Portals. In: Dittrich, K., König, W., Oberweis, A., Rannenberg, K., and Wahlster, W. (eds.) INFORMATIK 2003 -- Innovative Informatikanwendungen (Band 1). pp. 116–131. Gesellschaft für Informatik, Bonn (2003).The paper describes a set of approaches for representing and accessing information within a semantically structured information portal, while offering the possibility to integrate own information. It discusses research performed within the project `Semantic Methods and Tools for Information Portals (SemIPort)'. In particular, it focuses on (1) the development of scalable storing, processing and querying methods for semantic data, (2) visualization and browsing of complex data inventories, (3) personalization and agent-based interaction, and (4) the enhancement of web mining approaches for use within a semantics-based portal.
@inproceedings{agarwal03semantic,
abstract = {The paper describes a set of approaches for representing and accessing information within a semantically structured information portal, while offering the possibility to integrate own information. It discusses research performed within the project `Semantic Methods and Tools for Information Portals (SemIPort)'. In particular, it focuses on (1) the development of scalable storing, processing and querying methods for semantic data, (2) visualization and browsing of complex data inventories, (3) personalization and agent-based interaction, and (4) the enhancement of web mining approaches for use within a semantics-based portal.},
address = {Bonn},
author = {Agarwal, Sudhir and Fankhauser, Peter and Gonzalez-Ollala, Jorge and Hartmann, Jens and Hollfelder, Silvia and Jameson, Anthony and Klink, Stefan and Lehti, Patrick and Ley, Michael and Rabbidge, Emma and Schwarzkopf, Eric and Shrestha, Nitesh and Stojanovic, Nenad and Studer, Rudi and Stumme, Gerd and Walter, Bernd},
booktitle = {INFORMATIK 2003 -- Innovative Informatikanwendungen (Band 1)},
editor = {Dittrich, K. and König, W. and Oberweis, A. and Rannenberg, K. and Wahlster, W.},
keywords = {ontologies},
pages = {116-131},
publisher = {Gesellschaft für Informatik},
series = {LNI},
title = {Semantic Methods and Tools for Information Portals},
volume = 34,
year = 2003
}%0 Conference Paper
%1 agarwal03semantic
%A Agarwal, Sudhir
%A Fankhauser, Peter
%A Gonzalez-Ollala, Jorge
%A Hartmann, Jens
%A Hollfelder, Silvia
%A Jameson, Anthony
%A Klink, Stefan
%A Lehti, Patrick
%A Ley, Michael
%A Rabbidge, Emma
%A Schwarzkopf, Eric
%A Shrestha, Nitesh
%A Stojanovic, Nenad
%A Studer, Rudi
%A Stumme, Gerd
%A Walter, Bernd
%B INFORMATIK 2003 -- Innovative Informatikanwendungen (Band 1)
%C Bonn
%D 2003
%E Dittrich, K.
%E König, W.
%E Oberweis, A.
%E Rannenberg, K.
%E Wahlster, W.
%I Gesellschaft für Informatik
%P 116-131
%T Semantic Methods and Tools for Information Portals
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/agarwal2003semantic.pdf
%V 34
%X The paper describes a set of approaches for representing and accessing information within a semantically structured information portal, while offering the possibility to integrate own information. It discusses research performed within the project `Semantic Methods and Tools for Information Portals (SemIPort)'. In particular, it focuses on (1) the development of scalable storing, processing and querying methods for semantic data, (2) visualization and browsing of complex data inventories, (3) personalization and agent-based interaction, and (4) the enhancement of web mining approaches for use within a semantics-based portal. - 1.Stumme, G., Ehrig, M., Handschuh, S., Hotho, A., Maedche, A., Motik, B., Oberle, D., Schmitz, C., Staab, S., Stojanovic, L., Stojanovic, N., Studer, R., Sure, Y., Volz, R., Zacharias, V.: The {K}arlsruhe view on ontologies. University of Karlsruhe, Institute AIFB (2003).
@techreport{stumme03,
author = {Stumme, Gerd and Ehrig, Marc and Handschuh, Siegfried and Hotho, Andreas and Maedche, Alexander and Motik, Boris and Oberle, Daniel and Schmitz, Christoph and Staab, Steffen and Stojanovic, Ljiljana and Stojanovic, Nenad and Studer, Rudi and Sure, York and Volz, Raphael and Zacharias, Valentin},
institution = {University of Karlsruhe, Institute AIFB},
keywords = {ontology},
title = {The {K}arlsruhe view on ontologies},
year = 2003
}%0 Report
%1 stumme03
%A Stumme, Gerd
%A Ehrig, Marc
%A Handschuh, Siegfried
%A Hotho, Andreas
%A Maedche, Alexander
%A Motik, Boris
%A Oberle, Daniel
%A Schmitz, Christoph
%A Staab, Steffen
%A Stojanovic, Ljiljana
%A Stojanovic, Nenad
%A Studer, Rudi
%A Sure, York
%A Volz, Raphael
%A Zacharias, Valentin
%D 2003
%T The {K}arlsruhe view on ontologies - 1.Ganter, B., Stumme, G.: Creation and Merging of Ontology Top-Levels. In: de Moor, A., Lex, W., and Ganter, B. (eds.) Conceptual Structures for Knowledge Creation and Communication. pp. 131–145. Springer, Heidelberg (2003).We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top--down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.
@inproceedings{ganter03creation,
abstract = {We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top--down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.},
address = {Heidelberg},
author = {Ganter, Bernhard and Stumme, Gerd},
booktitle = {Conceptual Structures for Knowledge Creation and Communication.},
editor = {de Moor, Aldo and Lex, Wilfried and Ganter, Bernhard},
keywords = {ontologies},
pages = {131-145},
publisher = {Springer},
series = {LNAI},
title = {Creation and Merging of Ontology Top-Levels},
volume = 2746,
year = 2003
}%0 Conference Paper
%1 ganter03creation
%A Ganter, Bernhard
%A Stumme, Gerd
%B Conceptual Structures for Knowledge Creation and Communication.
%C Heidelberg
%D 2003
%E de Moor, Aldo
%E Lex, Wilfried
%E Ganter, Bernhard
%I Springer
%P 131-145
%T Creation and Merging of Ontology Top-Levels
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/ganter2003creation.pdf
%V 2746
%X We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top--down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level. - 1.Hotho, A., Staab, S., Stumme, G.: Text Clustering Based on Background Knowledge. University of Karlsruhe, Institute AIFB (2003).Text document clustering plays an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. Standard partitional or agglomerative clustering methods efficiently compute results to this end. However, the bag of words representation used for these clustering methods is often unsatisfactory as it ignores relationships between important terms that do not co-occur literally. Also, it is mostly left to the user to find out why a particular partitioning has been achieved, because it is only specified extensionally. In order to deal with the two problems, we integrate background knowledge into the process of clustering text documents. First, we preprocess the texts, enriching their representations by background knowledge provided in a core ontology — in our application Wordnet. Then, we cluster the documents by a partitional algorithm. Our experimental evaluation on Reuters newsfeeds compares clustering results with pre-categorizations of news. In the experiments, improvements of results by background knowledge compared to the baseline can be shown for many interesting tasks. Second, the clustering partitions the large number of documents to a relatively small number of clusters, which may then be analyzed by conceptual clustering. In our approach, we applied Formal Concept Analysis. Conceptual clustering techniques are known to be too slow for directly clustering several hundreds of documents, but they give an intensional account of cluster results. They allow for a concise description of commonalities and distinctions of different clusters. With background knowledge they even find abstractions like “food” (vs. specializations like “beef” or “corn”). Thus, in our approach, partitional clustering reduces first the size of the problem such that it becomes tractable for conceptual clustering, which then facilitates the understanding of the results.
@techreport{hotho03textclustering,
abstract = {Text document clustering plays an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. Standard partitional or agglomerative clustering methods efficiently compute results to this end. However, the bag of words representation used for these clustering methods is often unsatisfactory as it ignores relationships between important terms that do not co-occur literally. Also, it is mostly left to the user to find out why a particular partitioning has been achieved, because it is only specified extensionally. In order to deal with the two problems, we integrate background knowledge into the process of clustering text documents. First, we preprocess the texts, enriching their representations by background knowledge provided in a core ontology — in our application Wordnet. Then, we cluster the documents by a partitional algorithm. Our experimental evaluation on Reuters newsfeeds compares clustering results with pre-categorizations of news. In the experiments, improvements of results by background knowledge compared to the baseline can be shown for many interesting tasks. Second, the clustering partitions the large number of documents to a relatively small number of clusters, which may then be analyzed by conceptual clustering. In our approach, we applied Formal Concept Analysis. Conceptual clustering techniques are known to be too slow for directly clustering several hundreds of documents, but they give an intensional account of cluster results. They allow for a concise description of commonalities and distinctions of different clusters. With background knowledge they even find abstractions like “food” (vs. specializations like “beef” or “corn”). Thus, in our approach, partitional clustering reduces first the size of the problem such that it becomes tractable for conceptual clustering, which then facilitates the understanding of the results.},
author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd},
institution = {University of Karlsruhe, Institute AIFB},
keywords = {ontologies},
title = {Text Clustering Based on Background Knowledge},
type = {Technical Report},
volume = 425,
year = 2003
}%0 Report
%1 hotho03textclustering
%A Hotho, Andreas
%A Staab, Steffen
%A Stumme, Gerd
%D 2003
%T Text Clustering Based on Background Knowledge
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003text.pdf
%V 425
%X Text document clustering plays an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. Standard partitional or agglomerative clustering methods efficiently compute results to this end. However, the bag of words representation used for these clustering methods is often unsatisfactory as it ignores relationships between important terms that do not co-occur literally. Also, it is mostly left to the user to find out why a particular partitioning has been achieved, because it is only specified extensionally. In order to deal with the two problems, we integrate background knowledge into the process of clustering text documents. First, we preprocess the texts, enriching their representations by background knowledge provided in a core ontology — in our application Wordnet. Then, we cluster the documents by a partitional algorithm. Our experimental evaluation on Reuters newsfeeds compares clustering results with pre-categorizations of news. In the experiments, improvements of results by background knowledge compared to the baseline can be shown for many interesting tasks. Second, the clustering partitions the large number of documents to a relatively small number of clusters, which may then be analyzed by conceptual clustering. In our approach, we applied Formal Concept Analysis. Conceptual clustering techniques are known to be too slow for directly clustering several hundreds of documents, but they give an intensional account of cluster results. They allow for a concise description of commonalities and distinctions of different clusters. With background knowledge they even find abstractions like “food” (vs. specializations like “beef” or “corn”). Thus, in our approach, partitional clustering reduces first the size of the problem such that it becomes tractable for conceptual clustering, which then facilitates the understanding of the results. - 1.Stumme, G.: Off to New Shores -- Conceptual Knowledge Discovery and Processing. Intl. J. Human-Comuter Studies (IJHCS). 59, 287–325 (2003).In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyzes why and how FCA and computer science attracted each other. It discusses FCA as a knowledge representation formalism using five knowledge representation principles provided by Davis, Shrobe, and Szolovits (1993). It then studies how and why mathematics-based researchers got attracted by computer science. We will argue for continuing this trend by integrating the two research areas FCA and Ontology Engineering. The second part of the article discusses three lines of research which witness the new orientation of Formal Concept Analysis: FCA as a conceptual clustering technique and its application for supporting the merging of ontologies; the efficient computation of association rules and the structuring of the results; and the visualization and management of conceptual hierarchies and ontologies including its application in an email management system.
@article{stumme03off,
abstract = {In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyzes why and how FCA and computer science attracted each other. It discusses FCA as a knowledge representation formalism using five knowledge representation principles provided by Davis, Shrobe, and Szolovits (1993). It then studies how and why mathematics-based researchers got attracted by computer science. We will argue for continuing this trend by integrating the two research areas FCA and Ontology Engineering. The second part of the article discusses three lines of research which witness the new orientation of Formal Concept Analysis: FCA as a conceptual clustering technique and its application for supporting the merging of ontologies; the efficient computation of association rules and the structuring of the results; and the visualization and management of conceptual hierarchies and ontologies including its application in an email management system.},
author = {Stumme, G.},
journal = {Intl. J. Human-Comuter Studies (IJHCS)},
keywords = {Conceptual},
month = {09},
number = 3,
pages = {287-325},
title = {Off to New Shores -- Conceptual Knowledge Discovery and Processing},
volume = 59,
year = 2003
}%0 Journal Article
%1 stumme03off
%A Stumme, G.
%D 2003
%J Intl. J. Human-Comuter Studies (IJHCS)
%N 3
%P 287-325
%T Off to New Shores -- Conceptual Knowledge Discovery and Processing
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/stumme2003off.pdf
%V 59
%X In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyzes why and how FCA and computer science attracted each other. It discusses FCA as a knowledge representation formalism using five knowledge representation principles provided by Davis, Shrobe, and Szolovits (1993). It then studies how and why mathematics-based researchers got attracted by computer science. We will argue for continuing this trend by integrating the two research areas FCA and Ontology Engineering. The second part of the article discusses three lines of research which witness the new orientation of Formal Concept Analysis: FCA as a conceptual clustering technique and its application for supporting the merging of ontologies; the efficient computation of association rules and the structuring of the results; and the visualization and management of conceptual hierarchies and ontologies including its application in an email management system. - 1.Cole, R.J., Eklund, P.W., Stumme, G.: Document Retrieval for Email Search and Discovery using Formal Concept Analysis. Journal of Applied Artificial Intelligence (AAI). 17, 257–280 (2003).This paper discusses an document discovery tool based on conceptual clustering by formal concept analysis. The program allows users to navigate email using a visual lattice metaphor rather than a tree. It implements a virtual file structure over email where files and entire directories can appear in multiple positions. The content and shape of the lattice formed by the conceptual ontology can assist in email discovery. The system described provides more flexibility in retrieving stored emails than what is normally available in email clients. The paper discusses how conceptual ontologies can leverage traditional document retrieval systems and aid knowledge discovery in document collections.
@article{cole03document,
abstract = {This paper discusses an document discovery tool based on conceptual clustering by formal concept analysis. The program allows users to navigate email using a visual lattice metaphor rather than a tree. It implements a virtual file structure over email where files and entire directories can appear in multiple positions. The content and shape of the lattice formed by the conceptual ontology can assist in email discovery. The system described provides more flexibility in retrieving stored emails than what is normally available in email clients. The paper discusses how conceptual ontologies can leverage traditional document retrieval systems and aid knowledge discovery in document collections.},
author = {Cole, Richard J. and Eklund, Peter W. and Stumme, Gerd},
journal = {Journal of Applied Artificial Intelligence (AAI)},
keywords = {information},
number = 3,
pages = {257-280},
title = {Document Retrieval for Email Search and Discovery using Formal Concept Analysis},
volume = 17,
year = 2003
}%0 Journal Article
%1 cole03document
%A Cole, Richard J.
%A Eklund, Peter W.
%A Stumme, Gerd
%D 2003
%J Journal of Applied Artificial Intelligence (AAI)
%N 3
%P 257-280
%T Document Retrieval for Email Search and Discovery using Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/AAI03_emails.pdf
%V 17
%X This paper discusses an document discovery tool based on conceptual clustering by formal concept analysis. The program allows users to navigate email using a visual lattice metaphor rather than a tree. It implements a virtual file structure over email where files and entire directories can appear in multiple positions. The content and shape of the lattice formed by the conceptual ontology can assist in email discovery. The system described provides more flexibility in retrieving stored emails than what is normally available in email clients. The paper discusses how conceptual ontologies can leverage traditional document retrieval systems and aid knowledge discovery in document collections. - 1.Hotho, A., Stumme, G. eds.: Lehren -- Lernen -- Wissen -- Adaptivität. Workshopwoche der GI-Fachgruppen/Arbeitskreise FGML, FGWM, ABIS, AKKD. , Universität Karlsruhe (2003).
@proceedings{hotho03lehren,
address = {Universität Karlsruhe},
editor = {Hotho, A. and Stumme, G.},
keywords = {akkd},
month = 10,
title = {Lehren -- Lernen -- Wissen -- Adaptivität. Workshopwoche der GI-Fachgruppen/Arbeitskreise FGML, FGWM, ABIS, AKKD},
year = 2003
}%0 Conference Proceedings
%1 hotho03lehren
%C Universität Karlsruhe
%D 2003
%E Hotho, A.
%E Stumme, G.
%T Lehren -- Lernen -- Wissen -- Adaptivität. Workshopwoche der GI-Fachgruppen/Arbeitskreise FGML, FGWM, ABIS, AKKD
%U http://km.aifb.uni-karlsruhe.de/ws/LLWA/ - 1.Tane, J., Schmitz, C., Stumme, G., Staab, S., Studer, R.: The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material. In: David, K. and Wegner, L. (eds.) Mobiles Lernen und Forschen - Beiträge der Fachtagung an der Universität. pp. 93–104. Kassel University Press (2003).Topics in education are changing with an ever faster pace. E-Learning resources tend to be more and more decentralised. Users need increasingly to be able to use the resources of the web. For this, they should have tools for finding and organizing information in a decentral way. In this, paper, we show how an ontology-based tool suite allows to make the most of the resources available on the web.
@inproceedings{tane03courseware,
abstract = {Topics in education are changing with an ever faster pace. E-Learning resources tend to be more and more decentralised. Users need increasingly to be able to use the resources of the web. For this, they should have tools for finding and organizing information in a decentral way. In this, paper, we show how an ontology-based tool suite allows to make the most of the resources available on the web.},
author = {Tane, Julien and Schmitz, Christoph and Stumme, Gerd and Staab, Steffen and Studer, R.},
booktitle = {Mobiles Lernen und Forschen - Beiträge der Fachtagung an der Universität},
editor = {David, Klaus and Wegner, Lutz},
keywords = {ontologies},
month = 11,
pages = {93-104},
publisher = {Kassel University Press},
title = {The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material},
year = 2003
}%0 Conference Paper
%1 tane03courseware
%A Tane, Julien
%A Schmitz, Christoph
%A Stumme, Gerd
%A Staab, Steffen
%A Studer, R.
%B Mobiles Lernen und Forschen - Beiträge der Fachtagung an der Universität
%D 2003
%E David, Klaus
%E Wegner, Lutz
%I Kassel University Press
%P 93-104
%T The Courseware Watchdog: an Ontology-based tool for finding and organizing learning material
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/tane2003courseware.pdf
%X Topics in education are changing with an ever faster pace. E-Learning resources tend to be more and more decentralised. Users need increasingly to be able to use the resources of the web. For this, they should have tools for finding and organizing information in a decentral way. In this, paper, we show how an ontology-based tool suite allows to make the most of the resources available on the web. - 1.Hotho, A., Staab, S., Stumme, G.: Ontologies improve text document clustering. In: Proceedings of the 2003 IEEE International Conference on Data Mining. pp. 541–544 (Poster. IEEE {C}omputer {S}ociety, Melbourne, Florida (2003).
@inproceedings{hotho03ontologies,
address = {Melbourne, Florida},
author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd},
booktitle = {Proceedings of the 2003 IEEE International Conference on Data Mining},
keywords = {ontologies},
month = 11,
pages = {541-544 (Poster},
publisher = {IEEE {C}omputer {S}ociety},
title = {Ontologies improve text document clustering},
year = 2003
}%0 Conference Paper
%1 hotho03ontologies
%A Hotho, Andreas
%A Staab, Steffen
%A Stumme, Gerd
%B Proceedings of the 2003 IEEE International Conference on Data Mining
%C Melbourne, Florida
%D 2003
%I IEEE {C}omputer {S}ociety
%P 541-544 (Poster
%T Ontologies improve text document clustering
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003ontologies.pdf - 1.Reimer, U., Abecker, A., Staab, A., Stumme, G. eds.: Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM 2003. Gesellschaft für Informatik, Bonn (2003).
@proceedings{reimer03professionelles,
address = {Bonn},
editor = {Reimer, U. and Abecker, A and Staab, A. and Stumme, G.},
keywords = {wissensmanagement},
publisher = {Gesellschaft für Informatik},
series = {LNI},
title = {Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM 2003},
volume = 28,
year = 2003
}%0 Conference Proceedings
%1 reimer03professionelles
%B LNI
%C Bonn
%D 2003
%E Reimer, U.
%E Abecker, A
%E Staab, A.
%E Stumme, G.
%I Gesellschaft für Informatik
%T Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM 2003
%U http://wm2003.aifb.uni-karlsruhe.de/
%V 28 - 1.Berendt, B., Hotho, A., Mladeni{\’c}, D., van Someren, M., Spiliopoulou, M., Stumme, G. eds.: Proceedings of the 1st European Web Mining Forum (EWMF 2003). , Cavtat/Dubrovnik, Croatia (2003).
@proceedings{berendt03european,
address = {Cavtat/Dubrovnik, Croatia},
editor = {Berendt, B. and Hotho, A. and Mladeni{\'c}, D. and van Someren, M. and Spiliopoulou, M. and Stumme, G.},
keywords = {Mining},
month = {09},
title = {Proceedings of the 1st European Web Mining Forum (EWMF 2003)},
year = 2003
}%0 Conference Proceedings
%1 berendt03european
%C Cavtat/Dubrovnik, Croatia
%D 2003
%E Berendt, B.
%E Hotho, A.
%E Mladeni{\'c}, D.
%E van Someren, M.
%E Spiliopoulou, M.
%E Stumme, G.
%T Proceedings of the 1st European Web Mining Forum (EWMF 2003)
%U http://km.aifb.uni-karlsruhe.de/ws/ewmf03/ - 1.Studer, R., Stumme, G., Handschuh, S., Hotho, A., Motik, B.: Building and Using the Semantic Web. In: New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational. pp. 31–34. , Osaka, Japan (2003).
@inproceedings{studer03building,
address = {Osaka, Japan},
author = {Studer, Rudi and Stumme, Gerd and Handschuh, Siegfried and Hotho, Andreas and Motik, B.},
booktitle = {New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational},
keywords = {ontologies},
month = {03},
pages = {31-34},
title = {Building and Using the Semantic Web},
year = 2003
}%0 Conference Paper
%1 studer03building
%A Studer, Rudi
%A Stumme, Gerd
%A Handschuh, Siegfried
%A Hotho, Andreas
%A Motik, B.
%B New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational
%C Osaka, Japan
%D 2003
%P 31-34
%T Building and Using the Semantic Web
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/Sanken03.pdf - 1.Hotho, A., Staab, S., Stumme, G.: Explaining Text Clustering Results using Semantic Structures. In: Lavra\v{c}, N., Gamberger, D., and Todorovski, H.B. (eds.) Knowledge Discovery in Databases: PKDD 2003, 7th European Conference on Principles and Practice of Knowledge Discovery in Databases. pp. 217–228. Springer, Heidelberg (2003).Common text clustering techniques offer rather poor capabilities for explaining to their users why a particular result has been achieved. They have the disadvantage that they do not relate semantically nearby terms and that they cannot explain how resulting clusters are related to each other. In this paper, we discuss a way of integrating a large thesaurus and the computation of lattices of resulting clusters into common text clustering in order to overcome these two problems. As its major result, our approach achieves an explanation using an appropriate level of granularity at the concept level as well as an appropriate size and complexity of the explaining lattice of resulting clusters.
@inproceedings{hotho03explaining,
abstract = {Common text clustering techniques offer rather poor capabilities for explaining to their users why a particular result has been achieved. They have the disadvantage that they do not relate semantically nearby terms and that they cannot explain how resulting clusters are related to each other. In this paper, we discuss a way of integrating a large thesaurus and the computation of lattices of resulting clusters into common text clustering in order to overcome these two problems. As its major result, our approach achieves an explanation using an appropriate level of granularity at the concept level as well as an appropriate size and complexity of the explaining lattice of resulting clusters.},
address = {Heidelberg},
author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd},
booktitle = {Knowledge Discovery in Databases: PKDD 2003, 7th European Conference on Principles and Practice of Knowledge Discovery in Databases},
editor = {Lavra\v{c}, Nada and Gamberger, Dragan and Todorovski, Hendrik BlockeelLjupco},
keywords = {ontologies},
pages = {217-228},
publisher = {Springer},
series = {LNAI},
title = {Explaining Text Clustering Results using Semantic Structures},
volume = 2838,
year = 2003
}%0 Conference Paper
%1 hotho03explaining
%A Hotho, Andreas
%A Staab, Steffen
%A Stumme, Gerd
%B Knowledge Discovery in Databases: PKDD 2003, 7th European Conference on Principles and Practice of Knowledge Discovery in Databases
%C Heidelberg
%D 2003
%E Lavra\v{c}, Nada
%E Gamberger, Dragan
%E Todorovski, Hendrik BlockeelLjupco
%I Springer
%P 217-228
%T Explaining Text Clustering Results using Semantic Structures
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003explaining.pdf
%V 2838
%X Common text clustering techniques offer rather poor capabilities for explaining to their users why a particular result has been achieved. They have the disadvantage that they do not relate semantically nearby terms and that they cannot explain how resulting clusters are related to each other. In this paper, we discuss a way of integrating a large thesaurus and the computation of lattices of resulting clusters into common text clustering in order to overcome these two problems. As its major result, our approach achieves an explanation using an appropriate level of granularity at the concept level as well as an appropriate size and complexity of the explaining lattice of resulting clusters.
2002
- 1.Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Pascal: un alogorithme d’extraction des motifs fréquents. Technique et Science Informatiques (TSI). 21, 65–95 (2002).
@article{bastide02unalogorithme,
author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
journal = {Technique et Science Informatiques (TSI)},
keywords = {closed},
number = 1,
pages = {65-95},
title = {Pascal: un alogorithme d'extraction des motifs fréquents},
volume = 21,
year = 2002
}%0 Journal Article
%1 bastide02unalogorithme
%A Bastide, Y.
%A Taouil, R.
%A Pasquier, N.
%A Stumme, G.
%A Lakhal, L.
%D 2002
%J Technique et Science Informatiques (TSI)
%N 1
%P 65-95
%T Pascal: un alogorithme d'extraction des motifs fréquents
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2001/TSI01.pdf
%V 21 - 1.Stumme, G.: Efficient Data Mining Based on Formal Concept Analysis. In: Hameurlain, A., Cicchetti, R., and Traunmüller, R. (eds.) Database and Expert Systems Applications. Proc. DEXA 2002. pp. 534–546. Springer, Heidelberg (2002).
@inproceedings{stumme02efficient,
address = {Heidelberg},
author = {Stumme, G.},
booktitle = {Database and Expert Systems Applications. Proc. DEXA 2002},
editor = {Hameurlain, A. and Cicchetti, R. and Traunmüller, R.},
keywords = {itemsets},
pages = {534-546},
publisher = {Springer},
series = {LNCS},
title = {Efficient Data Mining Based on Formal Concept Analysis},
volume = 2453,
year = 2002
}%0 Conference Paper
%1 stumme02efficient
%A Stumme, G.
%B Database and Expert Systems Applications. Proc. DEXA 2002
%C Heidelberg
%D 2002
%E Hameurlain, A.
%E Cicchetti, R.
%E Traunmüller, R.
%I Springer
%P 534-546
%T Efficient Data Mining Based on Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf
%V 2453 - 1.Ehrig, M., Handschuh, S., Hotho, A., Maedche, A., Motik, B., Oberle, D., Schmitz, C., Staab, S., Stojanovic, L., Stojanovic, N., Studer, R., Stumme, G., Sure, Y., Tane, J., Volz, R., Zacharias, V.: {KAON} - Towards a large scale {S}emantic {W}eb. In: Bauknecht, K., Tjoa, A.M., and Quirchmayr, G. (eds.) Proc. E-Commerce and Web Technologies, Third International Conference, EC-Web 2002. Springer, Aix-en-Provence %, France (2002).
@inproceedings{ehrig2002kaon,
address = {Aix-en-Provence %, France},
author = {Ehrig, Marc and Handschuh, Siegfried and Hotho, Andreas and Maedche, Alexander and Motik, Boris and Oberle, Daniel and Schmitz, Christoph and Staab, Steffen and Stojanovic, Ljiljana and Stojanovic, Nenad and Studer, Rudi and Stumme, Gerd and Sure, York and Tane, Julien and Volz, Raphael and Zacharias, Valentin},
booktitle = {Proc. E-Commerce and Web Technologies, Third International Conference, EC-Web 2002},
editor = {Bauknecht, Kurt and Tjoa, A. Min and Quirchmayr, Gerald},
keywords = {knowledge},
month = {09},
number = 2455,
publisher = {Springer},
series = {LNCS},
title = {{KAON} - Towards a large scale {S}emantic {W}eb},
year = 2002
}%0 Conference Paper
%1 ehrig2002kaon
%A Ehrig, Marc
%A Handschuh, Siegfried
%A Hotho, Andreas
%A Maedche, Alexander
%A Motik, Boris
%A Oberle, Daniel
%A Schmitz, Christoph
%A Staab, Steffen
%A Stojanovic, Ljiljana
%A Stojanovic, Nenad
%A Studer, Rudi
%A Stumme, Gerd
%A Sure, York
%A Tane, Julien
%A Volz, Raphael
%A Zacharias, Valentin
%B Proc. E-Commerce and Web Technologies, Third International Conference, EC-Web 2002
%C Aix-en-Provence %, France
%D 2002
%E Bauknecht, Kurt
%E Tjoa, A. Min
%E Quirchmayr, Gerald
%I Springer
%N 2455
%T {KAON} - Towards a large scale {S}emantic {W}eb - 1.Berendt, B., Hotho, A., Stumme, G. eds.: Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. on Machine Learning (ECML’02) / 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD’02). , Helsinki, Finland (2002).
@proceedings{berendt02semantic,
address = {Helsinki, Finland},
editor = {Berendt, B. and Hotho, A. and Stumme, G.},
keywords = {pkdd},
month = {08},
title = {Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. on Machine Learning (ECML'02) / 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'02)},
year = 2002
}%0 Conference Proceedings
%1 berendt02semantic
%C Helsinki, Finland
%D 2002
%E Berendt, B.
%E Hotho, A.
%E Stumme, G.
%T Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. on Machine Learning (ECML'02) / 6th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'02)
%U http://km.aifb.uni-karlsruhe.de/ws/semwebmine2002/online_html - 1.Gonzalez-Olalla, J., Stumme, G.: Semantic Methods and Tools for Information Portals - The {S}em{IP}ort Project (Project Description). In: Berendt, B., Hotho, A., and Stumme, G. (eds.) Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf. p. 90. , Helsinki (2002).
@inproceedings{gonzalez02semantic,
address = {Helsinki},
author = {Gonzalez-Olalla, J. and Stumme, G.},
booktitle = {Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf.},
editor = {Berendt, B. and Hotho, A. and Stumme, G.},
keywords = {ontologies},
month = {08},
pages = 90,
title = {Semantic Methods and Tools for Information Portals - The {S}em{IP}ort Project (Project Description)},
year = 2002
}%0 Conference Paper
%1 gonzalez02semantic
%A Gonzalez-Olalla, J.
%A Stumme, G.
%B Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf.
%C Helsinki
%D 2002
%E Berendt, B.
%E Hotho, A.
%E Stumme, G.
%P 90
%T Semantic Methods and Tools for Information Portals - The {S}em{IP}ort Project (Project Description)
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/gonzalez2002semantic.pdf - 1.Stumme, G., Berendt, B., Hotho, A.: Usage Mining for and on the Semantic Web. In: Proc. NSF Workshop on Next Generation Data Mining. pp. 77–86. , Baltimore (2002).
@inproceedings{stumme02usage,
address = {Baltimore},
author = {Stumme, G. and Berendt, B. and Hotho, A.},
booktitle = {Proc. NSF Workshop on Next Generation Data Mining},
keywords = 2002,
month = 11,
pages = {77-86},
title = {Usage Mining for and on the Semantic Web},
year = 2002
}%0 Conference Paper
%1 stumme02usage
%A Stumme, G.
%A Berendt, B.
%A Hotho, A.
%B Proc. NSF Workshop on Next Generation Data Mining
%C Baltimore
%D 2002
%P 77-86
%T Usage Mining for and on the Semantic Web
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/NSF-NGDM02.pdf - 1.Becker, P., Hereth, J., Stumme, G.: Toscana{J}: An Open Source Tool for Qualitative Data Analysis. In: Duquenne, V., Ganter, B., Liquiere, M., Nguifo, E.M., and Stumme, G. (eds.) Advances in Formal Concept Analysis for Knowledge Discovery in Databases. pp. 1–2. , Lyon, France (2002).
@inproceedings{becker02toscana,
address = {Lyon, France},
author = {Becker, P. and Hereth, J. and Stumme, G.},
booktitle = {Advances in Formal Concept Analysis for Knowledge Discovery in Databases.},
editor = {Duquenne, V. and Ganter, B. and Liquiere, M. and Nguifo, E. M. and Stumme, G.},
keywords = {open},
month = {07},
pages = {1-2},
title = {Toscana{J}: An Open Source Tool for Qualitative Data Analysis},
year = 2002
}%0 Conference Paper
%1 becker02toscana
%A Becker, P.
%A Hereth, J.
%A Stumme, G.
%B Advances in Formal Concept Analysis for Knowledge Discovery in Databases.
%C Lyon, France
%D 2002
%E Duquenne, V.
%E Ganter, B.
%E Liquiere, M.
%E Nguifo, E. M.
%E Stumme, G.
%P 1-2
%T Toscana{J}: An Open Source Tool for Qualitative Data Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/FCAKDD02.pdf - 1.Duquenne, V., Ganter, B., Liquiere, M., Nguifo, E.M., Stumme, G. eds.: Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI 2002). , Lyon, France (2002).
@proceedings{duquenne02advanced,
address = {Lyon, France},
editor = {Duquenne, V. and Ganter, B. and Liquiere, M. and Nguifo, E. M. and Stumme, G.},
keywords = {analysis},
month = {07},
title = {Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI 2002)},
year = 2002
}%0 Conference Proceedings
%1 duquenne02advanced
%C Lyon, France
%D 2002
%E Duquenne, V.
%E Ganter, B.
%E Liquiere, M.
%E Nguifo, E. M.
%E Stumme, G.
%T Advances in Formal Concept Analysis for Knowledge Discovery in Databases. Proc. Workshop FCAKDD of the 15th European Conference on Artificial Intelligence (ECAI 2002)
%U http://www.lirmm.fr/~liquiere/Documents/FCAKDDProceedings2002.pdf - 1.Ganter, B., Stumme, G.: Creation and Merging of Ontology Top-Levels. In: Maedche, A., Sattler, K.-U., and Stumme, G. (eds.) Information Integration and Mining in Databases and on the Web. pp. 37–52. , Karlsruhe (2002).We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top-down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.
@inproceedings{ganter02creation,
abstract = {We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top-down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level.},
address = {Karlsruhe},
author = {Ganter, B. and Stumme, G.},
booktitle = {Information Integration and Mining in Databases and on the Web.},
editor = {Maedche, A. and Sattler, K.-U and Stumme, G.},
keywords = 2002,
month = {07},
pages = {37-52},
title = {Creation and Merging of Ontology Top-Levels},
year = 2002
}%0 Conference Paper
%1 ganter02creation
%A Ganter, B.
%A Stumme, G.
%B Information Integration and Mining in Databases and on the Web.
%C Karlsruhe
%D 2002
%E Maedche, A.
%E Sattler, K.-U
%E Stumme, G.
%P 37-52
%T Creation and Merging of Ontology Top-Levels
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/ganter2002creating.pdf
%X We provide a new method for systematically structuring the top-down level of ontologies. It is based on an interactive, top-down knowledge acquisition process, which assures that the knowledge engineer considers all possible cases while avoiding redundant acquisition. The method is suited especially for creating/merging the top part(s) of the ontologies, where high accuracy is required, and for supporting the merging of two (or more) ontologies on that level. - 1.Stumme, G.: E-{L}earning: vom {N}ürnberger {T}richter zum weltweiten {N}etz. Karlsruher Transfer. 27, 14–17 (2002).
@article{stumme02elearning,
author = {Stumme, G.},
journal = {Karlsruher Transfer},
keywords = {eLearning},
pages = {14-17},
title = {E-{L}earning: vom {N}ürnberger {T}richter zum weltweiten {N}etz},
volume = 27,
year = 2002
}%0 Journal Article
%1 stumme02elearning
%A Stumme, G.
%D 2002
%J Karlsruher Transfer
%P 14-17
%T E-{L}earning: vom {N}ürnberger {T}richter zum weltweiten {N}etz
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/KarlsruherTransfer02.pdf
%V 27 - 1.Fernandez-Lopez, M., Gomez-Perez, A., Euzenat, J., Gangemi, A., Kalfoglou, Y., Pisanelli, D., Schorlemmer, M., Steve, G., Stojanovic, L., Stumme, G., Sure, Y.: A survey on methodologies for developing, maintaining, integration, evaluation and reengineering ontologies. Universidad Politecnia de Madrid (2002).
@techreport{fernandez02survey,
author = {Fernandez-Lopez, Mariano and Gomez-Perez, Asun and Euzenat, Jerome and Gangemi, Aldo and Kalfoglou, Y. and Pisanelli, D. and Schorlemmer, M. and Steve, G. and Stojanovic, Ljilajana and Stumme, Gerd and Sure, York},
institution = {Universidad Politecnia de Madrid},
keywords = {ontology},
title = {A survey on methodologies for developing, maintaining, integration, evaluation and reengineering ontologies},
type = {OntoWeb deliverable},
year = 2002
}%0 Report
%1 fernandez02survey
%A Fernandez-Lopez, Mariano
%A Gomez-Perez, Asun
%A Euzenat, Jerome
%A Gangemi, Aldo
%A Kalfoglou, Y.
%A Pisanelli, D.
%A Schorlemmer, M.
%A Steve, G.
%A Stojanovic, Ljilajana
%A Stumme, Gerd
%A Sure, York
%D 2002
%T A survey on methodologies for developing, maintaining, integration, evaluation and reengineering ontologies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/OntoWeb_Del_1-4.pdf - 1.Berendt, B., Hotho, A., Stumme, G.: Towards Semantic Web Mining. In: Horrocks, I. and Hendler, J. (eds.) The Semantic Web -- ISWC 2002. pp. 264–278. Springer, Heidelberg (2002).
@inproceedings{berendt02towards,
address = {Heidelberg},
author = {Berendt, B. and Hotho, A. and Stumme, G.},
booktitle = {The Semantic Web -- ISWC 2002},
editor = {Horrocks, I. and Hendler, J.},
keywords = 2002,
pages = {264-278},
publisher = {Springer},
series = {LNCS},
title = {Towards Semantic Web Mining},
year = 2002
}%0 Conference Paper
%1 berendt02towards
%A Berendt, B.
%A Hotho, A.
%A Stumme, G.
%B The Semantic Web -- ISWC 2002
%C Heidelberg
%D 2002
%E Horrocks, I.
%E Hendler, J.
%I Springer
%P 264-278
%T Towards Semantic Web Mining
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/ISWC02.pdf - 1.Stumme, G.: Formal Concept Analysis on its Way from Mathematics to Computer Science. In: Priss, U., Corbett, D., and Angelova, G. (eds.) Conceptual Structures: Integration and Interfaces. pp. 2–19. Springer, Heidelberg (2002).
@inproceedings{stumme02formalconcept,
address = {Heidelberg},
author = {Stumme, G.},
booktitle = {Conceptual Structures: Integration and Interfaces},
editor = {Priss, U. and Corbett, D. and Angelova, G.},
keywords = {mathematik},
note = {Invited Talk, summary of \cite{stumme03offtonew}},
pages = {2-19},
publisher = {Springer},
series = {LNAI},
title = {Formal Concept Analysis on its Way from Mathematics to Computer Science},
volume = 2393,
year = 2002
}%0 Conference Paper
%1 stumme02formalconcept
%A Stumme, G.
%B Conceptual Structures: Integration and Interfaces
%C Heidelberg
%D 2002
%E Priss, U.
%E Corbett, D.
%E Angelova, G.
%I Springer
%P 2-19
%T Formal Concept Analysis on its Way from Mathematics to Computer Science
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/ICCS02.pdf
%V 2393 - 1.Schmitz, C., Staab, S., Studer, R., Stumme, G., Tane, J.: Accessing Distributed Learning Repositories through a Courseware Watchdog. In: Driscoll, M. and Reeves, T. (eds.) Proc. of E-Learning 2002 World Conference on E-Learning in Corporate, Government, Healthcare and Higher Education on (E-Learning 2002). pp. 909–915. , Norfolk (2002).
@inproceedings{schmitz02accessing,
address = {Norfolk},
author = {Schmitz, C. and Staab, S. and Studer, R. and Stumme, G. and Tane, J.},
booktitle = {Proc. of E-Learning 2002 World Conference on E-Learning in Corporate, Government, Healthcare and Higher Education on (E-Learning 2002)},
editor = {Driscoll, M. and Reeves, T.C.},
keywords = {ontologies},
note = {{A}warded paper},
pages = {909-915},
title = {Accessing Distributed Learning Repositories through a Courseware Watchdog},
volume = {AACE},
year = 2002
}%0 Conference Paper
%1 schmitz02accessing
%A Schmitz, C.
%A Staab, S.
%A Studer, R.
%A Stumme, G.
%A Tane, J.
%B Proc. of E-Learning 2002 World Conference on E-Learning in Corporate, Government, Healthcare and Higher Education on (E-Learning 2002)
%C Norfolk
%D 2002
%E Driscoll, M.
%E Reeves, T.C.
%P 909-915
%T Accessing Distributed Learning Repositories through a Courseware Watchdog
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/E-Learn02.pdf
%V AACE - 1.Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC. Data \& Knowledge Engineering. 42, 189–222 (2002). https://doi.org/10.1016/S0169-023X(02)00057-5.We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.
@article{stumme2002computing,
abstract = {We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.},
address = {Amsterdam, The Netherlands, The Netherlands},
author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi},
journal = {Data \& Knowledge Engineering},
keywords = {icfca},
number = 2,
pages = {189--222},
publisher = {Elsevier Science Publishers B. V.},
title = {Computing iceberg concept lattices with TITANIC},
volume = 42,
year = 2002
}%0 Journal Article
%1 stumme2002computing
%A Stumme, Gerd
%A Taouil, Rafik
%A Bastide, Yves
%A Pasquier, Nicolas
%A Lakhal, Lotfi
%C Amsterdam, The Netherlands, The Netherlands
%D 2002
%I Elsevier Science Publishers B. V.
%J Data \& Knowledge Engineering
%N 2
%P 189--222
%R 10.1016/S0169-023X(02)00057-5
%T Computing iceberg concept lattices with TITANIC
%U http://portal.acm.org/citation.cfm?id=606457
%V 42
%X We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data. - 1.Stumme, G.: Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge. In: Becker, J. and Knackstedt, R. (eds.) Wissensmanagement mit Referenzmodellen -- Konzepte für die Anwendungssystem- und Organisationsgestaltung. pp. 163–174. Physica, Heidelberg (2002).
@incollection{stumme02using,
address = {Heidelberg},
author = {Stumme, G.},
booktitle = {Wissensmanagement mit Referenzmodellen -- Konzepte für die Anwendungssystem- und Organisationsgestaltung},
editor = {Becker, J. and Knackstedt, R.},
keywords = {ontologies},
pages = {163-174},
publisher = {Physica},
title = {Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge},
year = 2002
}%0 Book Section
%1 stumme02using
%A Stumme, G.
%B Wissensmanagement mit Referenzmodellen -- Konzepte für die Anwendungssystem- und Organisationsgestaltung
%C Heidelberg
%D 2002
%E Becker, J.
%E Knackstedt, R.
%I Physica
%P 163-174
%T Using Ontologies and Formal Concept Analysis for Organizing Business Knowledge
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2001/REFMOD01.ps - 1.Stumme, G., Taouil, R., Bastide, Y., Pasqier, N., Lakhal, L.: Computing Iceberg Concept Lattices with {Titanic}. {J.} Data and KnowledgeEngineering (DKE). 42, 189–222 (2002).
@article{stumme02computing,
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasqier, N. and Lakhal, L.},
journal = {{J.} Data and KnowledgeEngineering (DKE)},
keywords = {itemsets},
number = 2,
pages = {189-222},
title = {Computing Iceberg Concept Lattices with {Titanic}},
volume = 42,
year = 2002
}%0 Journal Article
%1 stumme02computing
%A Stumme, G.
%A Taouil, R.
%A Bastide, Y.
%A Pasqier, N.
%A Lakhal, L.
%D 2002
%J {J.} Data and KnowledgeEngineering (DKE)
%N 2
%P 189-222
%T Computing Iceberg Concept Lattices with {Titanic}
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/stumme2002computing.pdf
%V 42 - 1.Hotho, A., Stumme, G.: Conceptual Clustering of Text Clusters. In: Kókai, G. and Zeidler, J. (eds.) Proc. Fachgruppentreffen Maschinelles Lernen (FGML 2002). pp. 37–45 (2002).
@inproceedings{hotho02conceptualclustering,
author = {Hotho, A. and Stumme, G.},
booktitle = {Proc. Fachgruppentreffen Maschinelles Lernen (FGML 2002)},
editor = {Kókai, G. and Zeidler, J.},
keywords = {analysis},
pages = {37-45},
title = {Conceptual Clustering of Text Clusters},
year = 2002
}%0 Conference Paper
%1 hotho02conceptualclustering
%A Hotho, A.
%A Stumme, G.
%B Proc. Fachgruppentreffen Maschinelles Lernen (FGML 2002)
%D 2002
%E Kókai, G.
%E Zeidler, J.
%P 37-45
%T Conceptual Clustering of Text Clusters
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/FGML02.pdf - 1.Bozsak, E., Ehrig, M., Handschuh, S., Hotho, A., Maedche, A., Motik, B., Oberle, D., Schmitz, C., Staab, S., Stojanovic, L., Stojanovic, N., Studer, R., Stumme, G., Sure, Y., Tane, J., Volz, R., Zacharias, V.: KAON - Towards a large scale Semantic Web. In: Bauknecht, K., Tjoa, A.M., and Quirchmayr, G. (eds.) Proceedings of the Third International Conference on E-Commerce and Web Technologies (EC-Web 2002), Aix-en-Provence, France. pp. 304–313. Springer (2002).
@inproceedings{bozsak2002towards,
author = {Bozsak, E. and Ehrig, Marc and Handschuh, Siegfried and Hotho, Andreas and Maedche, Alexander and Motik, Boris and Oberle, Daniel and Schmitz, Christoph and Staab, Steffen and Stojanovic, Ljiljana and Stojanovic, Nenad and Studer, Rudi and Stumme, Gerd and Sure, York and Tane, Julien and Volz, Raphael and Zacharias, Valentin},
booktitle = {Proceedings of the Third International Conference on E-Commerce and Web Technologies (EC-Web 2002), Aix-en-Provence, France},
editor = {Bauknecht, Kurt and Tjoa, A. Min and Quirchmayr, Gerald},
keywords = {ontologies},
pages = {304-313},
publisher = {Springer},
series = {LNCS},
title = {KAON - Towards a large scale Semantic Web},
volume = 2455,
year = 2002
}%0 Conference Paper
%1 bozsak2002towards
%A Bozsak, E.
%A Ehrig, Marc
%A Handschuh, Siegfried
%A Hotho, Andreas
%A Maedche, Alexander
%A Motik, Boris
%A Oberle, Daniel
%A Schmitz, Christoph
%A Staab, Steffen
%A Stojanovic, Ljiljana
%A Stojanovic, Nenad
%A Studer, Rudi
%A Stumme, Gerd
%A Sure, York
%A Tane, Julien
%A Volz, Raphael
%A Zacharias, Valentin
%B Proceedings of the Third International Conference on E-Commerce and Web Technologies (EC-Web 2002), Aix-en-Provence, France
%D 2002
%E Bauknecht, Kurt
%E Tjoa, A. Min
%E Quirchmayr, Gerald
%I Springer
%P 304-313
%T KAON - Towards a large scale Semantic Web
%U http://www.aifb.uni-karlsruhe.de/WBS/ysu/publications/2002_ecweb_kaon.pdf
%V 2455 - 1.Hartmann, J., Hotho, A., Stumme, G.: Semantic Web Mining for Building Information Portals (Position Paper). In: Proc. Arbeitskreistreffen Knowledge Discovery. , Oldenburg (2002).
@inproceedings{hartmann02semanticweb,
address = {Oldenburg},
author = {Hartmann, J. and Hotho, A. and Stumme, G.},
booktitle = {Proc. Arbeitskreistreffen Knowledge Discovery},
keywords = {ontologies},
month = {09},
title = {Semantic Web Mining for Building Information Portals (Position Paper)},
year = 2002
}%0 Conference Paper
%1 hartmann02semanticweb
%A Hartmann, J.
%A Hotho, A.
%A Stumme, G.
%B Proc. Arbeitskreistreffen Knowledge Discovery
%C Oldenburg
%D 2002
%T Semantic Web Mining for Building Information Portals (Position Paper)
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2002/hartmann2002semanticweb.pdf
2001
- 1.Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis. In: Baader, F., Brewker, G., and Eiter, T. (eds.) KI 2001: Advances in Artificial Intelligence. KI 2001. pp. 335–350. Springer, Heidelberg (2001).
@inproceedings{stumme01intelligent,
address = {Heidelberg},
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
booktitle = {KI 2001: Advances in Artificial Intelligence. KI 2001},
editor = {Baader, F. and Brewker, G. and Eiter, T.},
keywords = {itemsets},
pages = {335-350},
publisher = {Springer},
series = {LNAI},
title = {Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis},
volume = 2174,
year = 2001
}%0 Conference Paper
%1 stumme01intelligent
%A Stumme, G.
%A Taouil, R.
%A Bastide, Y.
%A Pasquier, N.
%A Lakhal, L.
%B KI 2001: Advances in Artificial Intelligence. KI 2001
%C Heidelberg
%D 2001
%E Baader, F.
%E Brewker, G.
%E Eiter, T.
%I Springer
%P 335-350
%T Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf
%V 2174 - 1.Stumme, G., Maedche, A.: Ontology Merging for Federated Ontologies for the Semantic Web. In: Franconi, E., Barker, K., and Calvanese, D. (eds.) Proc. Intl. Workshop on Foundations of Models for Information Integration (FMII’01) (2001).
@inproceedings{stumme01ontology,
author = {Stumme, G. and Maedche, A.},
booktitle = {Proc. Intl. Workshop on Foundations of Models for Information Integration (FMII'01)},
editor = {Franconi, E. and Barker, K. and Calvanese, D.},
keywords = {myown},
note = {{L}ong version of \cite{stumme01bottom}},
title = {Ontology Merging for Federated Ontologies for the Semantic Web},
year = 2001
}%0 Conference Paper
%1 stumme01ontology
%A Stumme, G.
%A Maedche, A.
%B Proc. Intl. Workshop on Foundations of Models for Information Integration (FMII'01)
%D 2001
%E Franconi, E.
%E Barker, K.
%E Calvanese, D.
%T Ontology Merging for Federated Ontologies for the Semantic Web
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2001/FMII01.pdf - 1.Hereth, J., Stumme, G.: Reverse Pivoting in Conceptual Information Systems. In: Delugach, H. and Stumme, G. (eds.) Conceptual Structures: Broadening the Base. pp. 202–215. Springer, Heidelberg (2001).
@inproceedings{hereth01reverse,
address = {Heidelberg},
author = {Hereth, J. and Stumme, G.},
booktitle = {Conceptual Structures: Broadening the Base.},
editor = {Delugach, H. and Stumme, G.},
keywords = {reverse},
pages = {202-215},
publisher = {Springer},
series = {LNAI},
title = {Reverse Pivoting in Conceptual Information Systems.},
volume = 2120,
year = 2001
}%0 Conference Paper
%1 hereth01reverse
%A Hereth, J.
%A Stumme, G.
%B Conceptual Structures: Broadening the Base.
%C Heidelberg
%D 2001
%E Delugach, H.
%E Stumme, G.
%I Springer
%P 202-215
%T Reverse Pivoting in Conceptual Information Systems.
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2001/ICCS01.pdf
%V 2120 - 1.Stumme, G., Maedche, A.: {FCA}-{M}erge: Bottom-Up Merging of Ontologies. In: Nebel, B. (ed.) Proc. 17th Intl. Conf. on Artificial Intelligence (IJCAI ’01). pp. 225–230. , Seattle, WA, USA (2001).
@inproceedings{stumme01bottom,
address = {Seattle, WA, USA},
author = {Stumme, G. and Maedche, A.},
booktitle = {Proc. 17th Intl. Conf. on Artificial Intelligence (IJCAI '01)},
editor = {Nebel, B.},
keywords = {ontologies},
pages = {225-230},
title = {{FCA}-{M}erge: Bottom-Up Merging of Ontologies.},
year = 2001
}%0 Conference Paper
%1 stumme01bottom
%A Stumme, G.
%A Maedche, A.
%B Proc. 17th Intl. Conf. on Artificial Intelligence (IJCAI '01)
%C Seattle, WA, USA
%D 2001
%E Nebel, B.
%P 225-230
%T {FCA}-{M}erge: Bottom-Up Merging of Ontologies.
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2001/IJCAI01.pdf - 1.Delugach, H., Stumme, G. eds.: Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures. Springer, Heidelberg (2001).
@proceedings{delugach01conceptual,
address = {Heidelberg},
editor = {Delugach, H. and Stumme, G.},
keywords = {cgs},
publisher = {Springer},
series = {LNAI},
title = {Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures},
volume = 2120,
year = 2001
}%0 Conference Proceedings
%1 delugach01conceptual
%B LNAI
%C Heidelberg
%D 2001
%E Delugach, H.
%E Stumme, G.
%I Springer
%T Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures
%V 2120 - 1.Gronau, N., Stumme, G. eds.: Methoden und Techniken der Wissensverarbeitung. Workshop der 1. Tagung Professionelles Wissensmanagement -- Erfahrungen und Visionen. Shaker, Aachen (2001).
@proceedings{gronau01methoden,
address = {Aachen},
editor = {Gronau, N. and Stumme, G.},
keywords = {wissensmanagement},
pages = {287-378},
publisher = {Shaker},
title = {Methoden und Techniken der Wissensverarbeitung. Workshop der 1. Tagung Professionelles Wissensmanagement -- Erfahrungen und Visionen},
year = 2001
}%0 Conference Proceedings
%1 gronau01methoden
%C Aachen
%D 2001
%E Gronau, N.
%E Stumme, G.
%I Shaker
%P 287-378
%T Methoden und Techniken der Wissensverarbeitung. Workshop der 1. Tagung Professionelles Wissensmanagement -- Erfahrungen und Visionen
%U http://wm2001.aifb.uni-karlsruhe.de/ws/ws7.html - 1.Schnurr, H.P., Staab, S., Studer, R., Stumme, G., Sure, Y. eds.: Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM ’01. Shaker, Aachen (2001).
@proceedings{schnurr01professionnelles,
address = {Aachen},
editor = {Schnurr, H. P. and Staab, S. and Studer, R. and Stumme, G. and Sure, Y.},
keywords = {wissensmanagement},
publisher = {Shaker},
title = {Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM '01},
year = 2001
}%0 Conference Proceedings
%1 schnurr01professionnelles
%C Aachen
%D 2001
%E Schnurr, H. P.
%E Staab, S.
%E Studer, R.
%E Stumme, G.
%E Sure, Y.
%I Shaker
%T Professionelles Wissensmanagement -- Erfahrungen und Visionen. Proc. WM '01
%U http://wm2001.aifb.uni-karlsruhe.de/ - 1.Stumme, G., Maedche, A., Staab, S. eds.: Ontologies. CEUR Proceedings, Aachen (2001).
@proceedings{stumme01ontologies,
address = {Aachen},
editor = {Stumme, G. and Maedche, A. and Staab, S.},
keywords = {ontologies},
publisher = {CEUR Proceedings},
series = {CEUR-Proceedings},
title = {Ontologies},
year = 2001
}%0 Conference Proceedings
%1 stumme01ontologies
%B CEUR-Proceedings
%C Aachen
%D 2001
%E Stumme, G.
%E Maedche, A.
%E Staab, S.
%I CEUR Proceedings
%T Ontologies
%U http://ceur-ws.org/Vol-48 - 1.Stumme, G., Hotho, A., Berendt, B. eds.: Semantic Web Mining. Workshop Proceedings. , Freiburg (2001).
@proceedings{stumme01semantic,
address = {Freiburg},
editor = {Stumme, G. and Hotho, A. and Berendt, B.},
keywords = {pkdd},
month = {09},
title = {Semantic Web Mining. Workshop Proceedings.},
year = 2001
}%0 Conference Proceedings
%1 stumme01semantic
%C Freiburg
%D 2001
%E Stumme, G.
%E Hotho, A.
%E Berendt, B.
%T Semantic Web Mining. Workshop Proceedings.
%U http://semwebmine2001.aifb.uni-karlsruhe.de/online.html - 1.Stumme, G., Taouil, R., Bastide, Y., Lakhal, L.: Conceptual Clustering with Iceberg Concept Lattices. In: Klinkenberg, R., Rüping, S., Fick, A., Henze, N., Herzog, C., Molitor, R., and Schröder, O. (eds.) Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML’01). , Universität Dortmund 763 (2001).
@inproceedings{stumme01conceptualclustering,
address = {Universität Dortmund 763},
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
editor = {Klinkenberg, R. and Rüping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schröder, O.},
keywords = {itemsets},
month = 10,
title = {Conceptual Clustering with Iceberg Concept Lattices},
year = 2001
}%0 Conference Paper
%1 stumme01conceptualclustering
%A Stumme, G.
%A Taouil, R.
%A Bastide, Y.
%A Lakhal, L.
%B Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)
%C Universität Dortmund 763
%D 2001
%E Klinkenberg, R.
%E Rüping, S.
%E Fick, A.
%E Henze, N.
%E Herzog, C.
%E Molitor, R.
%E Schröder, O.
%T Conceptual Clustering with Iceberg Concept Lattices
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf
2000
- 1.Cole, R., Stumme, G.: {CEM} - A Conceptual Email Manager. In: Ganter, B. and Mineau, G.W. (eds.) Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS ’00. pp. 438–452. Springer, Heidelberg (2000).
@inproceedings{cole2000conceptual,
address = {Heidelberg},
author = {Cole, R. and Stumme, G.},
booktitle = {Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00},
editor = {Ganter, B. and Mineau, G. W.},
keywords = {analysis},
note = {{P}art of \cite{cole03document}},
pages = {438-452},
publisher = {Springer},
series = {LNAI},
title = {{CEM} - A Conceptual Email Manager},
volume = 1867,
year = 2000
}%0 Conference Paper
%1 cole2000conceptual
%A Cole, R.
%A Stumme, G.
%B Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00
%C Heidelberg
%D 2000
%E Ganter, B.
%E Mineau, G. W.
%I Springer
%P 438-452
%T {CEM} - A Conceptual Email Manager
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/P2088_ICCS00_emails.pdf
%V 1867 - 1.Stumme, G., Wille, R. eds.: Begriffliche Wissensverarbeitung -- Methoden und Anwendungen. Springer, Heidelberg (2000).
@proceedings{stumme00begriffliche,
address = {Heidelberg},
editor = {Stumme, Gerd and Wille, Rudolf},
keywords = {knowledge},
publisher = {Springer},
title = {Begriffliche Wissensverarbeitung -- Methoden und Anwendungen},
year = 2000
}%0 Conference Proceedings
%1 stumme00begriffliche
%C Heidelberg
%D 2000
%E Stumme, Gerd
%E Wille, Rudolf
%I Springer
%T Begriffliche Wissensverarbeitung -- Methoden und Anwendungen
%U http://www.springer.com/dal/home/generic/search/results?SGWID=1-40109-22-2058937-0 - 1.Hereth, J., Stumme, G., Wille, R., Wille, U.: Conceptual Knowledge Discovery and Data Analysis. In: Ganter, B. and Mineau, G.W. (eds.) Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS ’00. pp. 421–437. Springer, Heidelberg (2000).
@inproceedings{hereth2000conceptual,
address = {Heidelberg},
author = {Hereth, J. and Stumme, G. and Wille, R. and Wille, U.},
booktitle = {Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00},
editor = {Ganter, B. and Mineau, G. W.},
keywords = {knowledge},
pages = {421-437},
publisher = {Springer},
series = {LNAI},
title = {Conceptual Knowledge Discovery and Data Analysis},
volume = 1867,
year = 2000
}%0 Conference Paper
%1 hereth2000conceptual
%A Hereth, J.
%A Stumme, G.
%A Wille, R.
%A Wille, U.
%B Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00
%C Heidelberg
%D 2000
%E Ganter, B.
%E Mineau, G. W.
%I Springer
%P 421-437
%T Conceptual Knowledge Discovery and Data Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/P2092_ICCS00_kdd.pdf
%V 1867 - 1.Cole, R., Eklund, P., Stumme, G.: {CEM} -- A Program for Visualization and Discovery in Email. In: Zighed, D., Komorowski, J., and Zytkow, J. (eds.) Principles of Data Mining and Knowledge Discovery. Proc. PKDD 2000. pp. 367–374. Springer, Heidelberg-Berlin (2000).
@inproceedings{cole00program,
address = {Heidelberg-Berlin},
author = {Cole, R. and Eklund, P. and Stumme, G.},
booktitle = {Principles of Data Mining and Knowledge Discovery. Proc. PKDD 2000},
editor = {Zighed, D.A. and Komorowski, J. and Zytkow, J.},
keywords = {analysis},
pages = {367-374},
publisher = {Springer},
series = {LNAI},
title = {{CEM} -- A Program for Visualization and Discovery in Email},
volume = 1910,
year = 2000
}%0 Conference Paper
%1 cole00program
%A Cole, R.
%A Eklund, P.
%A Stumme, G.
%B Principles of Data Mining and Knowledge Discovery. Proc. PKDD 2000
%C Heidelberg-Berlin
%D 2000
%E Zighed, D.A.
%E Komorowski, J.
%E Zytkow, J.
%I Springer
%P 367-374
%T {CEM} -- A Program for Visualization and Discovery in Email
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/PKDD00.pdf
%V 1910 - 1.Stumme, G. ed.: Working with Conceptual Structures -- Contributions to ICCS 2000. Suppl. Proc. 8th International Conference on Conceptual Structures (ICCS 2000). Shaker, Aachen (2000).
@proceedings{stumme00working,
address = {Aachen},
editor = {Stumme, G.},
keywords = {proceedings},
publisher = {Shaker},
title = {Working with Conceptual Structures -- Contributions to ICCS 2000. Suppl. Proc. 8th International Conference on Conceptual Structures (ICCS 2000)},
year = 2000
}%0 Conference Proceedings
%1 stumme00working
%C Aachen
%D 2000
%E Stumme, G.
%I Shaker
%T Working with Conceptual Structures -- Contributions to ICCS 2000. Suppl. Proc. 8th International Conference on Conceptual Structures (ICCS 2000) - 1.Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Levelwise Search of Frequent Patterns. In: Actes des 16ièmes Journées Bases de Données Avancées. pp. 307–322. Blois, France (2000).
@inproceedings{bastide00levelwise,
address = {France},
author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
booktitle = {Actes des 16ièmes Journées Bases de Données Avancées},
keywords = {algorithm},
month = 10,
pages = {307-322},
publisher = {Blois},
title = {Levelwise Search of Frequent Patterns},
year = 2000
}%0 Conference Paper
%1 bastide00levelwise
%A Bastide, Y.
%A Taouil, R.
%A Pasquier, N.
%A Stumme, G.
%A Lakhal, L.
%B Actes des 16ièmes Journées Bases de Données Avancées
%C France
%D 2000
%I Blois
%P 307-322
%T Levelwise Search of Frequent Patterns
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf - 1.Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Fast computation of concept lattices using data mining techniques. In: Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases. CEUR-Workshop Proceeding., Berlin (2000).
@inproceedings{Stum00fast,
address = {Berlin},
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
booktitle = {Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases},
keywords = 2000,
month = {21--22.August},
note = {{http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/}},
publisher = {CEUR-Workshop Proceeding.},
title = {Fast computation of concept lattices using data mining techniques.},
year = 2000
}%0 Conference Paper
%1 Stum00fast
%A Stumme, G.
%A Taouil, R.
%A Bastide, Y.
%A Pasquier, N.
%A Lakhal, L.
%B Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases
%C Berlin
%D 2000
%I CEUR-Workshop Proceeding.
%T Fast computation of concept lattices using data mining techniques. - 1.Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. SIGKDD Explorations, Special Issue on Scalable Algorithms. 2, 71–80 (2000).
@article{bastide00miningfrequent,
author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms},
keywords = {itemsets},
number = 2,
pages = {71-80},
title = {Mining Frequent Patterns with Counting Inference.},
volume = 2,
year = 2000
}%0 Journal Article
%1 bastide00miningfrequent
%A Bastide, Y.
%A Taouil, R.
%A Pasquier, N.
%A Stumme, G.
%A Lakhal, L.
%D 2000
%J SIGKDD Explorations, Special Issue on Scalable Algorithms
%N 2
%P 71-80
%T Mining Frequent Patterns with Counting Inference.
%V 2 - 1.Stumme, G., Studer, R., Sure, Y.: Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies. In: Bodendorf, F. and Grauer, M. (eds.) Verbundtagung Wirtschaftsinformatik 2000. pp. 136–149. Shaker, Aachen (2000).
@inproceedings{stumme00towardsanorder,
address = {Aachen},
author = {Stumme, G. and Studer, R. and Sure, Y.},
booktitle = {Verbundtagung Wirtschaftsinformatik 2000},
editor = {Bodendorf, F. and Grauer, M.},
keywords = {ontologies},
pages = {136-149},
publisher = {Shaker},
title = {Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies},
year = 2000
}%0 Conference Paper
%1 stumme00towardsanorder
%A Stumme, G.
%A Studer, R.
%A Sure, Y.
%B Verbundtagung Wirtschaftsinformatik 2000
%C Aachen
%D 2000
%E Bodendorf, F.
%E Grauer, M.
%I Shaker
%P 136-149
%T Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/REFMOD00.pdf - 1.Göbel, S., Heidemann, M., Jasnoch, U., Stumme, G.: Einsatz von {GIS} und {F}ormaler {B}egriffsanalyse in {A}ltlasten-{I}nformationssystemen. In: Tochtermann, K. and Riekert, W.-F. (eds.) Hypermedia im Umweltschutz. 3. Workshop in Ulm 2000. pp. 169–179. , Marburg (2000).
@inproceedings{goebel00einsatz,
address = {Marburg},
author = {Göbel, S. and Heidemann, M. and Jasnoch, U. and Stumme, G.},
booktitle = {Hypermedia im Umweltschutz. 3. Workshop in Ulm 2000},
editor = {Tochtermann, K. and Riekert, W.-F.},
keywords = {altlasten},
pages = {169-179},
title = {Einsatz von {GIS} und {F}ormaler {B}egriffsanalyse in {A}ltlasten-{I}nformationssystemen},
volume = {Umwelt-Informatik aktuell, Bd. 24},
year = 2000
}%0 Conference Paper
%1 goebel00einsatz
%A Göbel, S.
%A Heidemann, M.
%A Jasnoch, U.
%A Stumme, G.
%B Hypermedia im Umweltschutz. 3. Workshop in Ulm 2000
%C Marburg
%D 2000
%E Tochtermann, K.
%E Riekert, W.-F.
%P 169-179
%T Einsatz von {GIS} und {F}ormaler {B}egriffsanalyse in {A}ltlasten-{I}nformationssystemen
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/AKHU00.pdf
%V Umwelt-Informatik aktuell, Bd. 24 - 1.Stumme, G.: Begriffliche Wissensverarbeitung -- Methoden und Anwendungen. Springer, Heidelberg (2000).
@book{Stumme00begriffliche,
author = {Stumme, G.},
editor = {Stumme, G. and Wille, R.},
keywords = 2000,
publisher = {Springer, Heidelberg},
title = {Begriffliche Wissensverarbeitung -- Methoden und Anwendungen},
year = 2000
}%0 Book
%1 Stumme00begriffliche
%A Stumme, G.
%D 2000
%E Stumme, G.
%E Wille, R.
%I Springer, Heidelberg
%T Begriffliche Wissensverarbeitung -- Methoden und Anwendungen - 1.Eklund, P., Groh, B., Stumme, G., Wille, R.: Contextual-Logic Extension of TOSCANA. In: Ganter, B. and Mineau, G.W. (eds.) Conceptual Structures: Logical, Linguistic, and Computational. pp. 453–467. Springer, Heidelberg (2000).
@inproceedings{eklund00contextual,
address = {Heidelberg},
author = {Eklund, P. and Groh, B. and Stumme, G. and Wille, R.},
booktitle = {Conceptual Structures: Logical, Linguistic, and Computational},
editor = {Ganter, B. and Mineau, G. W.},
keywords = {iccs},
pages = {453-467},
publisher = {Springer},
series = {LNAI},
title = {Contextual-Logic Extension of TOSCANA.},
volume = 1867,
year = 2000
}%0 Conference Paper
%1 eklund00contextual
%A Eklund, P.
%A Groh, B.
%A Stumme, G.
%A Wille, R.
%B Conceptual Structures: Logical, Linguistic, and Computational
%C Heidelberg
%D 2000
%E Ganter, B.
%E Mineau, G. W.
%I Springer
%P 453-467
%T Contextual-Logic Extension of TOSCANA.
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/ICCS_toscanaextension.pdf
%V 1867 - 1.Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Fast Computation of Concept Lattices Using Data Mining Techniques. In: Bouzeghoub, M., Klusch, M., Nutt, W., and Sattler, U. (eds.) Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases (2000).
@inproceedings{stumme00fast,
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
booktitle = {Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases},
editor = {Bouzeghoub, M. and Klusch, M. and Nutt, W. and Sattler, U.},
keywords = {algorithm},
note = {\url{http://ceur-ws.org/Vol-29.} {P}art of \cite{stumme02computing}},
title = {Fast Computation of Concept Lattices Using Data Mining Techniques},
year = 2000
}%0 Conference Paper
%1 stumme00fast
%A Stumme, G.
%A Taouil, R.
%A Bastide, Y.
%A Pasquier, N.
%A Lakhal, L.
%B Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases
%D 2000
%E Bouzeghoub, M.
%E Klusch, M.
%E Nutt, W.
%E Sattler, U.
%T Fast Computation of Concept Lattices Using Data Mining Techniques
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/KRDB00.pdf - 1.Stumme, G.: Conceptual {O}n-{L}ine {A}nalytical {P}rocessing. In: Tanaka, K., Ghandeharizadeh, S., and Kambayashi, Y. (eds.) Information Organization and Databases. pp. 191–203. Kluwer, Boston-Dordrecht-London (2000).
@incollection{stumme00conceptual,
address = {Boston-Dordrecht-London},
author = {Stumme, G.},
booktitle = {Information Organization and Databases},
chapter = 14,
editor = {Tanaka, K. and Ghandeharizadeh, S. and Kambayashi, Y.},
keywords = {olap},
pages = {191-203},
publisher = {Kluwer},
title = {Conceptual {O}n-{L}ine {A}nalytical {P}rocessing},
year = 2000
}%0 Book Section
%1 stumme00conceptual
%A Stumme, G.
%B Information Organization and Databases
%C Boston-Dordrecht-London
%D 2000
%E Tanaka, K.
%E Ghandeharizadeh, S.
%E Kambayashi, Y.
%I Kluwer
%P 191-203
%T Conceptual {O}n-{L}ine {A}nalytical {P}rocessing
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/Kluwer00.ps
%& 14 - 1.Stumme, G.: 8th {I}nternational {C}onference on {C}onceptual {S}tructures. {C}onference {R}eport. Knowledge Organization. 27, 162 (2000).
@article{stumme008thinternational,
author = {Stumme, G.},
journal = {Knowledge Organization},
keywords = {report},
number = 3,
pages = 162,
title = {8th {I}nternational {C}onference on {C}onceptual {S}tructures. {C}onference {R}eport},
volume = 27,
year = 2000
}%0 Journal Article
%1 stumme008thinternational
%A Stumme, G.
%D 2000
%J Knowledge Organization
%N 3
%P 162
%T 8th {I}nternational {C}onference on {C}onceptual {S}tructures. {C}onference {R}eport
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/ConferenceReportICCS00.pdf
%V 27 - 1.Becker, K., Stumme, G., Wille, R., Wille, U., Zickwolff, M.: Conceptual Information Systems Discussed Through an {IT}-Security Tool. In: Dieng, R. and Corby, O. (eds.) Knowledge Engineering and Knowledge Management. Methods, Models, and Tools. pp. 352–365. Springer, Heidelberg (2000).
@inproceedings{becker00conceptual,
address = {Heidelberg},
author = {Becker, K. and Stumme, G. and Wille, R. and Wille, U. and Zickwolff, M.},
booktitle = {Knowledge Engineering and Knowledge Management. Methods, Models, and Tools.},
editor = {Dieng, R. and Corby, O.},
keywords = {lattices},
pages = {352-365},
publisher = {Springer},
series = {LNAI},
title = {Conceptual Information Systems Discussed Through an {IT}-Security Tool},
volume = 1937,
year = 2000
}%0 Conference Paper
%1 becker00conceptual
%A Becker, K.
%A Stumme, G.
%A Wille, R.
%A Wille, U.
%A Zickwolff, M.
%B Knowledge Engineering and Knowledge Management. Methods, Models, and Tools.
%C Heidelberg
%D 2000
%E Dieng, R.
%E Corby, O.
%I Springer
%P 352-365
%T Conceptual Information Systems Discussed Through an {IT}-Security Tool
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/EKAW00.pdf
%V 1937 - 1.Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets. In: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Laus, K.-K., Palamidessi, C., Pereira, L., Sagiv, Y., and Stuckey, P. (eds.) Computational Logic --- CL 2000 Proc. CL’00. Springer, Heidelberg (2000).
@inproceedings{bastide00miningminimal,
address = {Heidelberg},
author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},
booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.},
keywords = {itemsets},
publisher = {Springer},
series = {LNAI},
title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
volume = 1861,
year = 2000
}%0 Conference Paper
%1 bastide00miningminimal
%A Bastide, Y.
%A Pasquier, N.
%A Taouil, R.
%A Stumme, G.
%A Lakhal, L.
%B Computational Logic --- CL 2000 Proc. CL'00
%C Heidelberg
%D 2000
%E Lloyd, J.
%E Dahl, V.
%E Furbach, U.
%E Kerber, M.
%E Laus, K.-K.
%E Palamidessi, C.
%E Pereira, L.M.
%E Sagiv, Y.
%E Stuckey, P.J.
%I Springer
%T Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
%V 1861
1999
- 1.Stumme, G.: Hierarchies of Conceptual Scales. In: Gaines, T.B., Kremer, R., and Musen, M. (eds.) Proc.Workshop on Knowledge Acquisition, Modeling and Management (KAW’99). pp. 78–95. Banff (1999).
@inproceedings{stumme99hierarchies,
author = {Stumme, G.},
booktitle = {Proc.Workshop on Knowledge Acquisition, Modeling and Management (KAW'99)},
editor = {Gaines, T. B. and Kremer, R. and Musen, M.},
keywords = {ontologies},
month = 10,
pages = {78-95},
publisher = {Banff},
title = {Hierarchies of Conceptual Scales},
volume = 2,
year = 1999
}%0 Conference Paper
%1 stumme99hierarchies
%A Stumme, G.
%B Proc.Workshop on Knowledge Acquisition, Modeling and Management (KAW'99)
%D 1999
%E Gaines, T. B.
%E Kremer, R.
%E Musen, M.
%I Banff
%P 78-95
%T Hierarchies of Conceptual Scales
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1999/KAW99.pdf
%V 2 - 1.Stumme, G., Wolff, K.E.: Numerical Aspects in the Data Model of Conceptual Information Systems. In: Kambayashi, Y., Lee, D.K., Lim, E.-P., Mohania, M.K., and Masunaga, Y. (eds.) Advances in Database Technologies. Proc. Intl. Workshop on Data Warehousing and. pp. 117–128. Springer, Heidelberg (1999).
@inproceedings{stumme99numerical,
address = {Heidelberg},
author = {Stumme, G. and Wolff, K. E.},
booktitle = {Advances in Database Technologies. Proc. Intl. Workshop on Data Warehousing and},
editor = {Kambayashi, Y. and Lee, Dik Kun and Lim, Ee-Peng and Mohania, M. K. and Masunaga, Y.},
keywords = {numerical},
pages = {117-128},
publisher = {Springer},
series = {LNCS},
title = {Numerical Aspects in the Data Model of Conceptual Information Systems},
volume = 1552,
year = 1999
}%0 Conference Paper
%1 stumme99numerical
%A Stumme, G.
%A Wolff, K. E.
%B Advances in Database Technologies. Proc. Intl. Workshop on Data Warehousing and
%C Heidelberg
%D 1999
%E Kambayashi, Y.
%E Lee, Dik Kun
%E Lim, Ee-Peng
%E Mohania, M. K.
%E Masunaga, Y.
%I Springer
%P 117-128
%T Numerical Aspects in the Data Model of Conceptual Information Systems
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1998/ER98.pdf
%V 1552 - 1.Stumme, G.: Dual Retrieval in Conceptual Information Systems. In: Buchmann, A. (ed.) Datenbanksysteme in Büro, Technik und Wissenschaft. Proc. BTW’99. pp. 328–342. , Heidelberg (1999).
@inproceedings{stumme99dual,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {Datenbanksysteme in Büro, Technik und Wissenschaft. Proc. BTW'99},
editor = {Buchmann, A.},
keywords = {information},
pages = {328-342},
title = {Dual Retrieval in Conceptual Information Systems},
year = 1999
}%0 Conference Paper
%1 stumme99dual
%A Stumme, Gerd
%B Datenbanksysteme in Büro, Technik und Wissenschaft. Proc. BTW'99
%C Heidelberg
%D 1999
%E Buchmann, A.
%P 328-342
%T Dual Retrieval in Conceptual Information Systems
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2021-BTW99.pdf - 1.Stumme, G.: Conceptual Knowledge Discovery with Frequent Concept Lattices. TU Darmstadt (1999).
@techreport{stumme99conceptualknowledge,
author = {Stumme, G.},
institution = {TU Darmstadt},
keywords = {closed},
title = {Conceptual Knowledge Discovery with Frequent Concept Lattices},
type = {{FB}4-{P}reprint 2043},
year = 1999
}%0 Report
%1 stumme99conceptualknowledge
%A Stumme, G.
%D 1999
%T Conceptual Knowledge Discovery with Frequent Concept Lattices
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf - 1.Stumme, G.: Acquiring Expert Knowledge for the Design of Conceptual Information Systems. In: Fensel, D. and Studer, R. (eds.) Knowledge Acquisition, Modeling, and Management. Proc. 11th European. pp. 275–290. Springer, Heidelberg (1999).
@inproceedings{Stumme1999acquiring,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {Knowledge Acquisition, Modeling, and Management. Proc. 11th European},
editor = {Fensel, D. and Studer, R.},
keywords = {lattices},
pages = {275-290},
publisher = {Springer},
series = {LNAI},
title = {Acquiring Expert Knowledge for the Design of Conceptual Information Systems},
volume = 1621,
year = 1999
}%0 Conference Paper
%1 Stumme1999acquiring
%A Stumme, Gerd
%B Knowledge Acquisition, Modeling, and Management. Proc. 11th European
%C Heidelberg
%D 1999
%E Fensel, D.
%E Studer, R.
%I Springer
%P 275-290
%T Acquiring Expert Knowledge for the Design of Conceptual Information Systems
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1999/P1997-EKAW99.pdf
%V 1621 - 1.Mineau, G., Stumme, G., Wille, R.: Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis. In: Tepfenhart, W. and Cyre, W. (eds.) Conceptual Structures: Standards and Practices. Proc. ICCS ’99. pp. 423–441. Springer, Heidelberg (1999).
@inproceedings{mineau99conceptual,
address = {Heidelberg},
author = {Mineau, Guy and Stumme, Gerd and Wille, Rudolf},
booktitle = {Conceptual Structures: Standards and Practices. Proc. ICCS '99},
editor = {Tepfenhart, W. and Cyre, W.},
keywords = {knowledge},
pages = {423-441},
publisher = {Springer},
series = {LNAI},
title = {Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis},
volume = 1640,
year = 1999
}%0 Conference Paper
%1 mineau99conceptual
%A Mineau, Guy
%A Stumme, Gerd
%A Wille, Rudolf
%B Conceptual Structures: Standards and Practices. Proc. ICCS '99
%C Heidelberg
%D 1999
%E Tepfenhart, W.
%E Cyre, W.
%I Springer
%P 423-441
%T Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1999/ICCS99.pdf
%V 1640 - 1.Prediger, S., Stumme, G.: Theory-Driven Logical Scaling. In: et al, E.F. (ed.) Proc. 6th Intl. Workshop Knowledge Representation Meets Databases (KRDB’99) (1999).
@inproceedings{prediger99theory,
author = {Prediger, S. and Stumme, G.},
booktitle = {Proc. 6th Intl. Workshop Knowledge Representation Meets Databases (KRDB'99)},
editor = {et al, E. Franconi},
keywords = {lattices},
note = {Also in: P. Lambrix et al (Eds.): Proc. Intl. Workshop on Description Logics (DL'99). CEUR Workshop Proc. 22, 1999 \url{http://ceur-ws.org/Vol-21}},
title = {Theory-Driven Logical Scaling},
volume = {CEUR Workshop Proc. 21},
year = 1999
}%0 Conference Paper
%1 prediger99theory
%A Prediger, S.
%A Stumme, G.
%B Proc. 6th Intl. Workshop Knowledge Representation Meets Databases (KRDB'99)
%D 1999
%E et al, E. Franconi
%T Theory-Driven Logical Scaling
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1999/KRDB99.pdf
%V CEUR Workshop Proc. 21 - 1.Skorsky, M., Stumme, G., Wille, R., Wille, U.: Reuse in the Development Process of {TOSCANA} Systems. In: Puppe, F., Fensel, D., Kühler, J., Studer, R., and Wetter, T. (eds.) Proc. Workshop on Knowledge Management, Organizational Memory and Reuse, 5th German Conf. on. , Würzburg (1999).
@inproceedings{skorsky1999reuse,
address = {Würzburg},
author = {Skorsky, M. and Stumme, G. and Wille, R. and Wille, U.},
booktitle = {Proc. Workshop on Knowledge Management, Organizational Memory and Reuse, 5th German Conf. on},
editor = {Puppe, F. and Fensel, D. and Kühler, J. and Studer, R. and Wetter, Th.},
keywords = {analysis},
month = {03},
title = {Reuse in the Development Process of {TOSCANA} Systems},
year = 1999
}%0 Conference Paper
%1 skorsky1999reuse
%A Skorsky, M.
%A Stumme, G.
%A Wille, R.
%A Wille, U.
%B Proc. Workshop on Knowledge Management, Organizational Memory and Reuse, 5th German Conf. on
%C Würzburg
%D 1999
%E Puppe, F.
%E Fensel, D.
%E Kühler, J.
%E Studer, R.
%E Wetter, Th.
%T Reuse in the Development Process of {TOSCANA} Systems
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1999/XPS99.pdf
1998
- 1.Stumme, G.: Free Distributive Completions of Partial Complete Lattices. {In:} {O}rder. 14, 179–189 (1998).
@article{stumme98free,
author = {Stumme, Gerd},
journal = {{In:} {O}rder},
keywords = {theory},
pages = {179-189},
title = {Free Distributive Completions of Partial Complete Lattices},
volume = 14,
year = 1998
}%0 Journal Article
%1 stumme98free
%A Stumme, Gerd
%D 1998
%J {In:} {O}rder
%P 179-189
%T Free Distributive Completions of Partial Complete Lattices
%U https://www.kde.cs.uni-kassel.de/stumme/papers/2000/SIGKDD_Explorations00.ps
%V 14 - 1.Stumme, G.: Knowledge, {L}ogic, {I}nformation. {C}onference {R}eport. Zeitschrift für Semiotik. 20, 424 (1998).
@article{stumme98knowledge,
author = {Stumme, Gerd},
journal = {Zeitschrift für Semiotik},
keywords = {report},
number = {3-4},
pages = 424,
title = {Knowledge, {L}ogic, {I}nformation. {C}onference {R}eport.},
volume = 20,
year = 1998
}%0 Journal Article
%1 stumme98knowledge
%A Stumme, Gerd
%D 1998
%J Zeitschrift für Semiotik
%N 3-4
%P 424
%T Knowledge, {L}ogic, {I}nformation. {C}onference {R}eport.
%V 20 - 1.Stumme, G.: Exploring Conceptual Similarities of Objects for Analyzing Inconsistencies in Relational Databases. In: Bing, L., Hsu, W., and Ke, W. (eds.) Proc.Workshop on Knowledge Discovery and Data Mining, 5th Pacific Rim Intl. Conf. on Artificial. pp. 41–50. , Singapore (1998).
@inproceedings{stummeexploring98,
address = {Singapore},
author = {Stumme, Gerd},
booktitle = {Proc.Workshop on Knowledge Discovery and Data Mining, 5th Pacific Rim Intl. Conf. on Artificial},
editor = {Bing, L. and Hsu, W. and Ke, W.},
keywords = {databases},
month = 11,
pages = {41-50},
title = {Exploring Conceptual Similarities of Objects for Analyzing Inconsistencies in Relational Databases.},
year = 1998
}%0 Conference Paper
%1 stummeexploring98
%A Stumme, Gerd
%B Proc.Workshop on Knowledge Discovery and Data Mining, 5th Pacific Rim Intl. Conf. on Artificial
%C Singapore
%D 1998
%E Bing, L.
%E Hsu, W.
%E Ke, W.
%P 41-50
%T Exploring Conceptual Similarities of Objects for Analyzing Inconsistencies in Relational Databases.
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1998/P2020-PRICAI98.pdf - 1.Stumme, G.: Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis. In: Herzog, O. and Günter, A. (eds.) KI-98: Advances in Artificial Intelligence. Proc. 22. Jahrestagung. pp. 117–128. Springer, Heidelberg (1998).
@inproceedings{stumme98knowledgeacquisition,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {KI-98: Advances in Artificial Intelligence. Proc. 22. Jahrestagung},
editor = {Herzog, O. and Günter, A.},
keywords = {knowledge},
pages = {117-128},
publisher = {Springer},
series = {LNAI},
title = {Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis},
volume = 1504,
year = 1998
}%0 Conference Paper
%1 stumme98knowledgeacquisition
%A Stumme, Gerd
%B KI-98: Advances in Artificial Intelligence. Proc. 22. Jahrestagung
%C Heidelberg
%D 1998
%E Herzog, O.
%E Günter, A.
%I Springer
%P 117-128
%T Distributive Concept Exploration - A Knowledge Acquisition Tool in Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1998/KI98.pdf
%V 1504 - 1.Stumme, G., Wille, R., Wille, U.: Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods. In: Zytkow, J.M. and Quafofou, M. (eds.) Principles of Data Mining and Knowledge Discovery Proc. 2nd European Symposium on PKDD’98. pp. 450–458. , Heidelberg (1998).
@inproceedings{stumme98conceptual,
address = {Heidelberg},
author = {Stumme, Gerd and Wille, Rudolf and Wille, Uta},
booktitle = {Principles of Data Mining and Knowledge Discovery Proc. 2nd European Symposium on PKDD'98},
editor = {Zytkow, J. M. and Quafofou, M.},
keywords = {databases},
note = {{P}art of \cite{hereth03conceptual}},
pages = {450-458},
series = {LNAI},
title = {Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods},
volume = 1510,
year = 1998
}%0 Conference Paper
%1 stumme98conceptual
%A Stumme, Gerd
%A Wille, Rudolf
%A Wille, Uta
%B Principles of Data Mining and Knowledge Discovery Proc. 2nd European Symposium on PKDD'98
%C Heidelberg
%D 1998
%E Zytkow, J. M.
%E Quafofou, M.
%P 450-458
%T Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1998/P1993-PKDD98.pdf
%V 1510 - 1.Stumme, G.: On-Line Analytical Processing with Conceptual Information Systems. In: Tanaka, K. and Ghandeharizadeh, S. (eds.) Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO’98). pp. 117–126 (1998).
@inproceedings{stumme98online,
author = {Stumme, Gerd},
booktitle = {Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO'98)},
editor = {Tanaka, K. and Ghandeharizadeh, S.},
keywords = {olap},
month = 11,
note = {Short version of \cite{stumme00conceptual}},
pages = {117-126},
title = {On-Line Analytical Processing with Conceptual Information Systems},
year = 1998
}%0 Conference Paper
%1 stumme98online
%A Stumme, Gerd
%B Proc. 5th Intl. Conf. on Foundations of Data Organization (FODO'98)
%D 1998
%E Tanaka, K.
%E Ghandeharizadeh, S.
%P 117-126
%T On-Line Analytical Processing with Conceptual Information Systems
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1998/FODO98.pdf
1997
- 1.Stumme, G., Wolff, K.E.: Computing in Conceptual Data systems with relational structures. In: Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency. pp. 206–219. , Vancouver, Canada (1997).
@inproceedings{stumme97computing,
address = {Vancouver, Canada},
author = {Stumme, Gerd and Wolff, Karl Erich},
booktitle = {Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency},
keywords = {lattices},
month = {08},
pages = {206-219},
title = {Computing in Conceptual Data systems with relational structures},
year = 1997
}%0 Conference Paper
%1 stumme97computing
%A Stumme, Gerd
%A Wolff, Karl Erich
%B Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency
%C Vancouver, Canada
%D 1997
%P 206-219
%T Computing in Conceptual Data systems with relational structures
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1997/KRUSE97.pdf - 1.Stumme, G.: Concept Exploration -- Knowledge Acquisition in Knowledge Systems. Shaker, Aachen (1997).
@book{stumme97conceptexploration,
address = {Aachen},
author = {Stumme, Gerd},
keywords = {knowledge},
publisher = {Shaker},
title = {Concept Exploration -- Knowledge Acquisition in Knowledge Systems.},
year = 1997
}%0 Book
%1 stumme97conceptexploration
%A Stumme, Gerd
%C Aachen
%D 1997
%I Shaker
%T Concept Exploration -- Knowledge Acquisition in Knowledge Systems.
%U http://www.shaker.de/Online-Gesamtkatalog/details.asp?ISBN=3-8265-2930-8 - 1.Stumme, G.: Concept Exploration - A Tool for Creating and Exploring Conceptual Hierarchies. In: Lukose, D., Delugach, H., Keeler, M., Searle, L., and Sowa, J.F. (eds.) Conceptual Structures: Fulfilling Peirce’s Dream. Proc. ICCS’97. Springer, Berlin (1997).
@inproceedings{stumme97tool,
address = {Berlin},
author = {Stumme, Gerd},
booktitle = {Conceptual Structures: Fulfilling Peirce's Dream. Proc. ICCS'97},
editor = {Lukose, D. and Delugach, H. and Keeler, M. and Searle, L. and Sowa, J. F.},
keywords = {Conceptual},
publisher = {Springer},
series = {LNAI},
title = {Concept Exploration - A Tool for Creating and Exploring Conceptual Hierarchies},
volume = 1257,
year = 1997
}%0 Conference Paper
%1 stumme97tool
%A Stumme, Gerd
%B Conceptual Structures: Fulfilling Peirce's Dream. Proc. ICCS'97
%C Berlin
%D 1997
%E Lukose, D.
%E Delugach, H.
%E Keeler, M.
%E Searle, L.
%E Sowa, J. F.
%I Springer
%T Concept Exploration - A Tool for Creating and Exploring Conceptual Hierarchies
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1997/P1905-ICCS97.pdf
%V 1257
1996
- 1.Stumme, G.: Attribute Exploration with Background Implications and Exceptions. In: Bock, H.-H. and Polasek, W. (eds.) Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl’95. Studies in Classification, Data Analysis, and Knowledge Organization 7. pp. 457–469. Springer, Heidelberg (1996).
@inproceedings{stumme96attribute,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl'95. Studies in Classification, Data Analysis, and Knowledge Organization 7},
editor = {Bock, H.-H. and Polasek, W.},
keywords = {lattices},
pages = {457-469},
publisher = {Springer},
title = {Attribute Exploration with Background Implications and Exceptions},
year = 1996
}%0 Conference Paper
%1 stumme96attribute
%A Stumme, Gerd
%B Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl'95. Studies in Classification, Data Analysis, and Knowledge Organization 7
%C Heidelberg
%D 1996
%E Bock, H.-H.
%E Polasek, W.
%I Springer
%P 457-469
%T Attribute Exploration with Background Implications and Exceptions
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1995/P1781-GfKl95.pdf - 1.Stumme, G.: The Concept Classification of a Terminology Extended by Conjunction and Disjunction. In: Foo, N. and Goebel, R. (eds.) PRICAI’96: Topics in Artificial Intelligence. Proc. PRICAI’96. pp. 121–131. Springer, Heidelberg (1996).
@inproceedings{stumme96concept,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {PRICAI'96: Topics in Artificial Intelligence. Proc. PRICAI'96},
editor = {Foo, N. and Goebel, R.},
keywords = {classification},
pages = {121-131},
publisher = {Springer},
series = {LNAI},
title = {The Concept Classification of a Terminology Extended by Conjunction and Disjunction},
volume = 1114,
year = 1996
}%0 Conference Paper
%1 stumme96concept
%A Stumme, Gerd
%B PRICAI'96: Topics in Artificial Intelligence. Proc. PRICAI'96
%C Heidelberg
%D 1996
%E Foo, N.
%E Goebel, R.
%I Springer
%P 121-131
%T The Concept Classification of a Terminology Extended by Conjunction and Disjunction
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1996/P1829-PRICAI96.pdf
%V 1114 - 1.Stumme, G.: Exploration Tools in Formal Concept Analysis. In: Diday, E., Lechevallier, Y., and Opitz, O. (eds.) Ordinal and Symbolic Data Analysis. Proc. OSDA’95. Studies in Classification, Data Analysis, and Knowledge Organization 8. pp. 31–44. Springer, Heidelberg (1996).
@inproceedings{stumme96exploration,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {Ordinal and Symbolic Data Analysis. Proc. OSDA'95. Studies in Classification, Data Analysis, and Knowledge Organization 8},
editor = {Diday, E. and Lechevallier, Y. and Opitz, O.},
keywords = {lattices},
pages = {31-44},
publisher = {Springer},
title = {Exploration Tools in Formal Concept Analysis},
year = 1996
}%0 Conference Paper
%1 stumme96exploration
%A Stumme, Gerd
%B Ordinal and Symbolic Data Analysis. Proc. OSDA'95. Studies in Classification, Data Analysis, and Knowledge Organization 8
%C Heidelberg
%D 1996
%E Diday, E.
%E Lechevallier, Y.
%E Opitz, O.
%I Springer
%P 31-44
%T Exploration Tools in Formal Concept Analysis
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1995/P1796-OSDA95.pdf - 1.Stumme, G.: Local Scaling in Conceptual Data Systems. In: Eklund, P.W., Ellis, G., and Mann, G. (eds.) Conceptual Structures: Knowledge Representation as Interlingua Proc. ICCS’96. pp. 308–320. Springer, Heidelberg (1996).
@inproceedings{stumme96local,
address = {Heidelberg},
author = {Stumme, Gerd},
booktitle = {Conceptual Structures: Knowledge Representation as Interlingua Proc. ICCS'96},
editor = {Eklund, P. W. and Ellis, G. and Mann, G.},
keywords = {lattices},
pages = {308-320},
publisher = {Springer},
series = {LNAI},
title = {Local Scaling in Conceptual Data Systems},
volume = 1115,
year = 1996
}%0 Conference Paper
%1 stumme96local
%A Stumme, Gerd
%B Conceptual Structures: Knowledge Representation as Interlingua Proc. ICCS'96
%C Heidelberg
%D 1996
%E Eklund, P. W.
%E Ellis, G.
%E Mann, G.
%I Springer
%P 308-320
%T Local Scaling in Conceptual Data Systems
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1996/P1827-ICCS96.pdf
%V 1115 - 1.Stumme, G.: International Conference on Conceptual Knowledge Processing. Conference Report. Zeitschrift für Semiotik. 18, 381 (1996).
@article{stummei96international,
author = {Stumme, G.},
journal = {Zeitschrift für Semiotik},
keywords = {report},
number = {Heft 2-3},
pages = 381,
title = {International Conference on Conceptual Knowledge Processing. Conference Report.},
volume = 18,
year = 1996
}%0 Journal Article
%1 stummei96international
%A Stumme, G.
%D 1996
%J Zeitschrift für Semiotik
%N Heft 2-3
%P 381
%T International Conference on Conceptual Knowledge Processing. Conference Report.
%V 18
1995
- 1.Stumme, G., Wille, R.: A Geometrical Heuristic for Drawing Concept Lattices. In: Tamassia, R. and Tollis, I. (eds.) Graph Drawing. pp. 452–459. Springer, Heidelberg (1995).
@inproceedings{stumme95geometrical,
address = {Heidelberg},
author = {Stumme, Gerd and Wille, Rudolf},
booktitle = {Graph Drawing},
editor = {Tamassia, R. and Tollis, I.G.},
keywords = {graph},
pages = {452-459},
publisher = {Springer},
series = {LNCS},
title = {A Geometrical Heuristic for Drawing Concept Lattices},
volume = 894,
year = 1995
}%0 Conference Paper
%1 stumme95geometrical
%A Stumme, Gerd
%A Wille, Rudolf
%B Graph Drawing
%C Heidelberg
%D 1995
%E Tamassia, R.
%E Tollis, I.G.
%I Springer
%P 452-459
%T A Geometrical Heuristic for Drawing Concept Lattices
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1994/P1677-GD94.pdf
%V 894 - 1.Stumme, G.: Knowledge acquisition by distributive concept exploration. In: Ellis, G., Levinson, R., Rich, W., and Sowa, J.F. (eds.) Conceptual structures: applications, implementation and theory. Springer--Verlag, Berlin--Heidelberg--New~York (1995).
@inproceedings{stumme1995knowledge,
address = {Berlin--Heidelberg--New~York},
author = {Stumme, Gerd},
booktitle = {Conceptual structures: applications, implementation and theory},
editor = {Ellis, G. and Levinson, R. and Rich, W. and Sowa, J. F.},
keywords = {lattices},
number = 954,
publisher = {Springer--Verlag},
series = {Lecture Notes in Artificial Intelligence},
title = {Knowledge acquisition by distributive concept exploration},
year = 1995
}%0 Conference Paper
%1 stumme1995knowledge
%A Stumme, Gerd
%B Conceptual structures: applications, implementation and theory
%C Berlin--Heidelberg--New~York
%D 1995
%E Ellis, G.
%E Levinson, R.
%E Rich, W.
%E Sowa, J. F.
%I Springer--Verlag
%N 954
%T Knowledge acquisition by distributive concept exploration
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1995/ICCS95_not_in_cv.pdf - 1.Stumme, G., Wille, R.: A geometrical heuristic for drawing concept lattices. In: Tamassia, R. and Tollis, I. (eds.) Graph Drawing. pp. 452–459. Springer-Verlag (1995).
@incollection{Stumme95,
author = {Stumme, G. and Wille, R.},
booktitle = {Graph Drawing},
editor = {Tamassia, R. and Tollis, I.G.},
keywords = {OntologyHandbook},
pages = {452--459},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science, Vol. 894},
title = {A geometrical heuristic for drawing concept lattices},
year = 1995
}%0 Book Section
%1 Stumme95
%A Stumme, G.
%A Wille, R.
%B Graph Drawing
%D 1995
%E Tamassia, R.
%E Tollis, I.G.
%I Springer-Verlag
%P 452--459
%T A geometrical heuristic for drawing concept lattices
1994
- 1.Stumme, G.: Boolesche {B}egriffe, https://www.kde.cs.uni-kassel.de/stumme/papers/1994/Diplomarbeit94.pdf, (1994).
@mastersthesis{stumme94boolesche,
author = {Stumme, Gerd},
keywords = {lattices},
school = {TH Darmstadt},
title = {Boolesche {B}egriffe},
type = {Diplomarbeit},
year = 1994
}%0 Thesis
%1 stumme94boolesche
%A Stumme, Gerd
%D 1994
%T Boolesche {B}egriffe
%U https://www.kde.cs.uni-kassel.de/stumme/papers/1994/Diplomarbeit94.pdf