scispace - formally typeset
Search or ask a question
Author

Christos Makris

Bio: Christos Makris is an academic researcher from University of Patras. The author has contributed to research in topics: Cluster analysis & Data structure. The author has an hindex of 24, co-authored 185 publications receiving 1839 citations. Previous affiliations of Christos Makris include Research Academic Computer Technology Institute.


Papers
More filters
Journal ArticleDOI
TL;DR: A system offering a solution to the problem of ambulance management and emergency incident handling in the prefecture of Attica in Greece based on the integration of geographic information system, global positioning system and global system for mobile communication technologies is described.

134 citations

Journal ArticleDOI
TL;DR: This work proposes a methodology for source code quality and static behaviour evaluation of a software system, based on the standard ISO/IEC-9126, which uses elements automatically derived from source code enhanced with expert knowledge in the form of quality characteristic rankings.
Abstract: This work proposes a methodology for source code quality and static behaviour evaluation of a software system, based on the standard ISO/IEC-9126. It uses elements automatically derived from source code enhanced with expert knowledge in the form of quality characteristic rankings, allowing software engineers to assign weights to source code attributes. It is flexible in terms of the set of metrics and source code attributes employed, even in terms of the ISO/IEC-9126 characteristics to be assessed. We applied the methodology to two case studies, involving five open source and one proprietary system. Results demonstrated that the methodology can capture software quality trends and express expert perceptions concerning system quality in a quantitative and systematic manner.

64 citations

Journal ArticleDOI
01 Apr 2008
TL;DR: The proposed infrastructure includes a set of services and tools to support an integrated WS discovery and selection solution that delivers the WS that maximizes the value of QoS characteristics among others with the same functionality.
Abstract: This work proposes a Web Service (WS) discovery model in which the functional and non-functional requirements are taken into account during service discovery. The proposed infrastructure includes a set of services and tools to support an integrated WS discovery and selection solution. A mechanism is introduced that supports three different functional policies. It is able to take advantage of quality information located into a Web Service description language description file that might be located in a proprietary universal description, discovery and integration registry server or in an independent URL. Moreover, it implements a database supported WS intermediary (Broker) that it is also possible to store quality of service (QoS) information for WSs. A selection module is also presented that delivers the WS that maximizes the value of QoS characteristics among others with the same functionality. An experimental prototype is presented and evaluated in the scenario of air ticket issuing WS selection.

63 citations

Journal ArticleDOI
01 Mar 2005
TL;DR: This work argues that there is no need to search all the search space of candidate itemsets but rather let the database unveil its secrets as the customers use it, and proposes a system that acts like a search engine specifically implemented for making recommendations to the customers using techniques borrowed from Information Retrieval.
Abstract: The classic two-stepped approach of the Apriori algorithm and its descendants, which consisted of finding all large itemsets and then using these itemsets to generate all association rules has worked well for certain categories of data Nevertheless for many other data types this approach shows highly degraded performance and proves rather inefficientWe argue that we need to search all the search space of candidate itemsets but rather let the database unveil its secrets as the customers use it We propose a system that does not merely scan all possible combinations of the itemsets, but rather acts like a search engine specifically implemented for making recommendations to the customers using techniques borrowed from Information Retrieval

60 citations

Journal ArticleDOI
01 Jan 2007
TL;DR: A new concept is introduced; search based on ranking of local set of categories that comprise a user search profile, and new algorithms are presented that utilize web page categories to personalize search results.
Abstract: Despite the effectiveness of search engines, the persistently increasing amount of web data continuously obscures the search task. Efforts have thus concentrated on personalized search that takes account of user preferences. A new concept is introduced towards this direction; search based on ranking of local set of categories that comprise a user search profile. New algorithms are presented that utilize web page categories to personalize search results. Series of user-based experiments show that the proposed solutions are efficient. Finally, we extend the application of our techniques in the design of topic-focused crawlers, which can be considered an alternative personalized search.

56 citations


Cited by
More filters
01 Jan 2002

9,314 citations

01 Jan 2012

3,692 citations

Book
02 Jan 1991

1,377 citations

Journal ArticleDOI
01 Dec 2006
TL;DR: Models and Methods in Social Network Analysis presents the most important developments in quantitative models and methods for analyzing social network data that have appeared during the 1990s.
Abstract: Models and Methods in Social Network Analysis presents the most important developments in quantitative models and methods for analyzing social network data that have appeared during the 1990s. Intended as a complement to Wasserman and Faust’s Social Network Analysis: Methods and Applications, it is a collection of original articles by leading methodologists reviewing recent advances in their particular areas of network methods. Reviewed are advances in network measurement, network sampling, the analysis of centrality, positional analysis or blockmodeling, the analysis of diffusion through networks, the analysis of affiliation or “two-mode” networks, the theory of random graphs, dependence graphs, exponential families of random graphs, the analysis of longitudinal network data, graphic techniques for exploring network data, and software for the analysis of social networks.

855 citations

Book
01 Jan 1975
TL;DR: The major change in the second edition of this book is the addition of a new chapter on probabilistic retrieval, which I think is one of the most interesting and active areas of research in information retrieval.
Abstract: The major change in the second edition of this book is the addition of a new chapter on probabilistic retrieval. This chapter has been included because I think this is one of the most interesting and active areas of research in information retrieval. There are still many problems to be solved so I hope that this particular chapter will be of some help to those who want to advance the state of knowledge in this area. All the other chapters have been updated by including some of the more recent work on the topics covered. In preparing this new edition I have benefited from discussions with Bruce Croft, The material of this book is aimed at advanced undergraduate information (or computer) science students, postgraduate library science students, and research workers in the field of IR. Some of the chapters, particularly Chapter 6 * , make simple use of a little advanced mathematics. However, the necessary mathematical tools can be easily mastered from numerous mathematical texts that now exist and, in any case, references have been given where the mathematics occur. I had to face the problem of balancing clarity of exposition with density of references. I was tempted to give large numbers of references but was afraid they would have destroyed the continuity of the text. I have tried to steer a middle course and not compete with the Annual Review of Information Science and Technology. Normally one is encouraged to cite only works that have been published in some readily accessible form, such as a book or periodical. Unfortunately, much of the interesting work in IR is contained in technical reports and Ph.D. theses. For example, most the work done on the SMART system at Cornell is available only in reports. Luckily many of these are now available through the National Technical Information Service (U.S.) and University Microfilms (U.K.). I have not avoided using these sources although if the same material is accessible more readily in some other form I have given it preference. I should like to acknowledge my considerable debt to many people and institutions that have helped me. Let me say first that they are responsible for many of the ideas in this book but that only I wish to be held responsible. My greatest debt is to Karen Sparck Jones who taught me to research information retrieval as an experimental science. Nick Jardine and Robin …

822 citations