OpenRaiser/Intern-Atlas huggingface dataset:
Referenced Publication Years Spectroscopy applied to iMetrics: Scientometrics, Journal of Informetrics, and a relevant subset of JASIST
Venue: arXiv cs.DL 2013
Year: 2013

We have developed a (freeware) routine for "referenced publication years spectroscopy" (RPYS) and apply this method to the historiography of "iMetrics," that is, the junction of the journals Scientometrics, Informetrics, and the relevant subset of JASIST (approx. 20%) that shapes the intellectual space for the development of information metrics (bibliometrics, scientometrics, informetrics, and webometrics). The application to information metrics (our own field of research) provides us with the opportunity to validate this methodology, and to add a reflection about using citations for the historical reconstruction. The results show that the field is rooted in individual contributions of the 1920s-1950s (e.g., Alfred J. Lotka), and was then shaped intellectually in the early 1960s by a confluence of the history of science (Derek de Solla Price), documentation (e.g., Michael M. Kessler's "bibliographic coupling"), and "citation indexing" (Eugene Garfield). Institutional development at the interfaces between science studies and information science has been reinforced by the new journal Informetrics since 2007. In a concluding reflection, we return to the question of how the historiography of science using algorithmic means--in terms of citation practices--can be different from an intellectual history of the field based, for example, on reading source materials.
PROBI: A Heuristic for the probabilistic k-median problem
Venue: arXiv cs.DS 2013
Year: 2013

We develop the heuristic PROBI for the probabilistic Euclidean k-median problem based on a coreset construction by Lammersen et al. Our algorithm computes a summary of the data and then uses an adapted version of k-means++ (Arthur and Vassilvitskii, 2007) to compute a good solution on the summary. The summary is maintained in a data stream, so PROBI can be used in a data stream setting on very large data sets. We experimentally evaluate the quality of the summary and of the computed solution and compare the running time to state of the art data stream clustering algorithms.
Exact Joint Distribution Analysis of Zero-Forcing V-BLAST Gains with Greedy Ordering
Venue: arXiv cs.IT 2013
Year: 2013

We derive the joint probability distribution of zero-forcing (ZF) V-BLAST gains under a greedy selection of decoding order and no error propagation. Unlike the previous approximated analyses, a mathematical framework is built by applying order statistics rules and an exact closed-form joint probability density function expression for squared layer gains is obtained. Our analysis relies on the fact that all orderings are equiprobable under independent and identical Rayleigh fading. Based on this idea, we determine the joint distribution of the ordered gains from the joint distribution of the unordered gains. Our results are applicable for any number of transmit and receive antennas. Although we present our analysis in a ZF V-BLAST setting, our analytical results can be directly applied for the dual cases of ZF V-BLAST. Under the assumption of a low rate feedback of decoding order to the transmitter, a benefit of having exact expressions is illustrated by the calculation of the cutoff value under optimal power allocation that maximizes the sum of the substream outage capacities under a given sum power constraint. We provide numerical results and verify our analysis by means of simulations.
Data Mining using Unguided Symbolic Regression on a Blast Furnace Dataset
Venue: arXiv cs.NE 2013
Year: 2013

In this paper a data mining approach for variable selection and knowledge extraction from datasets is presented. The approach is based on unguided symbolic regression (every variable present in the dataset is treated as the target variable in multiple regression runs) and a novel variable relevance metric for genetic programming. The relevance of each input variable is calculated and a model approximating the target variable is created. The genetic programming configurations with different target variables are executed multiple times to reduce stochastic effects and the aggregated results are displayed as a variable interaction network. This interaction network highlights important system components and implicit relations between the variables. The whole approach is tested on a blast furnace dataset, because of the complexity of the blast furnace and the many interrelations between the variables. Finally the achieved results are discussed with respect to existing knowledge about the blast furnace process.
Combining smart card data and household travel survey to analyze jobs-housing relationships in Beijing
Venue: arXiv cs.SI 2013
Year: 2013

Location Based Services (LBS) provide a new perspective for spatiotemporally analyzing dynamic urban systems. Research has investigated urban dynamics using GSM (Global System for Mobile Communications), GPS (Global Positioning System), SNS (Social Networking Services) and Wi-Fi techniques. However, less attention has been paid to the analysis of urban structure (especially commuting pattern) using smart card data (SCD), which are widely available in most cities. Additionally, ubiquitous LBS data, although providing rich spatial and temporal information, lacks rich information on the social dimension, which limits its in-depth application. To bridge this gap, this paper combines bus SCD for a one-week period with a one-day household travel survey, as well as a parcel-level land use map to identify job-housing locations and commuting trip routes in Beijing. Two data forms (TRIP and PTD) are proposed, with PTD used for jobs-housing identification and TRIP used for commuting trip route identification. The results of the identification are aggregated in the bus stop and traffic analysis zone (TAZ) scales, respectively. Particularly, commuting trips from three typical residential communities to six main business zones are mapped and compared to analyze commuting patterns in Beijing. The identified commuting trips are validated on three levels by comparison with those from the survey in terms of commuting time and distance, and the positive validation results prove the applicability of our approach. Our experiment, as a first step toward enriching LBS data using conventional survey and urban GIS data, can obtain solid identification results based on rules extracted from existing surveys or censuses.
A New Sentinel Approach for Energy Efficient and Hole Aware Wireless Sensor Networks
Venue: arXiv cs.NI 2013
Year: 2013

Recent advances in micro-sensor and communication technology have enabled the emergence of a new technology, Wireless Sensor Networks (WSN). WSN have emerging recently as a key solution to monitor remote or hostile environments and concern a wide range of applications. These networks are faced with many challenges such as energy efficiency usage, topology maintenance, network lifetime maximization, etc. Experience shows that sensing and communications tasks consume energy, therefore judicious power management can effectively extend network lifetime. Moreover, the low cost of sensor devices will allows deployment of huge number nodes that can permit a high redundancy degree. In this paper, we focus on the problem of energy efficiency and topology maintenance in a densely deployed network context. Hence we propose an energy aware sleep scheduling and rapid topology healing scheme for long life wireless sensor networks. Our scheme is a strong node scheduling based mechanism for lifetime maximization in wireless sensor networks and has a fast maintenance method to cover nodes failure. Our sentinel scheme is based on a probabilistic model which provides a distributed sleep scheduling and topology control algorithm. Simulations and experimental results are presented to verify our approach and the performance of our mechanism.
Noise Weighting in the Design of ΔΣ Modulators (with a Psychoacoustic Coder as an Example)
Venue: arXiv cs.IT 2013
Year: 2013

A design flow for ΔΣ modulators is illustrated, allowing quantization noise to be shaped according to an arbitrary weighting profile. Being based on FIR NTFs, possibly with high order, the flow is best suited for digital architectures. The work builds on a recent proposal where the modulator is matched to the reconstruction filter, showing that this type of optimization can benefit a wide range of applications where noise (including in-band noise) is known to have a different impact at different frequencies. The design of a multiband modulator, a modulator avoiding DC noise, and an audio modulator capable of distributing quantization artifacts according to a psychoacoustic model are discussed as examples. A software toolbox is provided as a general design aid and to replicate the proposed results.
Acronym recognition and processing in 22 languages
Venue: arXiv cs.CL 2013
Year: 2013

We are presenting work on recognising acronyms of the form Long-Form (Short-Form) such as "International Monetary Fund (IMF)" in millions of news articles in twenty-two languages, as part of our more general effort to recognise entities and their variants in news text and to use them for the automatic analysis of the news, including the linking of related news across languages. We show how the acronym recognition patterns, initially developed for medical terms, needed to be adapted to the more general news domain and we present evaluation results. We describe our effort to automatically merge the numerous long-form variants referring to the same short-form, while keeping non-related long-forms separate. Finally, we provide extensive statistics on the frequency and the distribution of short-form/long-form pairs across languages.
Sentiment Analysis in the News
Venue: arXiv cs.CL 2013
Year: 2013

Recent years have brought a significant growth in the volume of research in sentiment analysis, mostly on highly subjective text types (movie or product reviews). The main difference these texts have with news articles is that their target is clearly defined and unique across the text. Following different annotation efforts and the analysis of the issues encountered, we realised that news opinion mining is different from that of other text types. We identified three subtasks that need to be addressed: definition of the target; separation of the good and bad news content from the good and bad sentiment expressed on the target; and analysis of clearly marked opinion that is expressed explicitly, not needing interpretation or the use of world knowledge. Furthermore, we distinguish three different possible views on newspaper articles - author, reader and text, which have to be addressed differently at the time of analysing sentiment. Given these definitions, we present work on mining opinions about entities in English language news, in which (a) we test the relative suitability of various sentiment dictionaries and (b) we attempt to separate positive or negative opinion from good or bad news. In the experiments described here, we tested whether or not subject domain-defining vocabulary should be ignored. Results showed that this idea is more appropriate in the context of news opinion mining and that the approaches taking this into consideration produce a better performance.
Generating Explanations for Biomedical Queries
Venue: arXiv cs.AI 2013
Year: 2013

We introduce novel mathematical models and algorithms to generate (shortest or k different) explanations for biomedical queries, using answer set programming. We implement these algorithms and integrate them in BIOQUERY-ASP. We illustrate the usefulness of these methods with some complex biomedical queries related to drug discovery, over the biomedical knowledge resources PHARMGKB, DRUGBANK, BIOGRID, CTD, SIDER, DISEASE ONTOLOGY and ORPHADATA. To appear in Theory and Practice of Logic Programming (TPLP).
Solving OSCAR regularization problems by proximal splitting algorithms
Venue: arXiv cs.CV 2013
Year: 2013

The OSCAR (octagonal selection and clustering algorithm for regression) regularizer consists of a L_1 norm plus a pair-wise L_inf norm (responsible for its grouping behavior) and was proposed to encourage group sparsity in scenarios where the groups are a priori unknown. The OSCAR regularizer has a non-trivial proximity operator, which limits its applicability. We reformulate this regularizer as a weighted sorted L_1 norm, and propose its grouping proximity operator (GPO) and approximate proximity operator (APO), thus making state-of-the-art proximal splitting algorithms (PSAs) available to solve inverse problems with OSCAR regularization. The GPO is in fact the APO followed by additional grouping and averaging operations, which are costly in time and storage, explaining the reason why algorithms with APO are much faster than that with GPO. The convergences of PSAs with GPO are guaranteed since GPO is an exact proximity operator. Although convergence of PSAs with APO is may not be guaranteed, we have experimentally found that APO behaves similarly to GPO when the regularization parameter of the pair-wise L_inf norm is set to an appropriately small value. Experiments on recovery of group-sparse signals (with unknown groups) show that PSAs with APO are very fast and accurate.
Contextually learnt detection of unusual motion-based behaviour in crowded public spaces
Venue: arXiv cs.CV 2013
Year: 2013

In this paper we are interested in analyzing behaviour in crowded public places at the level of holistic motion. Our aim is to learn, without user input, strong scene priors or labelled data, the scope of "normal behaviour" for a particular scene and thus alert to novelty in unseen footage. The first contribution is a low-level motion model based on what we term tracklet primitives, which are scene-specific elementary motions. We propose a clustering-based algorithm for tracklet estimation from local approximations to tracks of appearance features. This is followed by two methods for motion novelty inference from tracklet primitives: (a) we describe an approach based on a non-hierarchial ensemble of Markov chains as a means of capturing behavioural characteristics at different scales, and (b) a more flexible alternative which exhibits a higher generalizing power by accounting for constraints introduced by intentionality and goal-oriented planning of human motion in a particular scene. Evaluated on a 2h long video of a busy city marketplace, both algorithms are shown to be successful at inferring unusual behaviour, the latter model achieving better performance for novelties at a larger spatial scale.
Exploring Programmable Self-Assembly in Non-DNA based Molecular Computing
Venue: arXiv cs.CC 2013
Year: 2013

Self-assembly is a phenomenon observed in nature at all scales where autonomous entities build complex structures, without external influences nor centralised master plan. Modelling such entities and programming correct interactions among them is crucial for controlling the manufacture of desired complex structures at the molecular and supramolecular scale. This work focuses on a programmability model for non DNA-based molecules and complex behaviour analysis of their self-assembled conformations. In particular, we look into modelling, programming and simulation of porphyrin molecules self-assembly and apply Kolgomorov complexity-based techniques to classify and assess simulation results in terms of information content. The analysis focuses on phase transition, clustering, variability and parameter discovery which as a whole pave the way to the notion of complex systems programmability.
Describing Papers and Reviewers' Competences by Taxonomy of Keywords
Venue: arXiv cs.IR 2013
Year: 2013

This article focuses on the importance of the precise calculation of similarity factors between papers and reviewers for performing a fair and accurate automatic assignment of reviewers to papers. It suggests that papers and reviewers' competences should be described by taxonomy of keywords so that the implied hierarchical structure allows similarity measures to take into account not only the number of exactly matching keywords, but in case of non-matching ones to calculate how semantically close they are. The paper also suggests a similarity measure derived from the well-known and widely-used Dice's coefficient, but adapted in a way it could be also applied between sets whose elements are semantically related to each other (as concepts in taxonomy are). It allows a non-zero similarity factor to be accurately calculated between a paper and a reviewer even if they do not share any keyword in common.
Quantitative Homotopy Theory in Topological Data Analysis
Venue: arXiv cs.CG 2013
Year: 2013

This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in terms of the combinatorial notion of contiguity. We generalize the Simplicial Approximation Theorem to show that the contiguity complex approximates the homotopy type of the mapping space as we subdivide the domain. We describe algorithms for approximating the rate of growth of the components of the contiguity complex under subdivision of the domain; this procedure allows us to computationally distinguish spaces with isomorphic homology but different homotopy types.
Removal of Data Incest in Multi-agent Social Learning in Social Networks
Venue: arXiv cs.SI 2013
Year: 2013

Motivated by online reputation systems, we investigate social learning in a network where agents interact on a time dependent graph to estimate an underlying state of nature. Agents record their own private observations, then update their private beliefs about the state of nature using Bayes' rule. Based on their belief, each agent then chooses an action (rating) from a finite set and transmits this action over the social network. An important consequence of such social learning over a network is the ruinous multiple re-use of information known as data incest (or mis-information propagation). In this paper, the data incest management problem in social learning context is formulated on a directed acyclic graph. We give necessary and sufficient conditions on the graph topology of social interactions to eliminate data incest. A data incest removal algorithm is proposed such that the public belief of social learning (and hence the actions of agents) is not affected by data incest propagation. This results in an online reputation system with a higher trust rating. Numerical examples are provided to illustrate the performance of the proposed optimal data incest removal algorithm.
Successive Interference Cancellation in Heterogeneous Cellular Networks
Venue: arXiv cs.IT 2013
Year: 2013

At present, operators address the explosive growth of mobile data demand by densification of the cellular network so as to reduce the transmitter-receiver distance and to achieve higher spectral efficiency. Due to such network densification and the intense proliferation of wireless devices, modern wireless networks are interference-limited, which motivates the use of interference mitigation and coordination techniques. In this work, we develop a statistical framework to evaluate the performance of multi-tier heterogeneous networks with successive interference cancellation (SIC) capabilities, accounting for the computational complexity of the cancellation scheme and relevant network related parameters such as random location of the access points (APs) and mobile users, and the characteristics of the wireless propagation channel. We explicitly model the consecutive events of canceling interferers and we derive the success probability to cancel the n-th strongest signal and to decode the signal of interest after n cancellations. When users are connected to the AP which provides the maximum average received signal power, the analysis indicates that the performance gains of SIC diminish quickly with n and the benefits are modest for realistic values of the signal-to-interference ratio (SIR). We extend the statistical model to include several association policies where distinct gains of SIC are expected: (i) minimum load association, (ii) maxi- mum instantaneous SIR association, and (iii) range expansion. Numerical results show the effectiveness of SIC for the considered association policies. This work deepens the understanding of SIC by defining the achievable gains for different association policies in multi-tier heterogeneous networks.
High-dimensional Joint Sparsity Random Effects Model for Multi-task Learning
Venue: arXiv cs.LG 2013
Year: 2013

Joint sparsity regularization in multi-task learning has attracted much attention in recent years. The traditional convex formulation employs the group Lasso relaxation to achieve joint sparsity across tasks. Although this approach leads to a simple convex formulation, it suffers from several issues due to the looseness of the relaxation. To remedy this problem, we view jointly sparse multi-task learning as a specialized random effects model, and derive a convex relaxation approach that involves two steps. The first step learns the covariance matrix of the coefficients using a convex formulation which we refer to as sparse covariance coding; the second step solves a ridge regression problem with a sparse quadratic regularizer based on the covariance matrix obtained in the first step. It is shown that this approach produces an asymptotically optimal quadratic regularizer in the multitask learning setting when the number of tasks approaches infinity. Experimental results demonstrate that the convex formulation obtained via the proposed model significantly outperforms group Lasso (and related multi-stage formulations
Reasoning about Probabilities in Dynamic Systems using Goal Regression
Venue: arXiv cs.AI 2013
Year: 2013

Reasoning about degrees of belief in uncertain dynamic worlds is fundamental to many applications, such as robotics and planning, where actions modify state properties and sensors provide measurements, both of which are prone to noise. With the exception of limited cases such as Gaussian processes over linear phenomena, belief state evolution can be complex and hard to reason with in a general way. This paper proposes a framework with new results that allows the reduction of subjective probabilities after sensing and acting to questions about the initial state only. We build on an expressive probabilistic first-order logical account by Bacchus, Halpern and Levesque, resulting in a methodology that, in principle, can be coupled with a variety of existing inference solutions.
Building Bridges: Viewing Active Learning from the Multi-Armed Bandit Lens
Venue: arXiv cs.LG 2013
Year: 2013

In this paper we propose a multi-armed bandit inspired, pool based active learning algorithm for the problem of binary classification. By carefully constructing an analogy between active learning and multi-armed bandits, we utilize ideas such as lower confidence bounds, and self-concordant regularization from the multi-armed bandit literature to design our proposed algorithm. Our algorithm is a sequential algorithm, which in each round assigns a sampling distribution on the pool, samples one point from this distribution, and queries the oracle for the label of this sampled point. The design of this sampling distribution is also inspired by the analogy between active learning and multi-armed bandits. We show how to derive lower confidence bounds required by our algorithm. Experimental comparisons to previously proposed active learning algorithms show superior performance on some standard UCI datasets.