Sciweavers

    SDM
    2009
    SIAM
    192views Data Mining» more  SDM 2009»
    Mining Cohesive Patterns from Graphs with Feature Vectors.
    14 years 8 months ago
    Mining Cohesive Patterns from Graphs with Feature Vectors.
    Download  www.siam.org
    The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
    Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
    claim paper
    Read More »
    SDM
    2009
    SIAM
    225views Data Mining» more  SDM 2009»
    Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
    14 years 8 months ago
    Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
    Download  siam.org
    Most datasets in real applications come in from multiple sources. As a result, we often have attributes information about data objects and various pairwise relations (similarity) ...
    Fei Wang, Chris H. Q. Ding, Tao Li
    claim paper
    Read More »
    SDM
    2009
    SIAM
    123views Data Mining» more  SDM 2009»
    Randomization Techniques for Graphs.
    14 years 8 months ago
    Randomization Techniques for Graphs.
    Download  www.siam.org
    Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
    Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
    claim paper
    Read More »
    SDM
    2009
    SIAM
    111views Data Mining» more  SDM 2009»
    A New Constraint for Mining Sets in Sequences.
    14 years 8 months ago
    A New Constraint for Mining Sets in Sequences.
    Download  www.siam.org
    Discovering interesting patterns in event sequences is a popular task in the field of data mining. Most existing methods try to do this based on some measure of cohesion to deter...
    Bart Goethals, Boris Cule, Céline Robardet
    claim paper
    Read More »
    SDM
    2009
    SIAM
    126views Data Mining» more  SDM 2009»
    An Entity Based Model for Coreference Resolution.
    14 years 8 months ago
    An Entity Based Model for Coreference Resolution.
    Download  www.siam.org
    Recently, many advanced machine learning approaches have been proposed for coreference resolution; however, all of the discriminatively-trained models reason over mentions rather ...
    Michael L. Wick, Aron Culotta, Khashayar Rohaniman...
    claim paper
    Read More »
    SDM
    2009
    SIAM
    143views Data Mining» more  SDM 2009»
    Finding Representative Association Rules from Large Rule Collections.
    14 years 8 months ago
    Finding Representative Association Rules from Large Rule Collections.
    Download  www.almaden.ibm.com
    One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
    Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
    claim paper
    Read More »
    SDM
    2009
    SIAM
    176views Data Mining» more  SDM 2009»
    Constraint-Based Subspace Clustering.
    14 years 8 months ago
    Constraint-Based Subspace Clustering.
    Download  www.siam.org
    In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
    Élisa Fromont, Adriana Prado, Céline...
    claim paper
    Read More »
    SDM
    2009
    SIAM
    112views Data Mining» more  SDM 2009»
    A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
    14 years 8 months ago
    A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
    Download  www.siam.org
    Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
    Frederik Janssen, Johannes Fürnkranz
    claim paper
    Read More »
    SDM
    2009
    SIAM
    161views Data Mining» more  SDM 2009»
    Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
    14 years 8 months ago
    Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
    Download  www-ikn.ist.hokudai.ac.jp
    In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
    Hiroki Arimura, Takeaki Uno
    claim paper
    Read More »
    SDM
    2009
    SIAM
    157views Data Mining» more  SDM 2009»
    MUSK: Uniform Sampling of k Maximal Patterns.
    14 years 8 months ago
    MUSK: Uniform Sampling of k Maximal Patterns.
    Download  www.siam.org
    Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
    Mohammad Al Hasan, Mohammed Javeed Zaki
    claim paper
    Read More »
    « first‹ previous…9899100101102103104105106next ›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.