Skip to main content

Bachelor Thesis

If you are interested in working on any of the bachelor theses listed below, please express your interest to the Institute of Project Management and Innovation (IPMI) by submitting your completed profile [Download: Steckbrief_Bachelorarbeit.docx] to M.Sc. Lena Kronemeyer until 23.10.2020. After your application, we will contact you for a personal interview as soon as possible. If both sides agree, you will receive the confirmation to write your thesis at IPMI immediately (even before 23.10.). Applications are treated by the principle of first come, first serve.

During the time you are working on the thesis you will be guided intensively by one of our research associates. The IPMI offers a seminar for preparation purposes on 3rd of November (beginning at 2:00 PM). The seminar will give you advice in writing a bachelor thesis and all topics will be finally assigned.

All bachelor theses are timed at IPMI, so all students will start their thesis on 26.10.2020 and will have finished their thesis depending on the regulations of their bachelor program. Final Grades will be given by no later than the end of the semester.

Nils DenterExtraktion von semantischen Textbestandteilen mittels Maschinellen Lernens
Nils DenterGoogle Patents als Ergänzung der US-amerikanischen Patentdatenbank
Phuong NguyenThe evolution of technologies and business methods in construction based on patent analysis in the US (in English)
Lena KronemeyerRecherche und Anwendung von Relevanzbewertungsmethoden zur Erstellung von semantischen Ankerpunkten
Lena KronemeyerAnalyse der Patentanmelder am Fallbeispiel Getriebetechnologie
Lena KronemeyerRecherche von aufgegebenen bzw. abgeschlossenen Forschungsthemen und Erstellung eines jeweiligen Patentdatensatzes
Mei Yun LaiText-Mining Analyse wissenschaftlicher Publikationen über die Technologien im Bereich der künstlichen Photosynthese
Mei Yun LaiFinding star scientists in electric vehicles based on authorship and inventorship
Mei Yun LaiComparison of ML-based techniques for pairwise document and text similarities

 

 

 

 

 

 

 

 

 

Updated by: IPMI