Sciweavers

    IJFCS
    2008
    102views more  IJFCS 2008»
    Succinct Minimal Generators: Theoretical Foundations and Applications
    13 years 4 months ago
    Succinct Minimal Generators: Theoretical Foundations and Applications
    Download  www.cril.univ-artois.fr
    In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
    Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
    claim paper
    Read More »
    SDM
    2003
    SIAM
    134views Data Mining» more  SDM 2003»
    Hierarchical Document Clustering using Frequent Itemsets
    13 years 5 months ago
    Hierarchical Document Clustering using Frequent Itemsets
    Download  www.cs.sfu.ca
    A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
    Benjamin C. M. Fung, Ke Wang, Martin Ester
    claim paper
    Read More »
    KDID
    2003
    144views Database» more  KDID 2003»
    What You Store is What You Get
    13 years 5 months ago
    What You Store is What You Get
    Download  win.ua.ac.be
    d abstract) Floris Geerts, Bart Goethals, and Taneli Mielik¨ainen HIIT Basic Research Unit Department of Computer Science University of Helsinki, Finland Abstract. Recent studies ...
    Floris Geerts, Bart Goethals, Taneli Mielikäi...
    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 »
    APPINF
    2003
    225views Information Technology» more  APPINF 2003»
    Fast Frequent Itemset Mining using Compressed Data Representation
    13 years 6 months ago
    Fast Frequent Itemset Mining using Compressed Data Representation
    Download  www.computing.edu.au
    Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
    Raj P. Gopalan, Yudho Giri Sucahyo
    claim paper
    Read More »
    DMIN
    2006
    137views Data Mining» more  DMIN 2006»
    Discovering of Frequent Itemsets with CP-mine Algorithm
    13 years 6 months ago
    Discovering of Frequent Itemsets with CP-mine Algorithm
    Download  ww1.ucmss.com
    Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
    Nuansri Denwattana, Yutthana Treewai
    claim paper
    Read More »
    FIMI
    2004
    239views Data Mining» more  FIMI 2004»
    LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
    13 years 6 months ago
    LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
    Download  sunsite.informatik.rwth-aachen.de
    : For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
    Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
    claim paper
    Read More »
    FIMI
    2004
    175views Data Mining» more  FIMI 2004»
    CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
    13 years 6 months ago
    CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
    Download  sunsite.informatik.rwth-aachen.de
    Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
    Yudho Giri Sucahyo, Raj P. Gopalan
    claim paper
    Read More »
    DMIN
    2007
    158views Data Mining» more  DMIN 2007»
    Mining Frequent Itemsets Using Re-Usable Data Structure
    13 years 6 months ago
    Mining Frequent Itemsets Using Re-Usable Data Structure
    Download  www.cs.purdue.edu
    - Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
    Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
    claim paper
    Read More »
    KDD
    1997
    ACM
    159views Data Mining» more  KDD 1997»
    New Algorithms for Fast Discovery of Association Rules
    13 years 8 months ago
    New Algorithms for Fast Discovery of Association Rules
    Download  www.cs.rpi.edu
    Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
    Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
    claim paper
    Read More »
    « first‹ previous1234next ›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.