English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Learning from Labeled and Unlabeled Data on a Directed Graph

Zhou, D., Huang, J., & Schölkopf, B. (2005). Learning from Labeled and Unlabeled Data on a Directed Graph. In S. Jozef Stefan Institute, Slovenia Program Chairs: Luc D, L. de Raedt, & S. Wrobel (Eds.), ICML '05: 22nd international conference on Machine learning (pp. 1036-1043). New York, NY, USA: ACM Press.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-D4BB-6 Version Permalink: https://hdl.handle.net/21.11116/0000-0005-0E1E-C
Genre: Conference Paper

Files

show Files
hide Files
:
LPDG_3463.pdf (Any fulltext), 343KB
View   Save
File Permalink:
https://hdl.handle.net/21.11116/0000-0005-0E1F-B
Name:
LPDG_3463.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show
hide
Locator:
https://dl.acm.org/citation.cfm?doid=1102351.1102482 (Publisher version)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Zhou, D1, 2, Author           
Huang, J, Author           
Schölkopf, B1, 2, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: We propose a general framework for learning from labeled and
unlabeled data on a directed graph in which the structure of the
graph including the directionality of the edges is considered. The
time complexity of the algorithm derived from this framework is
nearly linear due to recently developed numerical techniques. In
the absence of labeled instances, this framework can be utilized
as a spectral clustering method for directed graphs, which
generalizes the spectral clustering approach for undirected
graphs. We have applied our framework to real-world web
classification problems and obtained encouraging results.

Details

show
hide
Language(s):
 Dates: 2005-08
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: 3463
DOI: 10.1145/1102351.1102482
 Degree: -

Event

show
hide
Title: 22nd International Conference on Machine Learning (ICML 2005)
Place of Event: Bonn, Germany
Start-/End Date: 2005-08-07 - 2005-08-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: ICML '05: 22nd international conference on Machine learning
Source Genre: Proceedings
 Creator(s):
Jozef Stefan Institute, Slovenia Program Chairs: Luc D, S, Editor
de Raedt, L, Editor
Wrobel, S, Editor
Affiliations:
-
Publ. Info: New York, NY, USA : ACM Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1036 - 1043 Identifier: ISBN: 1-59593-180-5