![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
International Journal on Digital Libraries, Volume 22
Volume 22, Number 1, March 2021
- Tamires Tessarolli de Souza Barbieri
, Rudinei Goularte
:
Content selection criteria for news multi-video summarization based on human strategies. 1-14 - Satinder Kaur
, Sunil Kumar Gupta:
A fuzzy-based framework for evaluation of website design quality index. 15-47 - Habibollah Asghari, Omid Fatemi
, Salar Mohtaj, Heshaam Faili:
A crowdsourcing approach to construct mono-lingual plagiarism detection corpus. 49-61 - Yasunobu Sumikawa, Ryohei Ikejiri:
Feature selection for classifying multi-labeled past events. 63-83 - Yasunobu Sumikawa, Tatsurou Miyazaki:
Multilabel graph-based classification for missing labels. 85-104 - Yasunobu Sumikawa, Adam Jatowt
:
Analyzing history-related posts in twitter. 105-134 - Xiying Mi
, Richard Bernardy, LeEtta Schmidt
:
Building an archaeological data repository: a digital library and digital humanities collaboration at the University of South Florida. 135-145
Volume 22, Number 2, June 2021
- Gerd Kortemeyer
, Stefan Dröschler:
A user-transaction-based recommendation strategy for an educational digital library. 147-157 - Francesco Foscarin, Philippe Rigaux, Virginie Thion:
Data quality assessment in digital score libraries. 159-173 - Thomas Krämer
, Andrea Papenmeier, Zeljko Carevic, Dagmar Kern, Brigitte Mathiak:
Data-Seeking Behaviour in the Social Sciences. 175-195 - Ehsan Noei
, Tsahi Hayat, Jessica Perrie, Recep Colak, Yanqi Hao, Shankar Vembu, Kelly A. Lyons
, Sam Molyneux:
A qualitative study of large-scale recommendation algorithms for biomedical knowledge bases. 197-215 - Matteo Lorenzini, Marco Rospocher
, Sara Tonelli:
Automatically evaluating the quality of textual descriptions in cultural heritage records. 217-231 - Arpita Chaudhuri, Nilanjan Sinhababu, Monalisa Sarma, Debasis Samanta
:
Hidden features identification for designing an efficient research article recommendation system. 233-249
Volume 22, Number 3, September 2021
- Sorin Hermon
, Franco Niccolucci
:
FAIR Data and Cultural Heritage Special Issue Editorial Note. 251-255 - Olivier Marlet
, Xavier Rodier
:
A way to express the reliability of archaeological data: data traceability at the Laboratoire Archéologie et Territoires (Tours, France). 257-266 - Gerald Hiebel
, Gert Goldenberg, Caroline Grutsch, Klaus Hanke, Markus Staudt:
FAIR data for prehistoric mining archaeology. 267-277 - Lisa Castelli
, Achille Felicetti
, Fabio Proietti:
Heritage Science and Cultural Heritage: standards and tools for establishing cross-domain data interoperability. 279-287 - Marianna Figuera
:
A fuzzy approach to evaluate the attributions reliability in the archaeological sources. 289-296 - Valentina Vassallo
, Achille Felicetti:
Towards an ontological cross-disciplinary solution for multidisciplinary data: VI-SEEM data management and the FAIR principles. 297-307 - Nicola Barbuti
:
Thinking digital libraries for preservation as digital cultural heritage: by R to R4 facet of FAIR principles. 309-318
Volume 22, Number 4, December 2021
- Anastasios Nentidis
, Anastasia Krithara
, Grigorios Tsoumakas, Georgios Paliouras:
What is all this new MeSH about? 319-337 - Marco Fisichella
:
Unified approach to retrospective event detection for event- based epidemic intelligence. 339-364 - Artur Kulmukhametov
, Andreas Rauber, Christoph Becker:
Improving data quality in large-scale repositories through conflict resolution. 365-383 - Nicholas Vanderschantz
, Annika Hinze
:
Children's query formulation and search result exploration. 385-410
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.