Now showing items 2-6 of 6

  • Dimensionality reduction for dimension-specific search. 

    Huang, Zi; Shen, Heng Tao; Zhou, Xiaofang; Song, Dawei; Ruger, Stefan (ACM http://doi.acm.org/10.1145/1277741.1277940, 2007)
    HUANG, Z., SHEN, H., ZHOU, X., SONG, D. and RUGER, S. 2007. Dimensionality reduction for dimension-specific search. In: C. CLARKE, N. FUHR, N. KANDO, W. KRAAIJ and A. DE VRIES, eds. Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 23-27 July 2007. Amsterdam. pp. 849-850
    Dimensionality reduction plays an important role in efficient similarity search, which is often based on k-nearest neighbor (k-NN) queries over a high-dimensional feature space. In this paper, we introduce a novel type ...
  • Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. 

    Christie, Lee A.; McCall, John; Lonie, David P. (ACM http://dx.doi.org/10.1145/2576768.2598240, 2014)
    CHRISTIE, L. A., MCCALL, J. A. W. and LONIE, D. P., 2014. Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO '14). 12-16 July 2014. New York: ACM. pp. 333-340.
    Problem structure, or linkage, refers to the interaction between variables in a black-box fitness function. Discovering structure is a feature of a range of algorithms, including estimation of distribution algorithms (EDAs) ...
  • Practical algorithms for incremental growth. 

    Macleod, Christopher (Robert Gordon University, 2010)
    MACLEOD, C., 2010. Practical algorithms for incremental growth. Aberdeen: Robert Gordon University.
    This report considers some of the practical issues involved in the implementation of Incremental Growth or Incremental Evolution algorithms as outlined in the paper: Incremental Growth in Modular Neural Networks ...
  • Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (IEEE Computer Society http://dx.doi.org/10.1109/IAT.2007.68, 2007)
    BASHARU, M., ARANA, I and AHRIZ, A., 2007. Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. In: TSAU YOUNG LIN, JEFFREY M. BRADSHAW, MATTHIAS KLUSCH, CHENGQUI ZHANG, ANDREI BRODER and HOWARD HO, eds. 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2007 Main Conference Proceedings). 2-5 November 2007. California, USA. Pp. 335-341.
    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 ...
  • Towards a belief-revision-based adaptive and context-sensitive information retrieval system. 

    Lau, Raymond Y. K.; Bruza, Peter D.; Song, Dawei (ACM http://doi.acm.org/10.1145/1344411.1344414, 2008-03)
    LAU, R. Y. K., BRUZA, P. and SONG, D., 2008. Towards a belief-revision-based adaptive and context-sensitive information retrieval system. ACM Transactions on Information Systems, 26 (2), article 8.
    In an adaptive information retrieval (IR) setting, the information seekers' beliefs about which terms are relevant, or non-relevant, will naturally fluctuate. This article investigates how the theory of belief revision ...