Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

Test-retest reliabilities of resting-state FMRI measurements in human brain functional connectomics: A systems neuroscience perspective

Therefore, the seeker after the truth is not one who studies the writings of the ancients and, following his natural disposition, puts his trust in them, but rather the one who suspects his faith in them and questions what he gathers from them, the one who submits to argument and demonstration, and not to the sayings of a human being whose nature is fraught with all kinds of imperfection and de‹ciency. Thus the duty of the man who investigates the writings of scientists, if learning the truth is his goal, is to make himself the enemy of all that he reads, and, applying his mind to the core and margins of its content, attack it from every side. He should also suspect himself as he performs his critical examination of it, so that he may avoid falling into either prejudice or leniency. (Ibn al-Haytham)1

국제정치이론 = Theory of international politics

Expert Political Judgment: How Good Is It? How Can We Know? By Philip E. Tetlock. Princeton: Princeton University Press, 2005. 352p. $45.00 cloth, $19.95 paper. This is a wonderful and important book. Philip Tetlock is a political psychologist who has a knack for innovative research projects (e.g., his earlier work on how people cope with trade-offs in politics). In this book, he addresses a question that would scare away more timid souls: How well do experts predict political and economic events?

Expert Political Judgment: How Good Is It? How Can We Know?

The roles of different nodes within a network are often understood through centrality analysis, which aims to quantify the capacity of a node to influence, or be influenced by, other nodes via its connection topology. Many different centrality measures have been proposed, but the degree to which they offer unique information, and whether it is advantageous to use multiple centrality measures to define node roles, is unclear. Here we calculate correlations between 17 different centrality measures across 212 diverse real-world networks, examine how these correlations relate to variations in network density and global topology, and investigate whether nodes can be clustered into distinct classes according to their centrality profiles. We find that centrality measures are generally positively correlated to each other, the strength of these correlations varies across networks, and network modularity plays a key role in driving these cross-network variations. Data-driven clustering of nodes based on centrality profiles can distinguish different roles, including topological cores of highly central nodes and peripheries of less central nodes. Our findings illustrate how network topology shapes the pattern of correlations between centrality measures and demonstrate how a comparative approach to network centrality can inform the interpretation of nodal roles in complex networks.

/pdf/consistency-and-differences-between-centrality-measures-1ej3rjtb7d.pdf

Consistency and differences between centrality measures across distinct classes of networks.

https://www.math.wvu.edu/~cqzhang/Publication-files/my-paper/INS-2012-Laplacian-W.pdf

Laplacian centrality: A new centrality measure for weighted networks

Determination of sequence similarity is one of the major steps in computational phylogenetic studies. As we know, during the evolution history, not only DNA mutations for individual nucleotide but also subsequence rearrangements occurred. It has been one of major tasks for computational biologists to develop novel mathematical descriptors for similarity analysis such that various of mutation phenomena information would be involved simultaneously. In this paper, different from traditional ways (eg, nucleotide frequency, geometric representations) as bases for construction of mathematical descriptors, we will construct a novel mathematical descriptors based on graph theory. In particular, for each DNA sequence, we will set up a weighted directed graph. The adjacency matrix of the directed graph will be used to induce a representative vector for DNA sequence. This new approach measures similarity based on both ordering and frequency of nucleotides so that much more information are involved. As an application, the method is tested on a set of 0.9-kb mtDNA sequences of twelve different primate species. All output phylogenetic trees with various distance estimations have the same topology, and are generally consistent with the reported results from early studies, which proves the new method's efficiency; we also test the new method on simulated data set, which shows our new method performs better than traditional globally alignment method when subsequence rearrangements happen a lot during evolutionary history.

/pdf/a-novel-model-for-dna-sequence-similarity-analysis-based-on-1v3axllnnz.pdf

A Novel Model for DNA Sequence Similarity Analysis Based on Graph Theory

In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with n vertices is defined as , where  is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.

https://file.scirp.org/pdf/SN_2013012914560597.pdf

Terrorist Networks, Network Energy and Node Removal: A New Measure of Centrality Based on Laplacian Energy

Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods. Inspired by the idea of vertex centrality, a novel centrality guided clustering (CGC) is proposed in this paper. Different from traditional clustering methods which usually choose the initial center of a cluster randomly, the CGC clustering algorithm starts from a “LEADER”—a vertex with the highest centrality score—and a new “member” is added into the same cluster as the “LEADER” when some criterion is satisfied. The CGC algorithm also supports overlapping membership. Experiments on three benchmark social network data sets are presented and the results indicate that the proposed CGC algorithm works well in social network clustering.

/pdf/follow-the-leader-a-centrality-guided-clustering-and-its-4n9gh63141.pdf

"Follow the leader": a centrality guided clustering and its application to social network analysis.

Extremist political movements have proliferated on the web in recent years due to the advent of minimal publication costs coupled with near universal access, resulting in what appears to be an abundance of groups that hover on the fringe of many socially divisive issues. Whether white-supremacist, neo- Nazi, anti-abortion, black separatist, radical Christian, animal rights, or violent environmentalists, all have found a home (and voice) on the Web. These groups form social networks whose ties are predicated primarily on shared political goals. Little is known about these groups, their interconnections, their animosities, and most importantly, their growth and development and studies such as the Dark Web Project, while considering domestic extremists, have focused primarily on international terrorist groups. Yet here in the US, there has been a complex social dynamic unfolding as well. While left-wing radicalism declined throughout the 80s and 90s, right wing hate groups began to flourish. Today, the web offers a place for any brand of extremism, but little is understood about their current growth and development. While there is much to gain from in-depth studies of the content provided by these sites, there is also a surprising amount of information contained in their online network structure as manifested in links between and among these web sites. Our research follows the idea that much can be known about you by the company you keep. In this paper, we propose an approach to measure the intrinsic relationships (i.e., similarities) of a set of extremist web pages. In this model, the web presence of a group is thought of as a node in a social network and the links between these pages are the ties between groups. This approach takes the bi-directional hyperlink structure of web pages and, based on similarity scores, applies an effective multi-membership clustering algorithm known as the quasi clique merger method to cluster these web pages using a derived hierarchical tree. The experimental results show that this new similarity measurement and hierarchical clustering algorithm gives an improvement over traditional link based clustering methods.

Qin Wu

Papers

Laplacian centrality: A new centrality measure for weighted networks

A Novel Model for DNA Sequence Similarity Analysis Based on Graph Theory

Terrorist Networks, Network Energy and Node Removal: A New Measure of Centrality Based on Laplacian Energy

"Follow the leader": a centrality guided clustering and its application to social network analysis.

A Hierarchical Algorithm for Clustering Extremist Web Pages