TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies Export

@article{citeulike:1648417, abstract = {this paper, we also consider the approximate dependency inference task: given a relation r and a threshold \#, find all minimal non-trivial approximate dependencies}, author = {Huhtala, Yk\"a and K\"arkk{\"a}inen, Juha and Porkka, Pasi and Toivonen, Hannu}, citeulike-article-id = {1648417}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3544}, journal = {The Computer Journal}, keywords = {datamining}, month = {????}, number = {2}, pages = {100--111}, posted-at = {2007-09-12 16:47:04}, priority = {2}, title = {TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3544}, volume = {42}, year = {1999} }

TY - JOUR ID - citeulike:1648417 L3 - citeulike-article-id:1648417 N2 - this paper, we also consider the approximate dependency inference task: given a relation r and a threshold #, find all minimal non-trivial approximate dependencies IS - 2 JF - The Computer Journal EP - 111 TI - TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies VL - 42 SP - 100 KW - datamining AU - Huhtala, Yk\"a AU - K\"arkk{\"a}inen, Juha AU - Porkka, Pasi AU - Toivonen, Hannu PY - 1999/????// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3544 ER -