An intuitive clustering algorithm for spherical data with application to extrasolar planets

This paper proposes an intuitive clustering algorithm capable of automatically self-organizing data groups based on the original data structure. Comparisons between the propopsed algorithm and EM [1 A. Banerjee, I.S. Dhillon, J. Ghosh, and S. Sra, Clustering on the unit hypersphere using von Mises–Fisher distribution, J. Mach. Learn. Res. 6 (2005), pp. 1–39. [Google Scholar]] and spherical k-means [7 I.S. Dhillon and D.S. Modha, Concept decompositions for large sparse text data using clustering, Mach. Learn. 42 (2001), pp. 143–175. doi: 10.1023/A:1007612920971[Crossref], [Web of Science ®] , [Google Scholar]] algorithms are given. These numerical results show the effectiveness of the proposed algorithm, using the correct classification rate and the adjusted Rand index as evaluation criteria [5 J.-M. Chiou and P.-L. Li, Functional clustering and identifying substructures of longitudinal data, J. R. Statist. Soc. Ser. B. 69 (2007), pp. 679–699. doi: 10.1111/j.1467-9868.2007.00605.x[Crossref] , [Google Scholar],6 J.-M. Chiou and P.-L. Li, Correlation-based functional clustering via subspace projection, J. Am. Statist. Assoc. 103 (2008), pp. 1684–1692. doi: 10.1198/016214508000000814[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]. In 1995, Mayor and Queloz announced the detection of the first extrasolar planet (exoplanet) around a Sun-like star. Since then, observational efforts of astronomers have led to the detection of more than 1000 exoplanets. These discoveries may provide important information for understanding the formation and evolution of planetary systems. The proposed clustering algorithm is therefore used to study the data gathered on exoplanets. Two main implications are also suggested: (1) there are three major clusters, which correspond to the exoplanets in the regimes of disc, ongoing tidal and tidal interactions, respectively, and (2) the stellar metallicity does not play a key role in exoplanet migration.     

A generalization of the logistic linear'model

Consider the logistic linear model, with some explanatory variables overlooked. Those explanatory variables may be quantitative or qualitative. In either case, the resulting true response variable is not a binomial or a beta-binomial but a sum of binomials. Hence, standard computer packages for logistic regression can be inappropriate even if an overdispersion factor is incorporated. Therefore, a discrete exponential family assumption is considered to broaden the class of sampling models. Likelihood and Bayesian analyses are discussed. Bayesian computation techniques such as Laplacian approximations and Markov chain simulations are used to compute posterior densities and moments. Approximate conditional distributions are derived and are shown to be accurate. The Markov chain simulations are performed effectively to calculate posterior moments by using the approximate conditional distributions. The methodology is applied to Keeler's hardness of winter wheat data for checking binomial assumptions and to Matsumura's Accounting exams data for detailed likelihood and Bayesian analyses.     

The algorithmic imaginary: exploring the ordinary affects of Facebook algorithms

ABSTRACT

This article reflects the kinds of situations and spaces where people and algorithms meet. In what situations do people become aware of algorithms? How do they experience and make sense of these algorithms, given their often hidden and invisible nature? To what extent does an awareness of algorithms affect people's use of these platforms, if at all? To help answer these questions, this article examines people's personal stories about the Facebook algorithm through tweets and interviews with 25 ordinary users. To understand the spaces where people and algorithms meet, this article develops the notion of the algorithmic imaginary. It is argued that the algorithmic imaginary – ways of thinking about what algorithms are, what they should be and how they function – is not just productive of different moods and sensations but plays a generative role in moulding the Facebook algorithm itself. Examining how algorithms make people feel, then, seems crucial if we want to understand their social power.     

An isotonic regression algorithm

A ‘pooling sets’ type of algorithm is developed and shown to be valid for computing an isotonic regression function for a general quasi-order. The method is direct and intuitive. The algorithm works best when the quasi-order is complex and the objective function is nearly isotonic. An example is worked out in detail.     

Fair task allocation in transportation

Task allocation problems have traditionally focused on cost optimization. However, more and more attention is being given to cases in which cost should not always be the sole or major consideration. In this paper we study a fair task allocation problem in transportation where an optimal allocation not only has low cost but more importantly, it distributes tasks as even as possible among heterogeneous participants who have different capacities and costs to execute tasks. To tackle this fair minimum cost allocation problem we analyze and solve it in two parts using two novel polynomial-time algorithms. We show that despite the new fairness criterion, the proposed algorithms can solve the fair minimum cost allocation problem optimally in polynomial-time. In addition, we conduct an extensive set of experiments to investigate the trade-off between cost minimization and fairness. Our experimental results demonstrate the benefit of factoring fairness into task allocation. Among the majority of test instances, fairness comes with a very small price in terms of cost.     

数据库的通用输出接口

对BASIC语言和关系数据库dBASEⅢ的优点进行了综合,从理论上阐述了在BASIC状态下直接读取关系数据库dBASEⅢ的数据以及数据处理—图形输出的可行性与算法分析;并给出了程行的流程图和一个图形输出实例。     

基于PSO算法优化RBF神经网络的基金净值预测研究

为了更精确地对基金净值进行预测,针对基金净值变化具有非线性和随机性等特点,提出基于粒子群优化RBF神经网络的基金净值预测模型。利用具有全局寻优的PSO算法对RBF神经网络的参数进行优化,并用经PSO算法优化的RBF神经网络对基金净值进行预测分析。仿真实验结果表明:与使用BP神经网络和RBF神经网络的基金价格预测方法相比较,PSO算法优化的RBF神经网络能够准确地预测基金价格的变化趋势,具有较高的预测精度,对于用户选择基金有着非常重要的意义。     

“数据主义”滥觞下的新技术人文：智能时代算法传播的价值转型

智能传播时代,算法和数据技术成为社会基础设施和底层逻辑,并在广泛应用中带来数据主义思潮的盛行。数据主义的哲学渊源来自古希腊时期的毕达哥拉斯主义,主张将万事万物皆转化为算法可以计算的数据,从而根本上消解了人的存在价值和意义;人不再被视为具有独特性与丰富个性的主体,引发深刻的人文危机。基于技术哲学的思考发现,经典人文主义过于强调主客体的二元对立,不可避免陷入决定论的困境。技术与人并不是二元对立的主客体关系,而是具有同构性,且内在于人的主体性之中的存在方式。因此,体现和呈现人性、维护人的主体性和独特尊严成为智能时代算法技术应然的价值导向。但是,智能传播时代需要对传统人文主义进行超越与突破,构建以“人-技”和谐共生为旨归的新形式。     

三个多元正态总体在简单半序约束下均值估计

 多元保序回归理论对统计学中研究多维参数在序约束下的估计理论起着关键性作用。本文讨论了当协方差矩阵已知,在简单半序约束下,对三个多元正态总体均值的估计问题,给出了估计的算法。并证明了在多元均方损失条件下,给出的均值估计优于无序约束的均值估计。     

核主成分遗传算法与SVR选股模型改进

 量化选股一直是金融领域研究的热点。随着人工智能技术的空前发展,量化选股方法取得了很大进步。本文构建了基于核主成分遗传算法改进的支持向量回归机人工智能选股模型(KPCA-GA-SVR),并基于沪深股市股票基本面及交易数据,分别从短期和中长期对其选股性能和预测精度进行了实证分析。主要结论为：①遗传算法(GA)改进的SVR较传统模型预测精度更高,且避免了过度拟合;②与采用主成分降维技术的PCA-GA-SVR模型相比,基于核主成分特征提取的KPCA-GA-SVR模型,具有更好模型稳健性及预测准确性;③中长期内该模型的预测误差随滑窗长度的增加有降低趋势,且一年期预测精度最高;短期内不同滑窗下,一周的预测效果最佳。本研究对个人投资者的投资决策及国家宏观监控股市动态变化都具积极意义。