Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Discovering a cover set of ARsi with hierarchy from quantitative databases
Home
Publications
Discovering a cover set of ARsi with hierarchy from quantitative databases
Discovering a cover set of ARsi with hierarchy from quantitative databases
Authors:
PY
P Yan
P Yan
GC
G Chen
G Chen
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
23 June 2005
journal article
Published by
Elsevier
in
Information Sciences
Vol. 173
(4)
,
319-336
DOI:
10.1016/j.ins.2005.03.003
Abstract
No abstract available
Keywords
COVER SET
DATA EXPERIMENT
FUZZY SET
QUANTITATIVE DATABASES
HIERARCHICAL RELATIONSHIP
COMPUTATIONAL EFFICIENCY
FUZZY ASSOCIATION RULE
PRUNING STRATEGY
RULE COVER SET
CORRESPONDING ALGORITHM
ASSOCIATION RULES
HIERARCHY
ASSOCIATION RULE
Cited
Cited by 59 articles
Scroll to top