Min-Apriori: An Algorithm for Finding Association Rules in Data with Continuous Attributes
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Min-Apriori: An Algorithm for Finding Association Rules in Data with Continuous Attributes
Authors
Published Date
1997
Publisher
Type
Report
Abstract
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 97-068
Funding information
This work was supported by NSF ASC-9634719, by Army Research Office contract DNDAAH04-95-1-0538, by Army High Performance
Computing Research Center cooperative agreement number DAAH04-95-2-0003/contract number DAAH04-95-C-0008, the content of which does
not necessarily reflect the position or the policy of the government, and no official endorsement should be inferred. Additional support was provided
by the IBM Partnership Award, and by the IBM SUR equipment grant. Access to computing facilities was provided by AHPCRC, Minnesota
Supercomputer Institute.
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Han, Eui-Hong; Karypis, George; Kumar, Vipin. (1997). Min-Apriori: An Algorithm for Finding Association Rules in Data with Continuous Attributes. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215354.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.