Paolo Boldi
Paolo Boldi

homepage
boldi

  Affiliation history
Bibliometrics: publication history
Average citations per article19.65
Citation Count1,552
Publication count79
Publication years1993-2017
Available for download35
Average downloads per article526.83
Downloads (cumulative)18,439
Downloads (12 Months)1,004
Downloads (6 Weeks)108
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


78 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 78
Result page: 1 2 3 4

Sort by:

1 published by ACM
June 2018 ACM Transactions on the Web (TWEB): Volume 12 Issue 2, June 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 88,   Downloads (Overall): 88

Full text available: PDFPDF
Although web crawlers have been around for twenty years by now, there is virtually no freely available, open-source crawling software that guarantees high throughput, overcomes the limits of single-machine systems, and, at the same time, scales linearly with the amount of resources available. This article aims at filling this gap, ...
Keywords: Web crawling, centrality measures, distributed systems

2 published by ACM
June 2017 WebSci '17: Proceedings of the 2017 ACM on Web Science Conference
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Downloads (Overall): 49

Full text available: PDFPDF
The panel continues the discussion of ethics within web science from previous years. Beyond fundamental notions such as privacy and intellectual property new challenges arise continuously for researchers as new technologies, platforms, contingencies and people become involved in building the web. Examples for ethical challenges include crowdsourcing as a method, ...

3
November 2016 Science of Computer Programming: Volume 130 Issue C, November 2016
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

We formalize entity linking as an optimization problem.The problem is NP-hard but solvable in linear time under restrictive assumptions.We propose heuristics enforcing the assumptions or optimizing similar objectives.We show how our approaches perform w.r.t. some baselines on real data. Entity-linking is a natural-language-processing task that consists in identifying strings of ...
Keywords: Entity linking, Maximum Capacity Representative Set, Minimum Distance Representative

4
October 2016 Theoretical Computer Science: Volume 648 Issue C, October 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

Minimal-interval semantics 8 associates with each query over a document a set of intervals, called witnesses, that are incomparable with respect to inclusion (i.e., they form an antichain): witnesses define the minimal regions of the document satisfying the query. Minimal-interval semantics makes it easy to define and compute several sophisticated ...
Keywords: Lazy algorithms, Lattices, Information retrieval

5
August 2016 Information Sciences—Informatics and Computer Science, Intelligent Systems, Applications: An International Journal: Volume 354 Issue C, August 2016
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 1

The quest for a model that is able to explain, describe, analyze and simulate real-world complex networks is of uttermost practical, as well as theoretical, interest. In fact, networks can be a natural way to represent many phenomena; often, they arise from a complex interweaving of some features of the ...
Keywords: Complex systems, Indian Buffet process, Social networks

6 published by ACM
May 2016 WebSci '16: Proceedings of the 8th ACM Conference on Web Science
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Downloads (Overall): 53

Full text available: PDFPDF
Besides finding trends and unveiling typical patterns, modern information retrieval is increasingly interested in the discovery of serendipity and surprising information. In this work we focus on finding unexpected links in hyperlinked corpora when documents are assigned to categories. To achieve our goal, we determine a latent category matrix that ...

7
April 2016 WWW '16 Companion: Proceedings of the 25th International Conference Companion on World Wide Web
Publisher: International World Wide Web Conferences Steering Committee
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 4,   Downloads (12 Months): 44,   Downloads (Overall): 157

Full text available: PDFPDF
We propose a novel general technique aimed at pruning and cleansing the Wikipedia category hierarchy, with a tunable level of aggregation. Our approach is endogenous, since it does not use any information coming from Wikipedia articles, but it is based solely on the user-generated (noisy) Wikipedia category folksonomy itself. We ...
Keywords: categorization, networks

8 published by ACM
August 2015 SIGIR '15: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 320

Full text available: PDFPDF
The "Local Ranking Problem" (LRP) is related to the computation of a centrality-like rank on a local graph, where the scores of the nodes could significantly differ from the ones computed on the global graph. Previous work has studied LRP on the hyperlink graph but never on the BrowseGraph, namely ...
Keywords: browsegraph, centrality algorithms, domain-specific browsing graphs, local ranking problem, pagerank

9 published by ACM
May 2015 WWW '15 Companion: Proceedings of the 24th International Conference on World Wide Web
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 40

Full text available: PDFPDF
Given a large complex network, which of its nodes are more central? This question emerged in many contexts (e.g., sociology, psychology and computer science), and gave rise to a large range of proposed centrality measures. Providing a sufficiently general and mathematically sound classification of these measures is challenging: on one ...
Keywords: centrality measures, network analysis, probabilistic counters

10
May 2015 WWW '15: Proceedings of the 24th International Conference on World Wide Web
Publisher: International World Wide Web Conferences Steering Committee
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Downloads (Overall): 240

Full text available: PDFPDF
In this paper we address the problem of estimating the index size needed by web search engines to answer as many queries as possible by exploiting the marked difference between query and click frequencies. We provide a possible formal definition for the notion of essential web pages as those that ...
Keywords: approximation algorithms, click graph, greedy algorithms, layered indices, max cover, query log analysis, tiering, web search

11 published by ACM
April 2014 WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide Web
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Downloads (Overall): 168

Full text available: PDFPDF
Although web crawlers have been around for twenty years by now, there is virtually no freely available, open-source crawling software that guarantees high throughput, overcomes the limits of single-machine tools and at the same time scales linearly with the amount of resources available. This paper aims at filling this gap.
Keywords: distributed systems, web crawling

12
December 2013 ICDMW '13: Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 10

Given a social network, which of its nodes are more central? This question has been asked many times in sociology, psychology and computer science, and a whole plethora of centrality measures (a.k.a. centrality indices, or rankings) were proposed to account for the importance of the nodes of a network. In ...
Keywords: Centrality, Graph algorithms, Distance distribution, Probabilistic counters

13
October 2012 LA-WEB '12: Proceedings of the 2012 Eighth Latin American Web Congress
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Community detection in social networks is a topic of central importance in modern graph mining, and the existence of overlapping communities has recently given rise to new interest in arc clustering. In this paper, we propose the notion of triangular random walk as a way to unveil arc-community structure in ...
Keywords: Algorithms, Experimentation, Social networks

14
August 2012 ASONAM '12: Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 1,   Downloads (12 Months): 1,   Downloads (Overall): 27

Full text available: PDFPDF
We recently measured the average distance of users in the Facebook graph, spurring comments in the scientific community as well as in the general press ("Four Degrees of Separation"). A number of interesting criticisms have been made about the meaningfulness, methods and consequences of the experiment we performed. In this ...
Keywords: degrees of separation, distance distribution, harmonic diameter

15 published by ACM
August 2012 SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 22,   Downloads (Overall): 374

Full text available: PDFPDF
Traditional probabilistic relevance frameworks for informational retrieval refrain from taking positional information into account, due to the hurdles of developing a sound model while avoiding an explosion in the number of parameters. Nonetheless, the well-known BM25F extension of the successful Okapi ranking function can be seen as an embryonic attempt ...
Keywords: query processing, query segmentation, BM25, ranking

16
July 2012 Proceedings of the VLDB Endowment: Volume 5 Issue 11, July 2012
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 0,   Downloads (12 Months): 27,   Downloads (Overall): 194

Full text available: PDFPDF
Data collected nowadays by social-networking applications create fascinating opportunities for building novel services, as well as expanding our understanding about social structures and their dynamics. Unfortunately, publishing social-network graphs is considered an ill-advised practice due to privacy concerns. To alleviate this problem, several anonymization methods have been proposed, aiming at ...

17 published by ACM
June 2012 WebSci '12: Proceedings of the 4th Annual ACM Web Science Conference
Publisher: ACM
Bibliometrics:
Citation Count: 47
Downloads (6 Weeks): 17,   Downloads (12 Months): 151,   Downloads (Overall): 1,093

Full text available: PDFPDF
Frigyes Karinthy, in his 1929 short story "Láncszemek" (in English, "Chains") suggested that any two persons are distanced by at most six friendship links. 1 Stanley Milgram in his famous experiments challenged people to route postcards to a fixed recipient by passing them only through direct acquaintances. Milgram found that ...

18
January 2012 Theory of Computing Systems: Volume 50 Issue 1, January 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0


19
October 2011 SocInfo'11: Proceedings of the Third international conference on Social informatics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

Given a social network, which of its nodes have a stronger impact in determining its structure? More formally: which node-removal order has the greatest impact on the network structure? We approach this well-known problem for the first time in a setting that combines both web graphs and social networks, using ...

20
June 2011 Information Retrieval: Volume 14 Issue 3, June 2011
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 12

Understanding query reformulation patterns is a key task towards next generation web search engines. If we can do that, then we can build systems able to understand and possibly predict user intent, providing the needed assistance at the right time, and thus helping users locate information more effectively and improving ...
Keywords: Session segmentation, Query flow graph, Query recommendation, Query log mining



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us