Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Mining Differential Dependencies: A Subspace Clustering Approach
verfasst von : Selasi Kwashie, Jixue Liu, Jiuyong Li, Feiyue Ye
Erschienen in: Databases Theory and Applications
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The discovery of differential dependencies (DDs) is the problem of finding a minimal cover set of DDs that hold in a given relation. This paper proposes a novel subspace-clustering-based approach to mine DDs that exist in a given relation. We study and reveal a link between
δ
-nClusters and differential functions (DFs). Based on this relationship, we adopt and co-opt techniques for mining
δ
-nClusters to find the set of candidate antecedent DFs of DDs efficiently, based on a user-specified distance threshold. Furthermore, we define an interestingness measure for DDs to aid the discovery of essential DDs and avoid the mining of an extremely large set. Finally, we demonstrate the scalability and efficiency of our solution through experiments on real-world benchmark datasets.