Ubicon and its Applications for Ubiquitous Social Computing.
New Review of Hypermedia and Multimedia, 20(1):53-77, 2014.
Martin Atzmueller, Martin Becker, Mark Kibanov, Christoph Scholz, Stephan Doerfel, Andreas Hotho, Bjoern-Elmar Macek, Folke Mitzlaff, Juergen Mueller and Gerd Stumme.
[doi]
[abstract]
[BibTeX]
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.
Proceedings of the 1st International Workshop on Interactions between Data Mining and Natural Language Processing co-located with The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, DMNLP@PKDD/ECML 2014, Nancy, France, September 15, 2014.
CEUR Workshop Proceedings. volume 1202.
CEUR-WS.org, 2014.
Peggy Cellier, Thierry Charnois, Andreas Hotho, Stan Matwin, Marie-Francine Moens and Yannick Toussaint.
[doi]
[BibTeX]
Modeling and Mining Ubiquitous Social Media.
2012.
[doi]
[BibTeX]
Proceedings of the Third International Workshop on Mining Ubiquitous and Social Environments (MUSE 2012).
2012.
[doi]
[BibTeX]
Data mining concepts and techniques, third edition.
2012.
Jiawei Han, Micheline Kamber and Jian Pei.
[doi]
[BibTeX]
Proceedings of the 2011 International Workshop on Mining Ubiquitous and Social Environments (MUSE 2011).
2011.
[BibTeX]
Towards Mining Semantic Maturity in Social Bookmarking Systems.
In: A. Passant, S. Fernández, J. Breslin and U. Bojārs, editors,
Proceedings of the 4th international workshop on Social Data on the Web (SDoW2011).
2011.
Martin Atzmueller, Dominik Benz, Andreas Hotho and Gerd Stumme.
[doi]
[BibTeX]
Combining Data-Driven and Semantic Approaches for Text Mining..
In: D. Fensel, editor,
Foundations for the Web of Information and Services, pages 115-142.
Springer, 2011.
Stephan Bloehdorn, Sebastian Blohm, Philipp Cimiano, Eugenie Giesbrecht, Andreas Hotho, Uta Lösch, Alexander Mädche, Eddie Mönch, Philipp Sorg, Steffen Staab and Johanna Völker.
[doi]
[BibTeX]
Data mining : concepts and techniques.
2011.
Jiawei Han and Micheline Kamber.
[doi]
[BibTeX]
From Semantic Web Mining to Social and Ubiquitous Mining - A Subjective View on Past, Current, and Future Research..
In: D. Fensel, editor,
Foundations for the Web of Information and Services, pages 143-153.
Springer, 2011.
Andreas Hotho and Gerd Stumme.
[doi]
[BibTeX]
Community Assessment using Evidence Networks.
In:
Analysis of Social Media and Ubiquitous Data, volume 6904, series LNAI.
2011.
Folke Mitzlaff, Martin Atzmueller, Dominik Benz, Andreas Hotho and Gerd Stumme.
[BibTeX]
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.
Folke Mitzlaff, Martin Atzmueller, Gerd Stumme and Andreas Hotho.
[BibTeX]
Statistical Topic Models for Multi-Label Document Classification.
2011. cite arxiv:1107.2462.
Timothy N. Rubin, America Chambers, Padhraic Smyth and Mark Steyvers.
[doi]
[abstract]
[BibTeX]
Machine learning approaches to multi-label document classification have (to date) largely relied on discriminative modeling techniques such as support vector machines. A drawback of these approaches is that performance rapidly drops off as the total number of labels and the number of labels per document increase. This problem is amplified when the label frequencies exhibit the type of highly skewed distributions that are often observed in real-world datasets. In this paper we investigate a class of generative statistical topic models for multi-label documents that associate individual word tokens with different labels. We investigate the advantages of this approach relative to discriminative models, particularly with respect to classification problems involving large numbers of relatively rare labels. We compare the performance of generative and discriminative approaches on document labeling tasks ranging from datasets with several thousand labels to datasets with tens of labels. The experimental results indicate that generative models can achieve competitive multi-label classification performance compared to discriminative methods, and have advantages for datasets with many labels and skewed label frequencies.
Ubiquitous Data.
Lecture Notes in Computer Science(6202):61-74, 2010.
Andreas Hotho, Rasmus Ulslev Pedersen and Michael Wurst.
[doi]
[BibTeX]
A Framework for Emotion Mining from Text in Online Social Networks..
In: W. Fan, W. Hsu, G. I. Webb, B. Liu, C. Zhang, D. Gunopulos and X. Wu, editors,
ICDM Workshops, pages 1136-1142.
IEEE Computer Society, 2010.
Mohamed Yassine and Hazem Hajj.
[doi]
[BibTeX]
Text mining : classification, clustering, and applications.
2009.
Asho Srivastava and Mehran. Sahami.
[doi]
[abstract]
[BibTeX]
Giving a broad perspective of the field from numerous vantage points, 'Text Mining' focuses on statistical methods for text mining and analysis. It examines methods to automatically cluster and classify text documents and applies these methods in a variety of areas.
What Do You Do with a Million Books?.
D-Lib Magazine, 12(3), 2006.
Gregory Crane.
[doi]
[BibTeX]
A survey on pagerank computing.
Internet Mathematics, 2:73-120, 2005.
Pavel Berkhin.
[doi]
[abstract]
[BibTeX]
Abstract. This survey reviews the research related to PageRank computing. Components of a PageRank vector serve as authority weights for web pages independent of their textual content, solely based on the hyperlink structure of the web. PageRank is typically used as a web search ranking component. This defines the importance of the model and the data structures that underly PageRank processing. Computing even a single PageRank is a difficult computational task. Computing many PageRanks is a much more complex challenge. Recently, significant effort has been invested in building sets of personalized PageRank vectors. PageRank is also used in many diverse applications other than ranking. We are interested in the theoretical foundations of the PageRank formulation, in the acceleration of PageRank computing, in the effects of particular aspects of web graph structure on the optimal organization of computations, and in PageRank stability. We also review alternative models that lead to authority indices similar to PageRank and the role of such indices in applications other than web search. We also discuss linkbased search personalization and outline some aspects of PageRank infrastructure from associated measures of convergence to link preprocessing. 1.
Advances in knowledge discovery and data mining.
In:
U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy, editors,
, chapter From data mining to knowledge discovery: an overview, pages 1-34.
American Association for Artificial Intelligence, Menlo Park, CA, USA, 1996.
Usama M. Fayyad, Gregory Piatetsky-Shapiro and Padhraic Smyth.
[doi]
[BibTeX]