Morstatter, F.; ürgen Pfeffer, J.; Liu, H. & Carley, K. M. (2013),
'Is the Sample Good Enough? Comparing Data from Twitters Streaming API with Twitters Firehose',
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Bullock, B. N.; Jäschke, R. & Hotho, A. (2011),
Tagging data as implicit feedback for learning-to-rank, in
'Proceedings of the ACM WebSci'11'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Hotho, A.; Ulslev Pedersen, R. & Wurst, M. (2010),
'Ubiquitous Data', Lecture Notes in Computer Science
(6202)
, 61--74
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Song, C.; Qu, Z.; Blumm, N. & Barabási, A.-L. (2010),
'Limits of Predictability in Human Mobility', Science
327
(5968)
, 1018-1021
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Atzmueller, M.; Lemmerich, F.; Krause, B. & Hotho, A. (2009),
Towards Understanding Spammers - Discovering Local Patterns for Concept Characterization and Description, in
Johannes Fürnkranz Arno Knobbe, ed.,
'Proc. LeGo-09: From Local Patterns to Global Models, Workshop at the 2009 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Atzmueller, M.; Lemmerich, F.; Krause, B. & Hotho, A. (2009),
Who are the Spammers? Understandable Local Patterns for Concept Description, in
'7th Conference on Computer Methods and Systems'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Krause, B.; Schmitz, C.; Hotho, A. & Stumme, G. (2008),
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'
, ACM, New York, NY, USA
, pp. 61--68
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Berendt, B.; Hotho, A.; Mladenic, D. & Semeraro, G., ed.
(2007),
From Web to Social Web: Discovering and Deploying User and Content Profiles
, Vol. 4736
, Springer
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Wurst, M. & Morik, K. (2007),
'Distributed feature extraction in a p2p setting: a case study', Future Gener. Comput. Syst.
23
(1)
, 69--75
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Baeza-Yates, R.; Calderón-Benavides, L. & González-Caro, C. (2006),
'The Intention Behind Web Queries', String Processing and Information Retrieval
, 98--109
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Balakrishnan, H. & Deo, N. (2006),
Discovering communities in complex networks., in
Ronaldo Menezes, ed.,
'ACM Southeast Regional Conference'
, ACM,
, pp. 280-285
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Buitelaar, P.; Cimiano, P. & Magnini, B., ed.
(2005),
Ontology Learning from Text: Methods, Evaluation and Applications
, Vol. 123
, IOS Press
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Weiss, S. M.; Indurkhya, N. & Zhang, T.
(2004),
Text Mining. Predictive Methods for Analyzing Unstructured Information
, Springer, Berlin
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Baldi, P.; Frasconi, P. & Smyth, P.
(2003), Modeling the Internet and the Web: Probabilistic Methods and Algorithms
, Wiley
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Dhillon, I. S.; Modha, D. S. & Spangler, W. S. (2002),
'Class visualization of high-dimensional data with applications', Computational Statistics & Data Analysis
41
(1)
, 59-90
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Thrun, S.; Burgard, W. & Fox, D.
(2001),
Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Masand, B. M. & Spiliopoulou, M., ed.
(2000),
Web Usage Analysis and User Profiling, International WEBKDD'99
Workshop, San Diego, California, USA, August 15, 1999, Revised
Papers
, Vol. 1836
, Springer
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pyle, D.
(1999),
Data Preparation for Data Mining
, Morgan Kaufmann
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Fayyad, U. M.; Piatetsky-Shapiro, G. & Smyth, P. (1996),
From Data Mining to Knowledge Discovery: An Overview.
'Advances in Knowledge Discovery and Data Mining'
, pp. 1-34
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Flajolet, P. & Martin, G. N. (1985),
'Probabilistic Counting Algorithms for Data Base Applications', Journal of Computer and System Sciences
31
(2)
, 182-209
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]