Search

Mining the relationship structures among the investors plays a vital role in promoting economic development as well as preventing financial risks, especially in the context of big data. This article proposes fast networking approaches from investment big data to explore three underlying structures, namely, investment pedigrees, investment groups, and structural holes. Inspired by disjoint sets and path compression, we first present a pedigree classification algorithm to identify investment pedigrees. Second, through introducing a pruning strategy and a data structure termed as “2-tuple list,” we develop a novel linear-time structure mining algorithm in network (SMAN) for investigating investment groups and structural holes from the investment pedigree. Finally, we show that our SMAN has higher clustering accuracy and efficiency than other existing algorithms on a variety of real-world tasks in terms of normalized mutual information (NMI) values. Our method is particularly well suited for mining the underlying structures from investment big data. [ABSTRACT FROM AUTHOR]

In a social network, even about the same information the excitement between different users are different. If we want to spread a piece of new information and maximize the expected total amount of excitement, which seed users should we choose? This problem indeed is substantially different from the renowned influence maximization problem and cannot be tackled using the existing approaches. In this paper, motivated by the demand in a few interesting applications, we model the novel problem of activity maximization, and tackle the problem systematically. We first analyze the complexity and the approximability of the problem. We develop an upper bound and a lower bound that are submodular so that the Sandwich framework can be applied. We then devise a polling-based randomized algorithm that guarantees a data dependent approximation factor. Our experiments on four real data sets clearly verify the effectiveness and scalability of our method, as well as the advantage of our method against the other heuristic methods. [ABSTRACT FROM PUBLISHER]

Digital ecosystems (DEs) are based on a large amount of distributed data, and these data are gathered from physical devices, particularly from wireless sensor networks (WSNs). Due to the inherent stringent bandwidth and energy constraints, energy-efficient mechanisms of performance measurement are the key to the proper operation of WSNs and thereby important for the data reliability of DEs. This paper presents a novel algorithm, i.e., Loss Inference based on Passive Measurement (LIPM), to infer WSN link loss performance. The LIPM algorithm passively monitors the application traffic between sensor nodes and the sink (base station), and then uses network tomography technology to infer the network internal performance. Furthermore, contour maps, the well-known representation of data, are first taken into account in WSN loss performance inference, which can help the LIPM algorithm identify lossy areas rapidly. Finally, the algorithm is validated through simulations and exhibits good performance and scalability. [ABSTRACT FROM AUTHOR]

We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a set of source nodes to the sink. This problem is crucial for advanced computation-intensive applications, where traditional "maximum" in-network compression may result in significant computation energy. We investigate a tunable data compression technique that enables effective tradeoffs between the computation and communication costs. We derive the optimal compression strategy for a given data gathering tree and then investigate the performance of different tree structures for networks deployed on a grid topology as well as general graphs. Our analytical results pertaining to the grid topology and simulation results pertaining to the general graphs indicate that the performance of a simple greedy approximation to the Minimal Steiner Tree (MST) provides a constant factor approximation for the grid topology and good average performance on the general graphs. Although theoretically, a more complicated randomized algorithm offers a poly-logarithmic performance bound, the simple greedy approximation of MST is attractive for practical implementation. [ABSTRACT FROM AUTHOR]

Ensemble learning algorithms train multiple component learners and then combine their predictions. In order to generate a strong ensemble, the component learners should be with high accuracy as well as high diversity. A popularly used scheme in generating accurate but diverse component learners is to perturb the training data with resampling methods, such as the boot-strap sampling used in bagging. However, such a scheme is not very effective on local learners such as nearest-neighbor classifiers because a slight change in training data can hardly result in local learners with big differences. In this paper, a new ensemble algorithm named Filtered Attribute Subspace based Bagging with Injected Randomness (FASBIR) is proposed for building ensembles of local learners, which utilizes multimodal perturbation to help generate accurate but diverse component learners. In detail, FASBIR employs the perturbation on the training data with boot-strap sampling, the perturbation on the input attributes with attribute filtering and attribute subspace selection, and the perturbation on the learning parameters with randomly configured distance metrics. A large empirical study shows that FASBIR is effective in building ensembles of nearest-neighbor classifiers, whose performance is better than that of many other ensemble algorithms. [ABSTRACT FROM AUTHOR]