dorsal/arxiv
View SchemaInformation filtering via Iterative Refinement
| Authors | P. Laureti, L. Moret, Y. -C. Zhang, Y. -K. Yu |
|---|---|
| Categories | |
| ArXiv ID | physics/0608166 |
| URL | https://arxiv.org/abs/physics/0608166 |
| DOI | 10.1209/epl/i2006-10204-8 |
| Journal | Europhys. Lett., 75 (6), 1006 (2006) |
Abstract
With the explosive growth of accessible information, expecially on the Internet, evaluation-based filtering has become a crucial task. Various systems have been devised aiming to sort through large volumes of information and select what is likely to be more relevant. In this letter we analyse a new ranking method, where the reputation of information providers is determined self-consistently.
{
"annotation_id": "694a22bc-943c-4d91-a6e6-2ee4c7dcf719",
"date_created": "2026-03-02T18:01:10.965000Z",
"date_modified": "2026-03-02T18:01:10.965000Z",
"file_hash": "a0b41cbb510844f1a51e0618108646346cda97b9748710456fcd5f965907466c",
"private": false,
"record": {
"abstract": "With the explosive growth of accessible information, expecially on the\nInternet, evaluation-based filtering has become a crucial task. Various systems\nhave been devised aiming to sort through large volumes of information and\nselect what is likely to be more relevant. In this letter we analyse a new\nranking method, where the reputation of information providers is determined\nself-consistently.",
"arxiv_id": "physics/0608166",
"authors": [
"P. Laureti",
"L. Moret",
"Y. -C. Zhang",
"Y. -K. Yu"
],
"categories": [
"physics.data-an",
"cs.IR",
"physics.soc-ph"
],
"doi": "10.1209/epl/i2006-10204-8",
"journal_ref": "Europhys. Lett., 75 (6), 1006 (2006)",
"title": "Information filtering via Iterative Refinement",
"url": "https://arxiv.org/abs/physics/0608166"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c88e2253-6e26-4b3a-aef3-a982c83cb728",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}