Sciweavers

    FIMI
    2003
    108views Data Mining» more  FIMI 2003»
    AFOPT: An Efficient Implementation of Pattern Growth Approach
    13 years 6 months ago
    AFOPT: An Efficient Implementation of Pattern Growth Approach
    Download  research.nii.ac.jp
    Guimei Liu, Hongjun Lu, Jeffrey Xu Yu, Wei Wang 00...
    claim paper
    Read More »
    FIMI
    2003
    210views Data Mining» more  FIMI 2003»
    COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
    13 years 6 months ago
    COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
    Download  sunsite.informatik.rwth-aachen.de
    Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
    Osmar R. Zaïane, Mohammad El-Hajj
    claim paper
    Read More »
    FIMI
    2003
    84views Data Mining» more  FIMI 2003»
    Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
    13 years 6 months ago
    Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
    Download  sunsite.informatik.rwth-aachen.de
    We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
    Takeaki Uno, Ken Satoh
    claim paper
    Read More »
    FIMI
    2003
    146views Data Mining» more  FIMI 2003»
    ARMOR: Association Rule Mining based on ORacle
    13 years 6 months ago
    ARMOR: Association Rule Mining based on ORacle
    Download  dsl.serc.iisc.ernet.in
    In this paper, we first focus our attention on the question of how much space remains for performance improvement over current association rule mining algorithms. Our strategy is...
    Vikram Pudi, Jayant R. Haritsa
    claim paper
    Read More »
    FIMI
    2003
    146views Data Mining» more  FIMI 2003»
    Mining Frequent Itemsets using Patricia Tries
    13 years 6 months ago
    Mining Frequent Itemsets using Patricia Tries
    Download  sunsite.informatik.rwth-aachen.de
    We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
    Andrea Pietracaprina, Dario Zandolin
    claim paper
    Read More »
    FIMI
    2003
    170views Data Mining» more  FIMI 2003»
    kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
    13 years 6 months ago
    kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
    Download  sunsite.informatik.rwth-aachen.de
    This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
    Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...
    claim paper
    Read More »
    FIMI
    2003
    136views Data Mining» more  FIMI 2003»
    Intersecting data to closed sets with constraints
    13 years 6 months ago
    Intersecting data to closed sets with constraints
    Download  sunsite.informatik.rwth-aachen.de
    We describe a method for computing closed sets with data-dependent constraints. Especially, we show how the method can be adapted to find frequent closed sets in a given data set...
    Taneli Mielikäinen
    claim paper
    Read More »
    FIMI
    2003
    123views Data Mining» more  FIMI 2003»
    Apriori, A Depth First Implementation
    13 years 6 months ago
    Apriori, A Depth First Implementation
    Download  sunsite.informatik.rwth-aachen.de
    We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
    Walter A. Kosters, Wim Pijls
    claim paper
    Read More »
    FIMI
    2003
    95views Data Mining» more  FIMI 2003»
    Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
    13 years 6 months ago
    Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
    Download  sunsite.informatik.rwth-aachen.de
    A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
    Attila Gyenesei, Jukka Teuhola
    claim paper
    Read More »
    FIMI
    2003
    104views Data Mining» more  FIMI 2003»
    AIM: Another Itemset Miner
    13 years 6 months ago
    AIM: Another Itemset Miner
    Download  www.shporer.com
    We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate...
    Amos Fiat, Sagi Shporer
    claim paper
    Read More »
    12next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.