4 citations found. Retrieving documents...
E.-H. Han, G. Karypis, and V. Kumar. Tr# 97-068: Min-apriori: An algorithm for finding association rules in data with continuous attributes. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1997.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Clustering In A High-Dimensional Space Using Hypergraph.. - Han, Karypis, Kumar.. (1997)   (7 citations)  (Correct)

....can lead to a distortion in the relations among items, especially in cases in which a higher value indicates a stronger relation. For this type of domains, in which continuous variables with higher values imply greater importance, we have developed a new algorithm called Min Apriori [HKK97a] that operates directly on these continuous variables without discretizing them. In fact, for the clustering of documents in Section 4.3.2 (also results in [HBG 97] the hypergraphwas constructed using Min Apriori. Our current clustering algorithm relies on the hypergraph partitioning ....

E.H. Han, G. Karypis, and V. Kumar. Min-apriori: An algorithm for finding association rules in data with continuous attributes. Technical Report TR-97-068, Department of Computer Science, University of Minnesota, Minneapolis, 1997.


Generalizing the Notion of Support - Michael Steinbach Dept   Self-citation (Kumar)   (Correct)

No context found.

E.-H. Han, G. Karypis, and V. Kumar. Tr# 97-068: Min-apriori: An algorithm for finding association rules in data with continuous attributes. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1997.


Generalizing the Notion of Support - Steinbach, Tan, Xiong, Kumar (2004)   Self-citation (Kumar)   (Correct)

No context found.

E.-H. Han, G. Karypis, and V. Kumar. Tr# 97-068: Min-apriori: An algorithm for finding association rules in data with continuous attributes. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1997.


Efficient Parallel Data Mining with the Apriori Algorithm on.. - Baker, Prasanna   (Correct)

No context found.

E. (Sam) Han, G. Karypis, and V. Kumar. Min-Apriori: An Algorithm for Finding Association Rules in Data with Continuous Attributes, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC