Polytraits : a database on biological traits of marine polychaetes

The study of ecosystem functioning – the role which organisms play in an ecosystem – is becoming increasingly important in marine ecological research. The functional structure of a community can be represented by a set of functional traits assigned to behavioural, reproductive and morphological characteristics. The collection of these traits from the literature is however a laborious and time-consuming process, and gaps of knowledge and restricted availability of literature are a common problem. Trait data are not yet readily being shared by research communities, and even if they are, a lack of trait data repositories and standards for data formats leads to the publication of trait information in forms which cannot be processed by computers. This paper describes Polytraits (http://polytraits.lifewatchgreece.eu), a database on biological traits of marine polychaetes (bristle worms, Polychaeta: Annelida). At present, the database contains almost 20,000 records on morphological, behavioural and reproductive characteristics of more than 1,000 marine polychaete species, all referenced by literature sources. All data can be freely accessed through the project website in different ways and formats, both human-readable and machine-readable, and have been submitted to the Encyclopedia of Life for archival and integration with trait information from other sources

Living analytics methods for the social web

[no abstract

Arboreal ants use the "Velcro® principle" to capture very large prey

Plant-ants live in a mutualistic association with host plants known as "myrmecophytes" that provide them with a nesting place and sometimes with extra-floral nectar (EFN) and/or food bodies (FBs); the ants can also attend sap-sucking Hemiptera for their honeydew. In return, plant-ants, like most other arboreal ants, protect their host plants from defoliators. To satisfy their nitrogen requirements, however, some have optimized their ability to capture prey in the restricted environment represented by the crowns of trees by using elaborate hunting techniques. In this study, we investigated the predatory behavior of the ant Azteca andreae which is associated with the myrmecophyte Cecropia obtusa. We noted that up to 8350 ant workers per tree hide side-by-side beneath the leaf margins of their host plant with their mandibles open, waiting for insects to alight. The latter are immediately seized by their extremities, and then spread-eagled; nestmates are recruited to help stretch, carve up and transport prey. This group ambush hunting technique is particularly effective when the underside of the leaves is downy, as is the case for C. obtusa. In this case, the hook-shaped claws of the A. andreae workers and the velvet-like structure of the underside of the leaves combine to act like natural VelcroH that is reinforced by the group ambush strategy of the workers, allowing them to capture prey of up to 13,350 times the mean weight of a single worker

Predicting User Engagement in Twitter with Collaborative Ranking

Collaborative Filtering (CF) is a core component of popular web-based services such as Amazon, YouTube, Netflix, and Twitter. Most applications use CF to recommend a small set of items to the user. For instance, YouTube presents to a user a list of top-n videos she would likely watch next based on her rating and viewing history. Current methods of CF evaluation have been focused on assessing the quality of a predicted rating or the ranking performance for top-n recommended items. However, restricting the recommender system evaluation to these two aspects is rather limiting and neglects other dimensions that could better characterize a well-perceived recommendation. In this paper, instead of optimizing rating or top-n recommendation, we focus on the task of predicting which items generate the highest user engagement. In particular, we use Twitter as our testbed and cast the problem as a Collaborative Ranking task where the rich features extracted from the metadata of the tweets help to complement the transaction information limited to user ids, item ids, ratings and timestamps. We learn a scoring function that directly optimizes the user engagement in terms of nDCG@10 on the predicted ranking. Experiments conducted on an extended version of the MovieTweetings dataset, released as part of the RecSys Challenge 2014, show the effectiveness of our approach.Comment: RecSysChallenge'14 at RecSys 2014, October 10, 2014, Foster City, CA, US

A cross-benchmark comparison of 87 learning to rank methods

Learning to rank is an increasingly important scientific field that comprises the use of machine learning for the ranking task. New learning to rank methods are generally evaluated on benchmark test collections. However, comparison of learning to rank methods based on evaluation results is hindered by the absence of a standard set of evaluation benchmark collections. In this paper we propose a way to compare learning to rank methods based on a sparse set of evaluation results on a set of benchmark datasets. Our comparison methodology consists of two components: (1) Normalized Winning Number, which gives insight in the ranking accuracy of the learning to rank method, and (2) Ideal Winning Number, which gives insight in the degree of certainty concerning its ranking accuracy. Evaluation results of 87 learning to rank methods on 20 well-known benchmark datasets are collected through a structured literature search. ListNet, SmoothRank, FenchelRank, FSMRank, LRUF and LARF are Pareto optimal learning to rank methods in the Normalized Winning Number and Ideal Winning Number dimensions, listed in increasing order of Normalized Winning Number and decreasing order of Ideal Winning Number

Using Differential Evolution in order to create a personalized list of recommended items

The recommendation systems are used to suggest new, still not discovered items to users. At the moment, in order to achieve the best quality of the generated recommendations, users and their choices in the system must be analyzed to create a certain profile of preferences for a given user in order to adjust the generated recommendation to his personal taste. This article will present a recommendation system, which based on the Differential Evolution (DE) algorithm will learn the ranking function while directly optimizing the average precision (AP) for the selected user in the system. To achieve that, items are represented through a feature vectors generated using user-item matrix factorization. The experiments have been conducted on a popular and widely available public dataset MovieLens, and show that our approach in certain situations can significantly improve the quality of the generated recommendations. Results of experiments are compared with other techniques

An ant-colony based approach for real-time implicit collaborative information seeking

This document is an Accepted Manuscript of the following article: Alessio Malizia, Kai A. Olsen, Tommaso Turchi, and Pierluigi Crescenzi, ‘An ant-colony based approach for real-time implicit collaborative information seeking’, Information Processing & Management, Vol. 53 (3): 608-623, May 2017. Under embargo until 31 July 2018. The final, definitive version of this paper is available online at doi: https://doi.org/10.1016/j.ipm.2016.12.005, published by Elsevier Ltd.We propose an approach based on Swarm Intelligence — more specifically on Ant Colony Optimization (ACO) — to improve search engines’ performance and reduce information overload by exploiting collective users’ behavior. We designed and developed three different algorithms that employ an ACO-inspired strategy to provide implicit collaborative-seeking features in real time to search engines. The three different algorithms — NaïveRank, RandomRank, and SessionRank — leverage on different principles of ACO in order to exploit users’ interactions and provide them with more relevant results. We designed an evaluation experiment employing two widely used standard datasets of query-click logs issued to two major Web search engines. The results demonstrated how each algorithm is suitable to be employed in ranking results of different types of queries depending on users’ intent.Peer reviewedFinal Accepted Versio