TY - GEN
T1 - Uncovering functional dependencies in MDD-compiled product catalogues
AU - Hadzic, Tarik
AU - O'Sullivan, Barry
PY - 2009
Y1 - 2009
N2 - A functional dependency is a logical relationship amongst the attributes that define a table of data. Specifically, a functional dependency holds when the values of a subset of the attributes in a dataset determine the values of one or more other attributes. Uncovering such dependencies is utilized in many domains, such as database design. We demonstrate that it can also be utilized in a recommendation context when datasets represent product catalogues. State-of-the-art approaches to discovering functional dependencies require a tabular representation of the data. However, product catalogues can sometimes be defined implicitly, for example, as a set of solutions to a combinatorial problem. Such combinatorial catalogues can have a very large number of products, thus making standard approaches to uncovering functional dependencies inapplicable. In this paper we present the first approach to computing functional dependencies over compiled knowledge representations which can often be small even for huge catalogues. In particular, we develop efficient algorithms that operate over decision diagrams, which allow us to handle catalogues that are out of reach for current approaches. We apply our algorithms to tabular and combinatorial benchmarks and detect a number of properties that could be considered as anomalies in product catalogues.
AB - A functional dependency is a logical relationship amongst the attributes that define a table of data. Specifically, a functional dependency holds when the values of a subset of the attributes in a dataset determine the values of one or more other attributes. Uncovering such dependencies is utilized in many domains, such as database design. We demonstrate that it can also be utilized in a recommendation context when datasets represent product catalogues. State-of-the-art approaches to discovering functional dependencies require a tabular representation of the data. However, product catalogues can sometimes be defined implicitly, for example, as a set of solutions to a combinatorial problem. Such combinatorial catalogues can have a very large number of products, thus making standard approaches to uncovering functional dependencies inapplicable. In this paper we present the first approach to computing functional dependencies over compiled knowledge representations which can often be small even for huge catalogues. In particular, we develop efficient algorithms that operate over decision diagrams, which allow us to handle catalogues that are out of reach for current approaches. We apply our algorithms to tabular and combinatorial benchmarks and detect a number of properties that could be considered as anomalies in product catalogues.
KW - Decision diagrams
KW - Functional dependencies
UR - https://www.scopus.com/pages/publications/72249104679
U2 - 10.1145/1639714.1639792
DO - 10.1145/1639714.1639792
M3 - Conference proceeding
AN - SCOPUS:72249104679
SN - 9781605584355
T3 - RecSys'09 - Proceedings of the 3rd ACM Conference on Recommender Systems
SP - 377
EP - 380
BT - RecSys'09 - Proceedings of the 3rd ACM Conference on Recommender Systems
T2 - 3rd ACM Conference on Recommender Systems, RecSys'09
Y2 - 23 October 2009 through 25 October 2009
ER -