Sciweavers

    NIPS
    2004
    152views Information Technology» more  NIPS 2004»
    Breaking SVM Complexity with Cross-Training
    13 years 5 months ago
    Breaking SVM Complexity with Cross-Training
    Download  books.nips.cc
    We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
    Gökhan H. Bakir, Léon Bottou, Jason We...
    claim paper
    Read More »
    ICML
    2000
    IEEE
    182views Machine Learning» more  ICML 2000»
    Learning to Probabilistically Identify Authoritative Documents
    14 years 5 months ago
    Learning to Probabilistically Identify Authoritative Documents
    Download  www.cse.msu.edu
    We describe a model of document citation that learns to identify hubs and authorities in a set of linked documents, such as pages retrieved from the world wide web, or papers retr...
    David Cohn, Huan Chang
    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.