Sciweavers

    91 search results - page 6 / 19
    » A quickstart in frequent structure mining can make a differe...
    Sort
    View
    CIKM
    2008
    Springer
    133views Information Technology» more  CIKM 2008»
    On effective presentation of graph patterns: a structural representative approach
    13 years 9 months ago
    On effective presentation of graph patterns: a structural representative approach
    Download  www.cs.uiuc.edu
    In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
    Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
    claim paper
    Read More »
    FIMI
    2003
    88views Data Mining» more  FIMI 2003»
    A fast APRIORI implementation
    13 years 8 months ago
    A fast APRIORI implementation
    Download  www.cs.bme.hu
    The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
    Ferenc Bodon
    claim paper
    Read More »
    SP
    2008
    IEEE
    159views Security Privacy» more  SP 2008»
    Inferring neuronal network connectivity from spike data: A temporal data mining approach
    13 years 7 months ago
    Inferring neuronal network connectivity from spike data: A temporal data mining approach
    Download  people.cs.vt.edu
    Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
    Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
    claim paper
    Read More »
    FIMI
    2004
    123views Data Mining» more  FIMI 2004»
    Surprising Results of Trie-based FIM Algorithms
    13 years 8 months ago
    Surprising Results of Trie-based FIM Algorithms
    Download  sunsite.informatik.rwth-aachen.de
    Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
    Ferenc Bodon
    claim paper
    Read More »
    ICDM
    2006
    IEEE
    176views Data Mining» more  ICDM 2006»
    Razor: mining distance-constrained embedded subtrees
    14 years 1 months ago
    Razor: mining distance-constrained embedded subtrees
    Download  www.dit.unitn.it
    Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
    Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
    claim paper
    Read More »
    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.