Affinity rank: A new scheme for efficient web search

Yi Liu; Benyu Zhang; Zheng Chen; Michael R. Lyu; Wei-Ying Ma

doi:10.1145/1013367.1013464

Affinity rank: A new scheme for efficient web search

Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, Wei-Ying Ma

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

5 Citations (Scopus)

Abstract

Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative documents. In this paper, we propose two new metrics to evaluate the performance of information retrieval: diversity, which measures the topic coverage of a group of documents, and information richness, which measures the amount of information contained in a document. Then we present a novel ranking scheme, Affinity Rank, which utilizes these two metrics to improve search results. We demonstrate how Affinity Rank works by a toy data set, and verify our method by experiments on real-world data sets.

Original language	English
Title of host publication	Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004
Publisher	Association for Computing Machinery
Pages	338-339
ISBN (Print)	1581139128, 9781581139129
DOIs	https://doi.org/10.1145/1013367.1013464
Publication status	Published - 19 May 2004
Externally published	Yes
Event	13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004 - New York, United States Duration: 19 May 2004 → 21 May 2004

Publication series

Name	Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

Conference

Conference	13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004
Place	United States
City	New York
Period	19/05/04 → 21/05/04

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

The work was done in Microsoft Research Asia, and was partially supported by grants from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CUHK4182/03E and CUHK4351/02E).

Research Keywords

Affinity rank
Diversity
Information richness
Link analysis

RGC Funding Information

RGC-funded

Access Output

10.1145/1013367.1013464

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Liu, Y., Zhang, B., Chen, Z., Lyu, M. R., & Ma, W.-Y. (2004). Affinity rank: A new scheme for efficient web search. In Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004 (pp. 338-339). (Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004). Association for Computing Machinery. https://doi.org/10.1145/1013367.1013464

Liu, Yi ; Zhang, Benyu ; Chen, Zheng et al. / Affinity rank : A new scheme for efficient web search. Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004. Association for Computing Machinery, 2004. pp. 338-339 (Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004).

@inproceedings{5262b45e3dfe4bf89917d569e91c0db6,

title = "Affinity rank: A new scheme for efficient web search",

abstract = "Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative documents. In this paper, we propose two new metrics to evaluate the performance of information retrieval: diversity, which measures the topic coverage of a group of documents, and information richness, which measures the amount of information contained in a document. Then we present a novel ranking scheme, Affinity Rank, which utilizes these two metrics to improve search results. We demonstrate how Affinity Rank works by a toy data set, and verify our method by experiments on real-world data sets.",

keywords = "Affinity rank, Diversity, Information richness, Link analysis",

author = "Yi Liu and Benyu Zhang and Zheng Chen and Lyu, {Michael R.} and Wei-Ying Ma",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004 ; Conference date: 19-05-2004 Through 21-05-2004",

year = "2004",

month = may,

day = "19",

doi = "10.1145/1013367.1013464",

language = "English",

isbn = "1581139128",

series = "Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004",

publisher = "Association for Computing Machinery",

pages = "338--339",

booktitle = "Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004",

address = "United States",

}

Liu, Y, Zhang, B, Chen, Z, Lyu, MR & Ma, W-Y 2004, Affinity rank: A new scheme for efficient web search. in Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004. Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004, Association for Computing Machinery, pp. 338-339, 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004, New York, United States, 19/05/04. https://doi.org/10.1145/1013367.1013464

Affinity rank: A new scheme for efficient web search. / Liu, Yi; Zhang, Benyu; Chen, Zheng et al.
Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004. Association for Computing Machinery, 2004. p. 338-339 (Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Affinity rank

T2 - 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

AU - Liu, Yi

AU - Zhang, Benyu

AU - Chen, Zheng

AU - Lyu, Michael R.

AU - Ma, Wei-Ying

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2004/5/19

Y1 - 2004/5/19

N2 - Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative documents. In this paper, we propose two new metrics to evaluate the performance of information retrieval: diversity, which measures the topic coverage of a group of documents, and information richness, which measures the amount of information contained in a document. Then we present a novel ranking scheme, Affinity Rank, which utilizes these two metrics to improve search results. We demonstrate how Affinity Rank works by a toy data set, and verify our method by experiments on real-world data sets.

AB - Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative documents. In this paper, we propose two new metrics to evaluate the performance of information retrieval: diversity, which measures the topic coverage of a group of documents, and information richness, which measures the amount of information contained in a document. Then we present a novel ranking scheme, Affinity Rank, which utilizes these two metrics to improve search results. We demonstrate how Affinity Rank works by a toy data set, and verify our method by experiments on real-world data sets.

KW - Affinity rank

KW - Diversity

KW - Information richness

KW - Link analysis

UR - http://www.scopus.com/inward/record.url?scp=80051534941&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-80051534941&origin=recordpage

U2 - 10.1145/1013367.1013464

DO - 10.1145/1013367.1013464

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1581139128

SN - 9781581139129

T3 - Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

SP - 338

EP - 339

BT - Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

PB - Association for Computing Machinery

Y2 - 19 May 2004 through 21 May 2004

ER -

Liu Y, Zhang B, Chen Z, Lyu MR, Ma WY. Affinity rank: A new scheme for efficient web search. In Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004. Association for Computing Machinery. 2004. p. 338-339. (Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004). doi: 10.1145/1013367.1013464

Affinity rank: A new scheme for efficient web search

Abstract

Publication series

Conference

Bibliographical note

Funding

Research Keywords

RGC Funding Information

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this