State-of-the-Art in Group Recommendation and New Approaches for Automatic Identification of Groups
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424 · cited 3×
“A modularity-based Community Detection algorithm proposed by [7] will be run on the network, to find partitions of users in communities.”
MethodInfluentialFinding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 1×
“In 2004 an optimization function has been introduced, the modularity [41], that measures for a generic partition of the set of nodes in the network, the number of internal (in each partition) edges respect to the random case.”
MethodNewman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.056131 · Cited by 2,476 · cited 1×
“A notion of distance or link weight can be introduced but in a pure topological fashion [42].”
BackgroundDiamondTouch: a multi-user touch technology
Dietz, P., & Leigh, D. (2001) · Proceedings of the 14th annual ACM symposium on User interface software and technology · doi:10.1145/502348.502389 · Cited by 1,149
(2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-47096-2 · Cited by 772
The Adaptive Web: Methods and Strategies of Web Personalization
(2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9 · Cited by 710
Advances in Case-Based Reasoning
Smith, I. F. C., & Faltings, B. (1996) · Lecture notes in computer science · doi:10.1007/bfb0020597 · Cited by 648
(2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70987-9 · Cited by 572
PolyLens: A Recommender System for Groups of Users
O’Connor, M., Cosley, D., Konstan, J. A., & Riedl, J. (2005) · ECSCW 2001 · doi:10.1007/0-306-48019-0_11 · Cited by 496 · cited 3×
“PolyLens [44] Movies People who want to see a movie together”
BackgroundInfluentialGroup recommendation: semantics and efficiency
Amer-Yahia, S., Roy, S. B., Chawlat, A., Das, G., & Yu, C. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687713 · Cited by 398 · cited 2×
“In [ 1 ] an approach to compute group recommendation that introduces disagreement between group members as an important aspect to efficiently compute group recommendations is presented.”
BackgroundMethod
Cited by
Social Influence-Based Group Representation Learning for Group Recommendation
Yin, H., Wang, Q., Zheng, K., Li, Z., Yang, J., & Zhou, X. (2019) · 2019 IEEE 35th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2019.00057 · Cited by 196
“In contrast to persistent groups, an occasional group is defined as a number of persons who do something occasionally together, like having a dinner, watching a movie, attending a party and visiting a POI [5].”
Background
Metadata
- Authors
- Boratto, L., & Carta, S.
- Venue
- Studies in Computational Intelligence
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 1-20
- ISSN
- 1860-949X (ISSN-L)
- 1860-9503
- OpenAlex
- W96341436
- Cited by
- 192
- References
- 32
- FWCI
- 19.16
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: State-of-the-Art in Group Recommendation and New Approaches for Automatic Identification of Groups. https://app.cochat.ai/papers/10.1007/978-3-642-16089-9_1
- The paper
- Boratto, L., & Carta, S. (2010). State-of-the-Art in Group Recommendation and New Approaches for Automatic Identification of Groups. Studies in Computational Intelligence. https://doi.org/10.1007/978-3-642-16089-9_1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.