Linear prediction models with graph regularization for Web-page categorization

Tong Zhang; Alexandrin Popescul; Byron Dom

doi:10.1145/1150402.1150510

Linear prediction models with graph regularization for Web-page categorization

Tong Zhang
, Alexandrin Popescul
, Byron Dom

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We present a risk minimization formulation for learning from both text and graph structures which is motivated by the problem of collective inference for hypertext document categorization. The method is based on graph regularization formulated as a well-formed convex optimization problem. We present numerical algorithms for our formulation, and show that such combination of local text features and link information can lead to improved predictive accuracy.

Original language	English (US)
Title of host publication	KDD 2006
Subtitle of host publication	Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Publisher	Association for Computing Machinery
Pages	821-826
Number of pages	6
ISBN (Print)	1595933395, 9781595933393
DOIs	https://doi.org/10.1145/1150402.1150510
State	Published - 2006
Externally published	Yes
Event	KDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - Philadelphia, PA, United States Duration: Aug 20 2006 → Aug 23 2006

Publication series

Name	Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Volume	2006

Other

Other	KDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Country/Territory	United States
City	Philadelphia, PA
Period	8/20/06 → 8/23/06

Keywords

Collective inference
Document classification
Graph and relational learning
Regularization
Semi-supervised learning

ASJC Scopus subject areas

Software
Information Systems

Online availability

10.1145/1150402.1150510

Library availability

Discover UIUC Full Text

Cite this

Zhang, T., Popescul, A., & Dom, B. (2006). Linear prediction models with graph regularization for Web-page categorization. In KDD 2006: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 821-826). (Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; Vol. 2006). Association for Computing Machinery. https://doi.org/10.1145/1150402.1150510

Linear prediction models with graph regularization for Web-page categorization. / Zhang, Tong; Popescul, Alexandrin; Dom, Byron.
KDD 2006: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, 2006. p. 821-826 (Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; Vol. 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhang, T, Popescul, A & Dom, B 2006, Linear prediction models with graph regularization for Web-page categorization. in KDD 2006: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 2006, Association for Computing Machinery, pp. 821-826, KDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, United States, 8/20/06. https://doi.org/10.1145/1150402.1150510

Zhang T, Popescul A, Dom B. Linear prediction models with graph regularization for Web-page categorization. In KDD 2006: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery. 2006. p. 821-826. (Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining). doi: 10.1145/1150402.1150510

Zhang, Tong ; Popescul, Alexandrin ; Dom, Byron. / Linear prediction models with graph regularization for Web-page categorization. KDD 2006: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, 2006. pp. 821-826 (Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining).

@inproceedings{8e676b20b4aa4a48ad83ebb06acc03c4,

title = "Linear prediction models with graph regularization for Web-page categorization",

abstract = "We present a risk minimization formulation for learning from both text and graph structures which is motivated by the problem of collective inference for hypertext document categorization. The method is based on graph regularization formulated as a well-formed convex optimization problem. We present numerical algorithms for our formulation, and show that such combination of local text features and link information can lead to improved predictive accuracy.",

keywords = "Collective inference, Document classification, Graph and relational learning, Regularization, Semi-supervised learning",

author = "Tong Zhang and Alexandrin Popescul and Byron Dom",

year = "2006",

doi = "10.1145/1150402.1150510",

language = "English (US)",

isbn = "1595933395",

series = "Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",

publisher = "Association for Computing Machinery",

pages = "821--826",

booktitle = "KDD 2006",

address = "United States",

note = "KDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ; Conference date: 20-08-2006 Through 23-08-2006",

}

TY - GEN

T1 - Linear prediction models with graph regularization for Web-page categorization

AU - Zhang, Tong

AU - Popescul, Alexandrin

AU - Dom, Byron

PY - 2006

Y1 - 2006

N2 - We present a risk minimization formulation for learning from both text and graph structures which is motivated by the problem of collective inference for hypertext document categorization. The method is based on graph regularization formulated as a well-formed convex optimization problem. We present numerical algorithms for our formulation, and show that such combination of local text features and link information can lead to improved predictive accuracy.

AB - We present a risk minimization formulation for learning from both text and graph structures which is motivated by the problem of collective inference for hypertext document categorization. The method is based on graph regularization formulated as a well-formed convex optimization problem. We present numerical algorithms for our formulation, and show that such combination of local text features and link information can lead to improved predictive accuracy.

KW - Collective inference

KW - Document classification

KW - Graph and relational learning

KW - Regularization

KW - Semi-supervised learning

UR - https://www.scopus.com/pages/publications/33749580724

UR - https://www.scopus.com/pages/publications/33749580724#tab=citedBy

U2 - 10.1145/1150402.1150510

DO - 10.1145/1150402.1150510

M3 - Conference contribution

AN - SCOPUS:33749580724

SN - 1595933395

SN - 9781595933393

T3 - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

SP - 821

EP - 826

BT - KDD 2006

PB - Association for Computing Machinery

T2 - KDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Y2 - 20 August 2006 through 23 August 2006

ER -

Linear prediction models with graph regularization for Web-page categorization

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this