The paper presents minimum variance patterns: a new class of itemsets and rules for numerical data, which capture arbitrary continuous relationships between numerical attributes without the need for discretization. The approach is based on finding polynomials over sets of attributes whose variance, in a given dataset, is close to zero. Sets of attributes for which such functions exist are considered interesting. Further, two types of rules are introduced, which help extract understandable relationships from such itemsets. Efficient algorithms for mining minimum variance patterns are presented and verified experimentally. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jaroszewicz, S. (2008). Minimum variance associations - Discovering relationships in numerical data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5012 LNAI, pp. 172–183). https://doi.org/10.1007/978-3-540-68125-0_17
Mendeley helps you to discover research relevant for your work.