Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database

Xiaopeng Tao; Aoying Zhou; Yunfa Hu

doi:10.1007/BF02948813

Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database

Xiaopeng Tao, Aoying Zhou, Yunfa Hu

Fudan University

Research output: Contribution to journal › Article › peer-review

Abstract

This paper defines a new kind of rule, probability functional dependency rule. The functional dependency degree can be depicted by this kind of rule. Five algorithms, from the simple to the complex, are presented to mine this kind of rule in different condition. The related theorems are proved to ensure the high efficiency and the correctness of the above algorithms.

Original language	English
Pages (from-to)	261-270
Number of pages	10
Journal	Journal of Computer Science and Technology
Volume	15
Issue number	3
DOIs	https://doi.org/10.1007/BF02948813
State	Published - May 2000
Externally published	Yes

Keywords

Data mining
Functional dependency relationship (FD)
Probability functional dependency rule (PFDR)
Relational database

Access to Document

10.1007/BF02948813

Cite this

@article{4af6efaa17784bd586a665b93dd0d1cb,

title = "Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database",

abstract = "This paper defines a new kind of rule, probability functional dependency rule. The functional dependency degree can be depicted by this kind of rule. Five algorithms, from the simple to the complex, are presented to mine this kind of rule in different condition. The related theorems are proved to ensure the high efficiency and the correctness of the above algorithms.",

keywords = "Data mining, Functional dependency relationship (FD), Probability functional dependency rule (PFDR), Relational database",

author = "Xiaopeng Tao and Aoying Zhou and Yunfa Hu",

year = "2000",

month = may,

doi = "10.1007/BF02948813",

language = "英语",

volume = "15",

pages = "261--270",

journal = "Journal of Computer Science and Technology",

issn = "1000-9000",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database

AU - Tao, Xiaopeng

AU - Zhou, Aoying

AU - Hu, Yunfa

PY - 2000/5

Y1 - 2000/5

N2 - This paper defines a new kind of rule, probability functional dependency rule. The functional dependency degree can be depicted by this kind of rule. Five algorithms, from the simple to the complex, are presented to mine this kind of rule in different condition. The related theorems are proved to ensure the high efficiency and the correctness of the above algorithms.

AB - This paper defines a new kind of rule, probability functional dependency rule. The functional dependency degree can be depicted by this kind of rule. Five algorithms, from the simple to the complex, are presented to mine this kind of rule in different condition. The related theorems are proved to ensure the high efficiency and the correctness of the above algorithms.

KW - Data mining

KW - Functional dependency relationship (FD)

KW - Probability functional dependency rule (PFDR)

KW - Relational database

UR - https://www.scopus.com/pages/publications/0346739136

U2 - 10.1007/BF02948813

DO - 10.1007/BF02948813

M3 - 文章

AN - SCOPUS:0346739136

SN - 1000-9000

VL - 15

SP - 261

EP - 270

JO - Journal of Computer Science and Technology

JF - Journal of Computer Science and Technology

IS - 3

ER -

Fast Algorithms of Mining Probability Functional Dependency Rules in Relational Database

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this