Tamas Nemeth

University of Szeged · Department of Computer Algorithms and Artificial Intelligence

In this study, we discuss the possible application of the ubiquitous complex network approach for information extraction from educational data. Since a huge amount of data (which is detailed as well) is produced by the complex administration systems of educational institutes, instead of the classical statistical methods, new types of data processin...

We define a modified PageRank algorithm and the P R-score to measure the influence of a single article by using its local co-citation network. We also calculate the reaching probability and RP-score of a paper starting at an arbitrary article of its co-citation network for the same purpose. We highlight the advantages of our methods by applying the...

In this study, a mathematical model is presented for an online data clustering problem. Data clustering plays an important role in many applications like handling the data acknowledgment problem and data stream management in real-time locating systems. The inputs in these problems are data sequences, each containing several data elements. Each data...

In this paper, we define a modified PageRank algorithm as a data mining technique with the aim of evaluating the achievements of students and generate a ranking between them. We applied our method to the data set of a complex administrational system that contains numerous well detailed data of several schools in public education. In order that the...

In this paper a novel ranking method which may be useful in sports like tennis, table tennis or American football, etc. is introduced and analyzed. In order to rank the players or teams, a time-dependent PageRank based method is applied on the directed and weighted graph representing game results in a sport competition. The method was examined on t...

In this paper a novel ranking method which may be useful in sports like tennis, table tennis or American football, etc. is introduced and analyzed. In order to rank the players or teams, a time-dependent PageRank based method is applied on the directed and weighted graph representing game results in a sport competition. The method was examined on t...

This paper proposes and evaluates solutions for an online clustering problem and gives a mathematical model for it. The problem at hand occurs often in the fusion of data streams for example in real time locating systems. The goal is to gather as much incoming information from several sources as possible but also minimize the delay before the next...

In the communication aspect of a computer network, data is sent by packets. If the communication channel is not completely safe, then the arrival of the packets must be acknowledged. In the data acknowledgment problem the goal is to determine the time of sending acknowledgments. Here we study lookahead online algorithms, where at time t the algorit...

In the communication aspect of a computer network, data are sent by packets. If the communication channel is not completely safe, then the arrival of the packets must be acknowledged. In the data-acknowledgment problem, the goal is to determine the time of sending acknowledgments. Here we present a new online algorithm for it, where the algorithm i...

In multiprocessor scheduling with rejection the jobs are characterized by a processing time and a penalty and it is possible to reject the jobs. The goal is to minimize the makespan of the schedule for the accepted jobs plus the sum of the penalties of the rejected jobs. In this paper we present a new online algorithm for the problem. Our algorithm...

In this work we investigate such online algorithms for the data acknowledgement problem, which have extra information about the arrival time of the packets in the following time interval of length c. We present an algorithm with the smallest possible competitive ratio for the maximum of delay type objective function. In the case of the sum of delay...