Andreas Geyer-Schulz

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Michael Hahsler

> Home > Persons > Andreas Geyer-Schulz

Publications

2003
[c11]
- view
- export record
  dblp key:
  - conf/birthday/Geyer-SchulzHNT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/Geyer-SchulzHNT03
Andreas Geyer-Schulz, Michael Hahsler, Andreas W. Neumann, Anke Thede:
Recommenderdienste für wissenschaftliche Bibliotheken und Bibliotheksverbünde. Informationswirtschaft: Ein Sektor mit Zukunft 2003: 43-57
2002
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/kdd/Geyer-SchulzH02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kdd/Geyer-SchulzH02
Andreas Geyer-Schulz, Michael Hahsler:
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers. WEBKDD 2002: 137-158
2001
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/kdd/Geyer-SchulzHJ01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kdd/Geyer-SchulzHJ01
Andreas Geyer-Schulz, Michael Hahsler, Maximillian Jahn:
A Customer Purchase Incidence Model Applied to Recommender Services. WEBKDD 2001: 25-47
[c7]
- view
  - electronic edition @ emis.de
  - no references & citations available
- export record
  dblp key:
  - conf/uh/Geyer-SchulzHJ01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uh/Geyer-SchulzHJ01
Andreas Geyer-Schulz, Michael Hahsler, Maximillian Jahn:
Wissenschaftliche Recommendersysteme in Virtuellen Universitäten. UH 2001: 101-114

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.