Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Automatic Scheduling for schools: Scalability of the Hopfield Neural Networks
KTH, School of Computer Science and Communication (CSC).
2015 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This project is focused on evaluating, in terms of real time needed to find a solution, the scalability of Hopfield Neural Networks, a Machine Learning method, applied to a common problem that every educational institution has to deal with at least once in every academic year, timetabling.

With this purpose, the problem is first introduced. And secondly, in the background, the concept of "constraint" is presented, to continue with a brief explanation of Artificial Neural Networks, the state of the art and more specifically, how Hopfield Neural Networks are characterized.

The formulation, modifications used, and the algorithm are presented. This algorithm will be implemented in MATLAB, and it will be run on data sets of different sizes.

The results obtained for the presented data sets are presented in a table and graphs, to later discuss these results. In this discussion, it is found that the time spent to get a solution could scale quadratically with respect to the size of the problem, but there is not statistical evidence to this hypothesis.

Finally, the conclusion is that Hopfield Neural Networks could have a good scalability if the hypothesis worked for bigger data sets, and some future work in the field is presented, like using sparse matrices for the implementation of the problem, or studying the scalability of Hopfield Neural Networks in other kinds of scheduling.

Place, publisher, year, edition, pages
2015.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-166589OAI: oai:DiVA.org:kth-166589DiVA: diva2:811456
Supervisors
Examiners
Available from: 2015-05-12 Created: 2015-05-12 Last updated: 2015-05-12Bibliographically approved

Open Access in DiVA

fulltext(721 kB)128 downloads
File information
File name FULLTEXT01.pdfFile size 721 kBChecksum SHA-512
3bb64338887d9f937fb0ba7c41af4c2589d8f1cfbc0773620bb6a153885a8cfa8caa75a276dc1ab457e453e1375b6082d0fb7db9f6077ec848bcb89ae88974a9
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 128 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 170 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf