Skip to main content

Research Repository

Advanced Search

Learning and optimization of an aspect hidden markov model for query language model generation. (2007)
Conference Proceeding
HUANG, Q., SONG, D., RUGER, S. and BRUZA, P. 2007. Learning and optimization of an aspect hidden markov model for query language model generation. In Dominich, S. and Kiss, F. (eds.) Studies in theory of information retrieval: proceedings of the 1st Association of Computing Machinery Special Interest Group on Information Retrieval (ACM SIGIR) international conference on the theory of information retrieval (ICTIR'07), 18-20 October 2007, Budapest, Hungary. Budapest: Foundation for Information Society (INFOTA), pages 157-164.

The Relevance Model (RM) incorporates pseudo relevance feedback to derive query language model and has shown a good performance. Generally, it is based on uni-gram models of individual feedback documents from which query terms are sampled independent... Read More about Learning and optimization of an aspect hidden markov model for query language model generation..

Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. (2007)
Conference Proceeding
BASHARU, M., ARANA, I. and AHRIZ, A. 2007. Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. In Lin, T.Y., Bradshaw, J.M., Klusch, M., Zhang, C., Broder, A. and Ho, H. (eds.) Proceedings of the 2007 IEEE/WIC/ACM international conference on intelligent agent technology (IAT 2007), 2-5 November 2007, Silicon Valley, USA. Los Alamitos: IEEE Computer Society [online], article number 4407307, pages 335-341. Available from: https://doi.org/10.1109/IAT.2007.68

We present Multi-DisPel, a penalty-based local search distributed algorithm which is able to solve coarse-grained Distributed Constraint Satisfaction Problems (DisCSPs) efficiently. Multi-DisPeL uses penalties on values in order to escape local optim... Read More about Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd..

DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems. (2007)
Conference Proceeding
BASHARU, M., ARANA, I. and AHRIZ, H. 2008. DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems. In Bramer, M., Coenen, F. and Petridis, M. (eds.) Research and development in intelligent systems XXIV: technical proceedings of the 27th Annual international conference of the British Computer Society's Specialist Group on Artificial Intelligence (SGAI) (AI-2007): innovative techniques and applications of artificial intelligence, 10-12 December 2007, Cambridge, UK. London: Springer [online], pages 23-36. Available from: https://doi.org/10.1007/978-1-84800-094-0_3

We present a distributed iterative improvement algorithm for solving coarse-grained distributed constraint satisfaction problems (DisCSPs). Our algorithm is inspired by the Distributed Breakout for coarse-grained DisCSPs where we introduce a constrai... Read More about DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems..

Escaping local optima: constraint weights vs value penalties. (2007)
Conference Proceeding
BASHARU, M., ARANA, I. and AHRIZ, H. 2008. Escaping local optima: constraint weights vs. value penalties. In Bramer, M., Coenen, F. and Petridis, M. (eds.) Research and development in intelligent systems XXIV: technical proceedings of the 27th Annual international conference of the British Computer Society's Specialist Group on Artificial Intelligence (SGAI) (AI-2007): innovative techniques and applications of artificial intelligence, 10-12 December 2007, Cambridge, UK. London: Springer [online], pages 51-64. Available from: https://doi.org/10.1007/978-1-84800-094-0_5

Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the constructive search techniques on large problems, but they have a propensi... Read More about Escaping local optima: constraint weights vs value penalties..

Classifying XML documents by using genre features. (2007)
Conference Proceeding
CLARK, M. and WATT, S. 2007. Classifying XML documents by using genre features. In Tjoa, A.M. and Wagner, R.R. (eds.) Proceedings of the 18th International workshop on database and expert systems applications (DEXA 2007), 3-7 September 2007, Regensburg, Germany. Los Alamitos: IEEE Computer Society [online], article number 4312894, pages 242-248. Available from: https://doi.org/10.1109/DEXA.2007.120

The categorization of documents is traditionally topic-based. This paper presents a complementary analysis of research and experiments on genre to show that encouraging results can be obtained by using genre structure (form) features. We conducted an... Read More about Classifying XML documents by using genre features..

Structured text retrieval by means of affordances and genre. (2007)
Conference Proceeding
CLARK, M. 2007. Structured text retrieval by means of affordances and genre. In MacFarlane, A., Azzopardi, L. and Ounis, I. (eds.) Proceedings of the 1st British Computer Society Information Retrieval Specialist Group (BCS IRSG) symposium on future directions in information access (FDIA 2007), 28-29 August 2007, Glasgow, UK. London: BCS [online]. Available from: https://ewic.bcs.org/content/ConWebDoc/13788

This paper offers a proposal for some preliminary research on the retrieval of structured text, such as extensible mark-up language (XML). We believe that capturing the way in which a reader perceives the meaning of documents, especially genres of te... Read More about Structured text retrieval by means of affordances and genre..