Sciweavers

    2932 search results - page 486 / 587
    » Higher order mining
    Sort
    View
    SDM
    2008
    SIAM
    138views Data Mining» more  SDM 2008»
    Learning Markov Network Structure using Few Independence Tests
    13 years 10 months ago
    Learning Markov Network Structure using Few Independence Tests
    Download  www.cs.cmu.edu
    In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
    Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
    claim paper
    Read More »
    SDM
    2007
    SIAM
    143views Data Mining» more  SDM 2007»
    Less is More: Compact Matrix Decomposition for Large Sparse Graphs
    13 years 10 months ago
    Less is More: Compact Matrix Decomposition for Large Sparse Graphs
    Download  www.cs.cmu.edu
    Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
    Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
    claim paper
    Read More »
    IADIS
    2003
    117views Internet Technology» more  IADIS 2003»
    Query-Based Discovering of Popular Changes in WWW
    13 years 10 months ago
    Query-Based Discovering of Popular Changes in WWW
    Download  www.miv.t.u-tokyo.ac.jp
    This paper presents the method for retrieving and summarizing changes in topics from online resources. Users often want to know what are the major changes in their areas of intere...
    Adam Jatowt, Khoo Khyou Bun, Mitsuru Ishizuka
    claim paper
    Read More »
    AAI
    2007
    132views more  AAI 2007»
    Incremental Extraction of Association Rules in Applicative Domains
    13 years 9 months ago
    Incremental Extraction of Association Rules in Applicative Domains
    Download  www.di.unito.it
    In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
    Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
    claim paper
    Read More »
    TKDE
    2008
    153views more  TKDE 2008»
    Discovering Frequent Agreement Subtrees from Phylogenetic Data
    13 years 9 months ago
    Discovering Frequent Agreement Subtrees from Phylogenetic Data
    Download  web.njit.edu
    We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
    Sen Zhang, Jason Tsong-Li Wang
    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.