amount+of+inequality
81Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… …
82Digital divide — Graph of internet users per 100 inhabitants between 1997 and 2007 by International Telecommunication Union …
83Kullback–Leibler divergence — In probability theory and information theory, the Kullback–Leibler divergence[1][2][3] (also information divergence, information gain, relative entropy, or KLIC) is a non symmetric measure of the difference between two probability distributions P …
84The Wealth of Nations — An Inquiry into the Nature and Causes of the Wealth of Nations is the magnum opus of the Scottish economist Adam Smith. It is a clearly written account of economics at the dawn of the Industrial Revolution, as well as a rhetorical piece written… …
85Social stratification — Sociology …
86Occupy Wall Street — This article is about the protests in New York City. For the wider movement, see Occupy movement. Occupy Wall Street Part of the Occupy movement …
87Social determinants of health — are the economic and social conditions under which people live which determine their health. They are societal risk conditions , rather than individual risk factors that either increase or decrease the risk for a disease, for example for… …
88DOWRY — (Heb. נְדֻנְיָה), the property a wife brings to her husband at marriage; the Yiddish equivalent, nadn, is from the same root. The custom of nedunyah became clearly defined and institutionalized only in the talmudic period. In biblical times,… …
89UNITED STATES OF AMERICA — UNITED STATES OF AMERICA, country in N. America. This article is arranged according to the following outline: introduction Colonial Era, 1654–1776 Early National Period, 1776–1820 German Jewish Period, 1820–1880 East European Jewish Period,… …
90Chernoff bound — In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is better than the first or second moment based tail bounds such as… …
