@article {795,
	title = {Temporal association rule mining: An overview considering the time variable as an integral or implied component},
	journal = {WIREs Data Mining and Knowledge Discovery},
	volume = {10},
	year = {2020},
	note = {TIN2017-89517-P; P18-RT-2248},
	month = {04/2020},
	abstract = {Association rules are commonly used to provide decision-makers with knowledge that helps them to make good decisions. Most of the published proposals mine association rules without paying particular attention to temporal information. However, in real-life applications data usually change over time or presenting different temporal situations. Therefore, the extracted knowledge may not be useful, since we may not know whether the rules are currently applicable or whether they will be applicable in the future. For this reason, in recent years, many methods have been proposed in the literature for mining temporal association rules, which introduce a greater predictive and descriptive power providing an additional degree of interestingness. One of the main problems in this research field is the lack of visibility most works suffer since there is no standard terminology to refer to it, making it difficult to find and compare proposals and studies in the field. This contribution attempts to offer a well-defined framework that allows researchers both to easily locate the previous proposals and to propose well-grounded methods in the future. To accomplish both objectives, a two-level taxonomy is proposed according to whether the time variable is considered to provide order to the data collection and to locate some temporal constraints, or whether it is considered as an attribute within the learning process. Some recent applications, available software tools, and a bibliographical analysis in accordance with the Web of Science are also shown. Finally, some critical considerations and potential further directions are discussed.

This article is categorized under:

    Technologies > Association Rules
    Algorithmic Development > Association Rules
},
	keywords = {calendar association rules, cyclic association rules, data mining, sequential association rules, temporal association rules},
	doi = {https://www.doi.org/10.1002/widm.1367},
	author = {Alberto Segura-Delgado and M. J. Gacto and Alcal{\'a}, Rafael and J. Alcal{\'a}-Fdez}
}
@article {794,
	title = {Experimental Study on 164 Algorithms Available in Software Tools for Solving Standard Non-Linear Regression Problems},
	journal = {IEEE Access},
	volume = {7},
	year = {2019},
	month = {08/2019},
	pages = { 108916-108939},
	abstract = {In the specialized literature, researchers can find a large number of proposals for solving regression problems that come from different research areas. However, researchers tend to use only proposals from the area in which they are experts. This paper analyses the performance of a large number of the available regression algorithms from some of the most known and widely used software tools in order to help non-expert users from other areas to properly solve their own regression problems and to help specialized researchers developing well-founded future proposals by properly comparing and identifying algorithms that will enable them to focus on significant further developments. To sum up, we have analyzed 164 algorithms that come from 14 main different families available in 6 software tools (Neural Networks, Support Vector Machines, Regression Trees, Rule-Based Methods, Stacking, Random Forests, Model trees, Generalized Linear Models, Nearest Neighbor methods, Partial Least Squares and Principal Component Regression, Multivariate Adaptive Regression Splines, Bagging, Boosting, and other methods) over 52 datasets. A new measure has also been proposed to show the goodness of each algorithm with respect to the others. Finally, a statistical analysis by non-parametric tests has been carried out over all the algorithms and on the best 30 algorithms, both with and without bagging. Results show that the algorithms from Random Forest, Model Tree and Support Vector Machine families get the best positions in the rankings obtained by the statistical tests when bagging is not considered. In addition, the use of bagging techniques significantly improves the performance of the algorithms without excessive increase in computational times.},
	keywords = {data mining, experimental study., regression algorithms, supervised learning},
	doi = {https://doi.org/10.1109/ACCESS.2019.2933261},
	author = {M. J. Gacto and Jose Manuel Soto-Hidalgo and J. Alcal{\'a}-Fdez and Alcal{\'a}, Rafael}
}
