No abstract

Collaboration is essential for some types of research, and some agencies include collaboration among the requirements for funding research projects. This makes it important to analyse collaborative research ties. Traditional methods to indicate the extent of collaboration between organizations use co-authorship data in citation databases. Publication data from these databases are not publicly available and can be expensive to access and so hyperlink data has been proposed as an alternative. This paper investigates whether using machine learning methods to filter page types can improve the extent to which hyperlink data can be used to indicate the extent of collaboration between universities. Structured information about research projects extracted from UK and EU funding agency websites, co-authored publications and academic links between universities were analysed to identify if there is any association between the number of hyperlinks connecting two universities, with and without machine learning filtering, and the number of publications they co-authored. An increased correlation was found between the number of inlinks to a university’s website and the extent to which it collaborates with other universities when machine learning techniques were used to filter out apparently irrelevant inlinks.

No abstract

The student project allocation problem is a well-known constraint satisfaction problem that involves assigning students to projects or supervisors based on a number of criteria. This study investigates the use of population-based strategies inspired from physical phenomena (gravitational search algorithm), evolutionary strategies (genetic algorithm), and swarm intelligence (ant colony optimization) to solve the Student Project Allocation problem for a case study from a real university. A population of solutions to the Student Project Allocation problem is represented as lists of integers, and the individuals in the population share information through population-based heuristics to find more optimal solutions. All three techniques produced satisfactory results and the adapted gravitational search algorithm for discrete variables will be useful for other constraint satisfaction problems. However, the ant colony optimization algorithm outperformed the genetic and gravitational search algorithms for finding optimal solutions to the student project allocation problem in this study.

Timetabling is a problem faced in all higher education institutions. The International Timetabling Competition (ITC) has published a dataset that can be used to test the quality of methods used to solve this problem. A number of meta-heuristic approaches have obtained good results when tested on the ITC dataset, however few have used the ant colony optimization technique, particularly on the ITC 2007 curriculum based university course timetabling problem. This study describes an ant system that solves the curriculum based university course timetabling problem and the quality of the algorithm is tested on the ITC 2007 dataset. The ant system was able to find feasible solutions in all instances of the dataset and close to optimal solutions in some instances. The ant system performs better than some published approaches, however results obtained are not as good as those obtained by the best published approaches. This study may be used as a benchmark for ant based algorithms that solve the curriculum based university course timetabling problem.