Sciweavers

    KDD
    2008
    ACM
    120views Data Mining» more  KDD 2008»
    Multi-class cost-sensitive boosting with p-norm loss functions
    15 years 26 days ago
    Multi-class cost-sensitive boosting with p-norm loss functions
    Download  www.research.ibm.com
    We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
    Aurelie C. Lozano, Naoki Abe
    claim paper
    Read More »
    KDD
    2008
    ACM
    152views Data Mining» more  KDD 2008»
    Automatic record linkage using seeded nearest neighbour and support vector machine classification
    15 years 26 days ago
    Automatic record linkage using seeded nearest neighbour and support vector machine classification
    Download  cs.anu.edu.au
    Peter Christen
    claim paper
    Read More »
    KDD
    2008
    ACM
    132views Data Mining» more  KDD 2008»
    Partitioned logistic regression for spam filtering
    15 years 26 days ago
    Partitioned logistic regression for spam filtering
    Download  research.microsoft.com
    Naive Bayes and logistic regression perform well in different regimes. While the former is a very simple generative model which is efficient to train and performs well empirically...
    Ming-wei Chang, Wen-tau Yih, Christopher Meek
    claim paper
    Read More »
    KDD
    2008
    ACM
    159views Data Mining» more  KDD 2008»
    Semi-supervised learning with data calibration for long-term time series forecasting
    15 years 26 days ago
    Semi-supervised learning with data calibration for long-term time series forecasting
    Download  www.cse.msu.edu
    Many time series prediction methods have focused on single step or short term prediction problems due to the inherent difficulty in controlling the propagation of errors from one ...
    Haibin Cheng, Pang-Ning Tan
    claim paper
    Read More »
    KDD
    2008
    ACM
    138views Data Mining» more  KDD 2008»
    Quantitative evaluation of approximate frequent pattern mining algorithms
    15 years 26 days ago
    Quantitative evaluation of approximate frequent pattern mining algorithms
    Download  www-users.cs.umn.edu
    Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
    Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
    claim paper
    Read More »
    KDD
    2008
    ACM
    217views Data Mining» more  KDD 2008»
    Stream prediction using a generative model based on frequent episodes in event sequences
    15 years 26 days ago
    Stream prediction using a generative model based on frequent episodes in event sequences
    Download  research.microsoft.com
    This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
    Srivatsan Laxman, Vikram Tankasali, Ryen W. White
    claim paper
    Read More »
    KDD
    2008
    ACM
    119views Data Mining» more  KDD 2008»
    SAIL: summation-based incremental learning for information-theoretic clustering
    15 years 26 days ago
    SAIL: summation-based incremental learning for information-theoretic clustering
    Download  datamining.rutgers.edu
    Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
    Junjie Wu, Hui Xiong, Jian Chen
    claim paper
    Read More »
    KDD
    2008
    ACM
    164views Data Mining» more  KDD 2008»
    Microscopic evolution of social networks
    15 years 26 days ago
    Microscopic evolution of social networks
    Download  www.cs.cmu.edu
    We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
    Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew ...
    claim paper
    Read More »
    KDD
    2008
    ACM
    104views Data Mining» more  KDD 2008»
    Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
    15 years 26 days ago
    Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
    Download  www.cs.kent.edu
    Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
    Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
    claim paper
    Read More »
    KDD
    2008
    ACM
    174views Data Mining» more  KDD 2008»
    Automatic identification of quasi-experimental designs for discovering causal knowledge
    15 years 26 days ago
    Automatic identification of quasi-experimental designs for discovering causal knowledge
    Download  kdl.cs.umass.edu
    Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
    David D. Jensen, Andrew S. Fast, Brian J. Taylor, ...
    claim paper
    Read More »
    « first‹ previous123456789…next ›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.