Abstract
Real world problems in society, science or economics need human structuring, interpretation and decision making, the limiting factor being the amount of time and effort that the user can invest in the sense-making process. The Dicode data mining services intend to help in clearly defined steps of the sense-making process, where human capacity is most limited and the impact of automatic solutions is most profound. This includes recommendation services to search and filter information, text mining services to search for new information und unknown relations in data, and subgroup discovery services to find and evaluate hypotheses on data. This chapter provides an overview of the data mining services developed in the context of the Dicode project. It addresses the usability of the services and indicates which big data technologies are being used to deal with very large data collections.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Developers interested in using the statistics might have a look at Max Jacob’s talk at the Berlin Buzzwords Conference 2012 which explains the extraction of Wikipedia statistics in detail: http://vimeo.com/45123391.
References
Han, J., Pei, J., Yiwen, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8, 53–87 (2004)
Lavrac, N., Kavšek, B., Flach, P., Todorovski, L.: Subgroup discovery with CN2-SD. J. Mach. Learn. Res. 5, 153–188 (2004)
van Leeuwen, M., Knobbe, A.: Diverse subgroup set discovery. Data Min. Knowl. Discov. 25(2), 208–242. Springer, The Netherlands (2012)
Grosskreutz, H., Paurat, D., Rüping, S.: An enhanced relevance criterion for more concise supervised pattern discovery. In: The 18th Annual ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2012)
Cantone, D., Ferro, A., Pulvirenti, A., Recupero, D.R., Shasha, D.: Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces. IEEE/TKDE. 17(4), 535–550 (2005)
Friesen, N., Rüping, S.: Distance metric learning for recommender systems in complex domains mastering data-intensive collaboration through the synergy of human and machine reasoning (dicoSyn 2012). In: A Workshop at CSCW 2012, Seattle, WA, 12 Feb 2012
Thurau, C., Kersting, K., Wahabzada, M., Bauckhage, C.: Convex non-negative matrix factorization for massive datasets. Knowl. Inf. Syst. 29(2), 457–478 (2010)
Trajkovsky, I.: Functional Interpretation of Gene Expression Data: Translating High-Throughput DNA Microarray Data into Useful Biological Knowledge. LAP LAMBERT Academic Publishing. (2011). ISBN: 978-3-8473-1475-2
Paass, G., Kindermann, J.: Entity and relation extraction in texts with semi- super-vised extensions. In: Tresp, V., Bundschus, M., Rettinger, A., Huang, Y. (eds.), Security Informatics and Terrorism: Social and Technical Problems of Detecting and Controlling Terrorists’ Use of the World Wide Web; Proceedings of the NATO Advanced Research Workshop on Security Informatics and Terrorism—Patrolling the Web, vol. 15, p. 132. IOS Press, Beer-Sheva (2008)
Cucerzan, S.: Large-scale named entity disambiguation based on Wikipedia data. In: Proceedings of EMNLP-CoNLL, pp. 708–716 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Friesen, N. et al. (2014). The Dicode Data Mining Services. In: Karacapilidis, N. (eds) Mastering Data-Intensive Collaboration and Decision Making. Studies in Big Data, vol 5. Springer, Cham. https://doi.org/10.1007/978-3-319-02612-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-02612-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02611-4
Online ISBN: 978-3-319-02612-1
eBook Packages: EngineeringEngineering (R0)