See this document in CiteSeerX!

Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation (1997)  (Make Corrections)  (6 citations)
John M. Aronis, Foster J. Provost
Knowledge Discovery and Data Mining



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
nyu.edu/~fprovost/Paper...kdd97bfmp.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  nyu.edu/~fprovost (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-first marker propagation is most beneficial when the data are linked to hierarchical background knowledge (e.g., tree-structured attributes), or when the attributes describing the data have many values. We support our claims analytically with complexity arguments and empirically on several large data sets. We... (Update)

Context of citations to this paper:   More

...ST0 and ST1. The results in Table 4 indicate that IND s classification accuracy is not adversely affected by such heuristics; see Aronis and Provost (1997) for another possible heuristic. Since T1 is a one level tree, it may appear surprising that it is not faster than...

...results in Table 4 suggest that IND s classification accuracy is not adversely affected by such heuristics. The technique in Aronis and Provost (1997) may also be useful in increasing the efficieny of some algorithms when there are categorical variables with many categories....

Cited by:   More
A Scalable Bottom-Up Data Mining Algorithm for.. - Giovanni Giuffrida..   (Correct)
A Survey of Methods for Scaling Up Inductive Algorithms - Provost, Kolluri (1999)   (Correct)
Adaptive Fraud Detection - Fawcett, Foster (1997)   (Correct)

Similar documents (at the sentence level):
24.2%:   Rule-space Search for Knowledge-based Discovery - Provost, al. (1999)   (Correct)
22.4%:   Rule-Space Search for Knowledge-Based Discovery - Provost, al. (1999)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Roles of Medical Ontology in Association - Mining Crisp-Dm Cycle   (Correct)
0.2:   Reducing The Number Of Binary Splits In Decision Tree.. - Lerman, al.   (Correct)
0.2:   Reducing the number of binary splits, in Decision Tree.. - Isra El-C'esar   (Correct)

Similar documents based on text:   More   All
0.3:   Confidence Bands for ROC Curves - Macskassy, Provost, Littman (2003)   (Correct)
0.3:   Scaling Up Inductive Learning with Massive Parallelism - Provost, Aronis   (Correct)
0.2:   Exploiting Background Knowledge in Automated Discovery - Aronis, Provost, al. (1996)   (Correct)

Related documents from co-citation:   More   All
4:   Programs for machine learning (context) - Quinlan - 1993
4:   Fast effective rule induction - Cohen - 1995
4:   Very Simple Classification Rules Perform Well on Most Commonly Used Datasets (context) - Holte - 1993

BibTeX entry:   (Update)

Aronis, J. and F. Provost (1997). Increasing the efficiency of data mining algorithms with breadthfirst marker propagation. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, Newport Beach, CA. http://citeseer.ist.psu.edu/aronis97increasing.html   More

@inproceedings{ aronis97increasing,
    author = "John M. Aronis and Foster J. Provost",
    title = "Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation",
    booktitle = "Knowledge Discovery and Data Mining",
    pages = "119-122",
    year = "1997",
    url = "citeseer.ist.psu.edu/aronis97increasing.html" }
Citations (may not include all citations):
2177   Programs for Machine Learning (context) - Quinlan - 1993
23   Scaling up inductive learning with massive parallelism - Provost, Aronis - 1996  ACM   DBLP
15   Combining data mining and machine learning for effective use.. - Fawcett, Provost - 1996  DBLP
13   Exploiting background knowledge in automated discovery - Aronis, Provost et al. - 1996
13   Linear-Time Rule Induction - Domingos - 1996  DBLP
12   The use of background knowledge in decision tree induction (context) - nez - 1991  ACM   DBLP
5   On handling tree-structured attributes in decision tree lear.. (context) - Almuallim, Akiba et al. - 1995
1   Presented at 1995 North American Congress of Clinical Toxico.. (context) - datura, poisoning et al. - 1995



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.stern.nyu.edu/~fprovost):   More
On Applied Research in Machine Learning - Provost (1998)   (Correct)
Well-Trained PETs: Improving Probability Estimation Trees - Provost, Domingos (2000)   (Correct)
Machine Learning from Imbalanced Data Sets 101 (Extended Abstract) - Provost   (Correct)

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