Mining data to find subsets of high activity. (Q1429873): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jspi.2003.06.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048622403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2774028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extreme value theory for long head runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Printer graphics for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elements of statistical learning. Data mining, inference, and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in the Analysis of Survey Data, and a Proposal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Longest Run of Heads / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Future of Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197160 / rank
 
Normal rank

Latest revision as of 17:21, 6 June 2024

scientific article
Language Label Description Also known as
English
Mining data to find subsets of high activity.
scientific article

    Statements

    Mining data to find subsets of high activity. (English)
    0 references
    0 references
    0 references
    27 May 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    ARF
    0 references
    Data mining
    0 references
    Recursive partitioning
    0 references
    Classification tree
    0 references
    0 references
    0 references
    0 references
    0 references