Epidemiological and evolutionary inference of the transmission network of the 2014 highly pathogenic Avian Influenza H5N2 outbreak in British Columbia, Canada

The first North American outbreak of highly pathogenic avian influenza (HPAI) involving a virus of Eurasian A/goose/Guangdong/1/1996 (H5N1) lineage began in the Fraser Valley of British Columbia, Canada in late November 2014. A total of 11 commercial and 1 non-commercial (backyard) operations were infected before the outbreak was terminated. Control measures included movement restrictions that were placed on a total of 404 individual premises, 150 of which were located within a 3 km radius of an infected premise(s) (IP). A complete epidemiological investigation revealed that the source of this HPAI H5N2 virus for 4 of the commercial IPs and the single non-commercial IP likely involved indirect contact with wild birds. Three IPs were associated with the movement of birds or service providers and localized/environmental spread was suspected as the source of infection for the remaining 4 IPs. Viral phylogenies, as determined by Bayesian Inference and Maximum Likelihood methods, were used to validate the epidemiologically inferred transmission network. The phylogenetic clustering of concatenated viral genomes and the median-joining phylogenetic network of the viruses supported, for the most part, the transmission network that was inferred by the epidemiologic analysis.

Global profit split: An evolutionary approach to international income allocation

International taxation is concerned mainly with the equitable allocation of cross-border income between countries in which income-earning activities take place. Such allocation has traditionally been governed by the arm’s-length principle, which has been interpreted as requiring a comparable transactional pricing approach. This approach assumes that each member of a multinational enterprise (MNE) group is a separate entity and that the transactions between related parties can be separated and compared with arm’s-length transactions. It has, however, proved difficult to apply comparable transactional pricing to internationally integrated businesses, especially those involving intangibles and services, and formulary apportionment has been suggested as an alternative. Essentially, formulary apportionment treats the MNE group as a single economic entity. The group’s profit is allocated to members according to a formula that reflects the particular member’s contribution to the production of that profit. A rich academic literature exists which either defends or attacks this alternative approach. The OECD and national governments have rejected formulary apportionment mainly on the ground that it violates the arm’s-length principle. This article proposes a global profit split (GPS) method for allocating international income. The GPS would allocate the global profit of an integrated business to each country in accordance with the economic contributions made by components of the business located in that country. The allocation would be based on a formula that would reflect the economic factors that contribute to profit making. While the GPS draws on elements of the traditional formulary apportionment and profit split methods, it also differs from them. The author discusses in detail the key issues involved in designing the GPS. She also presents and evaluates the main policy and pragmatic justifications for the adoption of this innovative approach. The author argues that the GPS is not only theoretically and practically superior to traditional income allocation methods, but also consistent with the arm’s-length principle. On the basis of historical developments, interpretation of article 9 of the OECD model tax convention, and international tax policy considerations, the author establishes that the GPS is not a radical departure from the arm’s-length principle, but rather a natural development in its evolution. She concludes that the law of evolution ison the side of reform because the GPS would provide for a fair and effective allocation of income derived from globally integrated business activities.

SCLOPE: an algorithm for clustering data streams of categorical attributes

Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose SCLOPE, a novel algorithm based on CLOPErsquos intuitive observation about cluster histograms. Unlike CLOPE however, our algo- rithm is very fast and operates within the constraints of a data stream environment. In particular, we designed SCLOPE according to the recent CluStream framework. Our evaluation of SCLOPE shows very promising results. It consistently outperforms CLOPE in speed and scalability tests on our data sets while maintaining high cluster purity; it also supports cluster analysis that other algorithms in its class do not.

ó-SCLOPE : clustering categorical streams using attribute selection

Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose σ-SCLOPE, a novel algorithm based on SCLOPE’s intuitive observation about cluster histograms. Unlike SCLOPE however, our algorithm consumes less memory per window and has a better clustering runtime for the same data stream in a given window. This positions σ-SCLOPE as a more attractive option over SCLOPE if a minor lost of clustering accuracy is insignificant in the application.

Density based fuzzy c-means clustering of non-convex patterns

We propose a new technique to perform unsupervised data classification (clustering) based on density induced metric and non-smooth optimization. Our goal is to automatically recognize multidimensional clusters of non-convex shape. We present a modification of the fuzzy c-means algorithm, which uses the data induced metric, defined with the help of Delaunay triangulation. We detail computation of the distances in such a metric using graph algorithms. To find optimal positions of cluster prototypes we employ the discrete gradient method of non-smooth optimization. The new clustering method is capable to identify non-convex overlapped d-dimensional clusters.

Fuzzy clustering of non-convex patterns using global optimization

This paper discusses various extensions of the classical within-group sum of squared errors functional, routinely used as the clustering criterion. Fuzzy c-means algorithm is extended to the case when clusters have irregular shapes, by representing the clusters with more than one prototype. The resulting minimization problem is non-convex and non-smooth. A recently developed cutting angle method of global optimization is applied to this difficult problem

Evolutionary structure learning algorithm for Bayesian network and penalized mutual information metric

This paper formulates the problem of learning Bayesian network structures from data as determining the structure that best approximates the probability distribution indicated by the data. A new metric, Penalized Mutual Information metric, is proposed, and a evolutionary algorithm is designed to search for the best structure among alternatives. The experimental results show that this approach is reliable and promising.

Web page clustering : a hyperlink-based similarity and matrix-based hierarchical algorithms

This paper proposes a hyperlink-based web page similarity measurement and two matrix-based hierarchical web page clustering algorithms. The web page similarity measurement incorporates hyperlink transitivity and page importance within the concerned web page space. One clustering algorithm takes cluster overlapping into account, another one does not. These algorithxms do not require predefined similarity thresholds for clustering, and are independent of the page order. The primary evaluations show the effectiveness of the proposed algorithms in clustering improvement.

Utilizing hyperlink transitivity to improve web page clustering

The rapid increase of web complexity and size makes web searched results far from satisfaction in many cases due to a huge amount of information returned by search engines. How to find intrinsic relationships among the web pages at a higher level to implement efficient web searched information management and retrieval is becoming a challenge problem. In this paper, we propose an approach to measure web page similarity. This approach takes hyperlink transitivity and page importance into consideration. From this new similarity measurement, an effective hierarchical web page clustering algorithm is proposed. The primary evaluations show the effectiveness of the new similarity measurement and the improvement of web page clustering. The proposed page similarity, as well as the matrix-based hyperlink analysis methods, could be applied to other web-based research areas..

A maximal frequent itemset approach for web document clustering

To efficiently and yet accurately cluster Web documents is of great interests to Web users and is a key component of the searching accuracy of a Web search engine. To achieve this, this paper introduces a new approach for the clustering of Web documents, which is called maximal frequent itemset (MFI) approach. Iterative clustering algorithms, such as K-means and expectation-maximization (EM), are sensitive to their initial conditions. MFI approach firstly locates the center points of high density clusters precisely. These center points then are used as initial points for the K-means algorithm. Our experimental results tested on 3 Web document sets show that our MFI approach outperforms the other methods we compared in most cases, particularly in the case of large number of categories in Web document sets.

An immune network approach for web document clustering

The human immune system provides inspiration for solving a wide range of innovative problems. In this paper, we propse an immune network based approach for web document clustering. All the immune cells in the network competitively recognize the antigens (web documents) which are presented to the network one by one. The interaction between immune cells and an antigen leads to an augment of the network through the clonal selection and somatic mutation of the stimulated immune cells, while the interaction among immune cells results in a network compression. The structure of the immune network is well maintained by learning and self-regularity. We use a public web document data set to test the effectiveness of our method and compare it with other approaches. The experimental results demonstrate that the most striking advantage of immune-based data clustering is its adaptation in dynamic environment and the capability of finding new clusters automatically.