Feature selection is an important topic in machine learning. In recent years, via integrating ensemble learning, the ensemble learning based feature selection approach has been proposed and studied. The general idea is to generate multiple diverse feature selectors and combine their outputs. This approach is superior to conventional feature selection methods in many aspects. Among them, its most prominent advantage is the ability to handle stability issue that is usually poor in existing feature selection methods. This review covers different issues related to ensemble learning based feature selection, which include the main modules, the stability measurement, etc. To the best of our knowledge, this is the first review that focuses on ensemble feature selection. It can be a useful reference in the literature of feature selection.
Background: Novel coronavirus disease (COVID-19) has spread across the world at an unprecedented pace, reaching over 200 countries and territories in less than three months. In response, many governments denied entry to travellers arriving from various countries affected by the virus. While several industries continue to experience economic losses due to the imposed interventions, it is unclear whether the different travel restrictions were successful in reducing COVID-19 importations. Methods: Here we develop a comprehensive probabilistic framework to model daily COVID-19 importations, considering different travel bans. We quantify the temporal effects of the restrictions and elucidate the relationship between incidence rates in other countries, travel flows and the expected number of importations into the country under investigation. Results: As a cases study, we evaluate the travel bans enforced by the Australian government. We find that international travel bans in Australia lowered COVID-19 importations by 87.68% (83.39 - 91.35) between January and June 2020. The presented framework can further be used to gain insights into how many importations to expect should borders re-open. Conclusions: While travel bans lowered the number of COVID-19 importations overall, the effectiveness of bans on individual countries varies widely and directly depends on the change in behaviour in returning residents and citizens. Authorities may consider the presented information when planning a phased re-opening of international borders.
Personal IoT data is a new economic asset that individuals can trade to generate revenue on the emerging data marketplaces. Typically, marketplaces are centralized systems that raise concerns of privacy, single point of failure, little transparency and involve trusted intermediaries to be fair. Furthermore, the battery-operated IoT devices limit the amount of IoT data to be traded in real-time that affects buyer/seller satisfaction and hence, impacting the sustainability and usability of such a marketplace. This work proposes to utilize blockchain technology to realize a trusted and transparent decentralized marketplace for contract compliance for trading IoT data streams generated by battery-operated IoT devices in real-time. The contribution of this paper is two-fold: (1) we propose an autonomous blockchain-based marketplace equipped with essential functionalities such as agreement framework, pricing model and rating mechanism to create an effective marketplace framework without involving a mediator, (2) we propose a mechanism for selection and allocation of buyers' demands on seller's devices under quality and battery constraints. We present a proof-of-concept implementation in Ethereum to demonstrate the feasibility of the framework. We investigated the impact of buyer's demand on the battery drainage of the IoT devices under different scenarios through extensive simulations. Our results show that this approach is viable and benefits the seller and buyer for creating a sustainable marketplace model for trading IoT data in real-time from battery-powered IoT devices.
COVID-19 has had a substantial impact globally. It spreads readily, particularly in enclosed and crowded spaces, such as public transport carriages, yet there are limited studies on how this risk can be reduced. We developed a tool for exploring the potential impacts of mitigation strategies on public transport networks, called the Systems Analytics for Epidemiology in Transport (SAfE Transport). SAfE Transport combines an agent-based transit assignment model, a community-wide transmission model, and a transit disease spread model to support strategic and operational decision-making. For this simulated COVID-19 case study, the transit disease spread model incorporates both direct (person-to-person) and fomite (person-to-surface-to-person) transmission modes. We determine the probable impact of wearing face masks on trains over a seven day simulation horizon, showing substantial and statistically significant reductions in new cases when passenger mask wearing proportions are greater than 80%. The higher the level of mask coverage, the greater the reduction in the number of new infections. Also, the higher levels of mask coverage result in an earlier reduction in disease spread risk. These results can be used by decision makers to guide policy on face mask use for public transport networks.
28 February 2014 in International Journal of Multimedia and Ubiquitous Engineering
We consider the problem of deleting nodes in a covert network to minimize its performance. The inverse geodesic length (IGL) is a well-known and widely used measure of network performance. It equals the sum of the inverse distances of all pairs of vertices. In the MinIGL problem the input is a graph $G$, a budget $k$, and a target IGL $T$, and the question is whether there exists a subset of vertices $X$ with $|X|=k$, such that the IGL of $G-X$ is at most $T$. In network analysis, the IGL is often used to evaluate how well heuristics perform in strengthening or weakening a network. In this paper, we undertake a study of the classical and parameterized complexity of the MinIGL problem. The problem is NP-complete even if $T=0$ and remains both NP-complete and $W[1]$-hard for parameter $k$ on bipartite and on split graphs. On the positive side, we design several multivariate algorithms for the problem. Our main result is an algorithm for MinIGL parameterized by the twin cover number.