Occams Razor for Big Data? On Detecting Quality in Large Unstructured Datasets
Birgitta Dresp-Langley, Ole Kristian Ekseth, Jan Fesl, Seiichi Gohshi,, Marc Kurz, Hans-Werner Sehring

TL;DR
This paper reviews the challenges and solutions for detecting quality in large unstructured datasets, emphasizing the importance of simplicity and pragmatic approaches amidst increasing data complexity.
Contribution
It synthesizes insights from multiple disciplines to highlight how simple, computationally efficient methods can effectively analyze big data without sacrificing the principle of parsimony.
Findings
Computational building blocks aid large data clustering efficiently.
Simple unsupervised algorithms extract meaning from unstructured data.
Subjective and pragmatic methods are essential for effective big data analysis.
Abstract
Detecting quality in large unstructured datasets requires capacities far beyond the limits of human perception and communicability and, as a result, there is an emerging trend towards increasingly complex analytic solutions in data science to cope with this problem. This new trend towards analytic complexity represents a severe challenge for the principle of parsimony or Occams Razor in science. This review article combines insight from various domains such as physics, computational science, data engineering, and cognitive science to review the specific properties of big data. Problems for detecting data quality without losing the principle of parsimony are then highlighted on the basis of specific examples. Computational building block approaches for data clustering can help to deal with large unstructured datasets in minimized computation time, and meaning can be extracted rapidly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
