Abstract
This article provides a viewpoint on the past and possible future development of data mining technology. On an introductory level, it provides some historical background to the development of data mining, sketches its relationship to other disciplines, and introduces a number of tasks that are typically considered data mining tasks. It next focuses on one particular aspect that may play a larger role in data mining, namely, declarativeness. Despite the fact that many different data mining tools have been developed, this variety still offers less flexibility to the user than desired. It also creates a problem of choice: which tool is most suitable for a given problem? Declarative data mining may provide a solution for this. In other domains of computer science, declarative languages have led to major leaps forward in technology. Early results show that in data mining, too, declarative approaches are feasible and may make the process easier, more flexible, more efficient, and more correct.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Adam, A., Blockeel, H., Govers, S. and Aertsen, A., “SCCQL: A constraint-based clustering system,” in Lecture Notes in Computer Science, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD), Prague, 23–27 September, 2013, Springer, pp. 681–684, September 2013.
Agrawal, R. and Srikant, R., “Fast algorithms for mining association rules in large databases” in VLDB’94, Proceedings of 20th International Conference on Very Large Data Bases, September 12–15, 1994, Santiago de Chile, Chile, Morgan Kaufmann, pp. 487–499, 1994.
Andrews, T., Blockeel, H., Bogaerts, B., Bruynooghe, M., Denecker, M., De Pooter, S., Macé, C. and Ramon, J., “Analyzing manuscript traditions using constraint-based data mining,” in Proceedings First Workshop on Combining Constraint Solving with Mining and Learning (ECAI 2012 Workshop), First Workshop on Combining Constraint Solving with Mining and Learning, Montpellier, France, 27 August 2012, pp. 15–20, August 2012.
Bar-Hillel, A., Hertz, T., Shental, N. and Weinshall, D., “Learning a mahalanobis metric from equivalence constraints,”Journal of Machine Learning Research, 6, pp. 937–965, 2005.
Bengio, Y. and Grandvalet, Y., “No unbiased estimator of the variance of k-fold cross-validation,” Journal of Machine Learning Research, 5, pp. 1089–1105, 2004.
Blockeel, H., Calders, T., Fromont, É., Goethals, B., Prado, A. and Robardet, C., “An inductive database system based on virtual mining views,” Data Min. Knowl. Discov., 24(1), pp. 247–287, 2012.
Breiman, L., Friedman, J. H., Olshen, R. A. and Stone, C. J., Classification and Regression Trees, Wadsworth, 1984.
Bruynooghe, M., Blockeel, H., Bogaerts, B., De Cat, B., De Pooter, S., Jansen, J., Labarre, A., Ramon, J., Denecker, M. and Verwer, S., “Predicate logic as a modeling language: Modeling and solving some machine learning and data mining problems with IDP3,” Theory and Practice of Logic Programming, available on CJO2014, doi:10.1017/S147106841400009X.
Dao, T., Duong, K. and Vrain, C., “A declarative framework for constrained clustering,” in Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23–27, 2013, Proceedings, Part III, pp. 419–434, 2013.
Davidson, I., “Clustering with constraints,” in Encyclopedia of Database Systems, Springer, pp. 393–396, 2009.
De Pooter, S., Wittocx, J. and Denecker. M., “A prototype of a knowledge-based programming environment,” in Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011), Vienna, 28–30 September 2011, pp. 6, August 2011.
Demsar, J., “Statistical comparisons of classi_ers over multiple data sets” Journal of Machine Learning Research, 7, pp. 1–30, 2006.
Dietterich T. G. “Approximate statistical test for comparing supervised classification learning algorithms,” Neural Computation, 10(7), pp. 1895–1923, 1998.
Domingos, P. and Hulten, G., “Mining high-speed data streams,” in Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, Boston, MA, USA, August 20–23, 2000 (Ramakrishnan, R., Stolfo, S J., Bayardo, R. J., and Parsa, I., eds.), ACM, pp. 71–80, 2000.
Džeroski, S., Goethals, B. and Panov, P., eds., Inductive Databases and Constraint-Based Data Mining, Springer, 2010.
Frawley, W. J., Piatetsky-shapiro, G. and Matheus, C. J., “Knowledge discovery in databases: an overview,” AI Magazine, 13, 1992.
Garofalakis, M. N., Rastogi, R. and Shim, K., “Mining sequential patterns with regular expression constraints,” IEEE Trans. Knowl. Data Eng., 14(3), pp. 530–552, 2002.
Guazzelli, A., Zeller, M., Lin, W. and Williams, G., “PMML: An open standard for sharing models,” The R Journal, 1(1), pp. 60–65, 2009.
Guns, T., Dries, A., Tack, G., Nijssen, S. and De Raedt, L., “Miningzinc: A modeling language for constraint-based mining,” in IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3–9, 2013, pp. 1365–1372, 2013.
Hu, P., Vens, C., Verstrynge, B. and Blockeel, H., “Generalizing from example clusters,” in Lecture Notes in Computer Science, Discovery Science, Singapore, 6–9 October 2013, Springer, pp. 64–78, October 2013.
Imielinski T. and Mannila, H., “A database perspective on knowledge discovery,” Commun. ACM, 39(11), pp. 58–64, 1996.
Meo, R., Psaila, G. and Ceri, S., “A new sql-like operator for mining association rules,” in VLDB’96, Proceedings of 22th International Conference on Very Large Data Bases, September 3–6, 1996, Mumbai (Bombay), India, Morgan Kaufmann, pp. 122–133, 1996.
Muggleton, S., “Inductive logic programming,” New Generation Comput., 8(4), pp. 295–318, 1991.
Muggleton, S. and De Raedt, L., “Inductive logic programming: Theory and methods,” J. Log. Program., 19/20, pp. 629–679, 1994.
Nijssen, S. and Guns, T., “Integrating constraint programming and itemset mining,” in Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20–24, 2010, Proceedings, Part II, pp. 467–482, 2010.
Quinlan, J. R., “Induction of decision trees,” Machine Learning, 1(1), pp. 81–106, 1986.
Quinlan, J. R., C4.5: Programs for Machine Learning, Morgan Kaufmann, 1993.
De Raedt, L., Logical and relational learning, Cognitive Technologies, Springer, 2008.
Tsochantaridis, I., Joachims, T., Hofmann, T. and Altun, Y., “Large margin methods for structured and interdependent output variables,” Journal of Machine Learning Research, pp. 1453–1484, 2005.
Tsoumakas, G., Katakis, I. and Vlahavas, I. P., “Mining multilabel data” in Data Mining and Knowledge Discovery Handbook, 2nd ed., Springer, pp. 667–685, 2010.
Vanwinckelen, G. and Blockeel, H., “A declarative query language for statistical inference” ECML/PKDD 2013 Workshop: Languages for Data Mining and Machine Learning, Prague, Czech Republic, 23 September 2013, September 2013.
Wagstaff K., Cardie, C., Rogers, S. and Schrödl, S., “Constrained k-means clustering with background knowledge,” in Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, June 28 - July 1, 2001, Morgan Kaufmann, pp. 577–584, 2001.
Wang, Y., Ramon, J. and Fannes, T., “An effciently computable subgraph pattern support measure: counting independent observations, Data Min. Knowl. Discov., 27(3), pp. 444–477, 2013.
Zhi, W., Wang, X., Qian, B., Butler, P., Ramakrishnan, N. and Davidson, I., “Clustering with complex constraints - algorithms and applications,” in Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14–18, 2013 (desJardins, M. and Littman, M. L., eds.), Bellevue, Washington, USA. AAAI Press, 2013.
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Blockeel, H. Data Mining: From Procedural to Declarative Approaches. New Gener. Comput. 33, 115–135 (2015). https://doi.org/10.1007/s00354-015-0202-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00354-015-0202-x