Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Relational data factorization
Paramonov S., Leeuwen M., Raedt L. Machine Learning106 (12):1867-1904,2017.Type:Article
Date Reviewed: Feb 7 2019

General methods take advantage of developing frameworks for data mining and machine learning that can be specialized for efficiency according to the problem domain. This paper discusses a declarative modeling method as a form of relational learning. The generic problem is relational data factorization (ReDF): “given a conjunctive query and the input relation, the problem is to compute the extensions of the relations used in the query.”

The solution of an ReDF problem can be only some approximation in general, so constraints and scoring functions belong to the task description. ReDF is general enough to model “a wide range of well-known data analysis problems,” for example, tiling and discriminative k-pattern set mining. This allows one to find commonalities among these domains and the methods applied for them.

The paper translates the ReDF problem to answer set programming (ASP) [1], so runnable prototypes can be described in a declarative way and then the implementation can be refined further. For finding k patterns or tiles, the authors present two algorithms, a greedy one and a sampling one. The maximum k-tiling problem (being not unique) is formalized using an iterative greedy algorithm in ASP.

The authors use Gebser et al. [2] and seven different datasets to compare their implementation to others in the literature. Compared to generic counterparts, their results are good and well suited to make prototypes. Of course, their program is far behind implementations applying specific algorithms.

The paper’s themes are multifold and arborescent. However, its sophisticated structure, clear descriptions, and recurring variants of the example help with understanding. The three authors’ various backgrounds and roles complement each other well.

I recommend this paper for those who are interested in a logic-based treatment of data mining and machine learning methods.

Reviewer:  K. Balogh Review #: CR146420 (1905-0182)
1) Brewka, G.; Eiter, T.; Truszczyński, M. Answer set programming at a glance. Communications of the ACM 54, 12(2011), 92–103.
2) Gebser, M.; Kaufmann, B.; Kaminski, R.; Ostrowski, M.; Schaub, T.; Schneider, M. Potassco: the potsdam answer set solving collection. AI Communications 24, 2(2011), 107–124.
Bookmark and Share
 
Relational Databases (H.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Relational Databases": Date
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Reiter R. Journal of the ACM 33(2): 349-370, 1986. Type: Article
Nov 1 1986
Sort sets in the relational model
Ginsburg S., Hull R. Journal of the ACM 33(3): 465-488, 1986. Type: Article
Nov 1 1986
Foundation for object/relational databases
Date C., Darwen H., Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998. Type: Book (9780201309782)
Nov 1 1998
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy