Sciweavers

    90 search results - page 11 / 18
    » Supervised Inductive Learning with Lotka-Volterra Derived Mo...
    Sort
    View
    KDD
    2004
    ACM
    132views Data Mining» more  KDD 2004»
    A probabilistic framework for semi-supervised clustering
    14 years 8 months ago
    A probabilistic framework for semi-supervised clustering
    Download  www.cs.utexas.edu
    Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
    Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
    claim paper
    Read More »
    IJCNN
    2007
    IEEE
    161views Neural Networks» more  IJCNN 2007»
    Risk Assessment Algorithms Based on Recursive Neural Networks
    14 years 2 months ago
    Risk Assessment Algorithms Based on Recursive Neural Networks
    Download  hal.inria.fr
    — The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...
    Alejandro Chinea Manrique De Lara, Michel Parent
    claim paper
    Read More »
    ICML
    2009
    IEEE
    150views Machine Learning» more  ICML 2009»
    Boosting with structural sparsity
    14 years 8 months ago
    Boosting with structural sparsity
    Download  www.cs.berkeley.edu
    Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
    John Duchi, Yoram Singer
    claim paper
    Read More »
    NCI
    2004
    141views Neural Networks» more  NCI 2004»
    Estimating the error at given test input points for linear regression
    13 years 9 months ago
    Estimating the error at given test input points for linear regression
    Download  sugiyama-www.cs.titech.ac.jp
    In model selection procedures in supervised learning, a model is usually chosen so that the expected test error over all possible test input points is minimized. On the other hand...
    Masashi Sugiyama
    claim paper
    Read More »
    EMNLP
    2008
    105views Natural Language Processing» more  EMNLP 2008»
    Learning Graph Walk Based Similarity Measures for Parsed Text
    13 years 9 months ago
    Learning Graph Walk Based Similarity Measures for Parsed Text
    Download  www.cs.cmu.edu
    We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
    Einat Minkov, William W. Cohen
    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.