Search engine run on: http://users.monash.edu.au/

Glookbib search for: zz0118

%A J. Dressel
%A H. Farid
%T The accuracy, fairness, and limits of predicting recidivism
%J Sci. Adv.
%V 4
%N 1
%P eaao5580
%M JAN
%D 2018
%K jrnl, COMPAS, program, law, legal, justice, courts, gaol, jail, reoffender,
   reoffending, criminal, recidivism, parole, c2018, c201x, c20xx, zz0118,
   stats, AI, II, software, Dtree, controversial
%X "Algs. for predicting recidivism are commonly used to assess a criminal
   defendant's likelihood of committing a crime. ... used in pretrial, parole, &
   sentencing decisions. Proponents ... argue that big data & advanced machine
   learning make these analyses more accurate & less biased than humans. We show
   however that the widely used commercial risk assessment s/w COMPAS is no more
   accurate or fair than predictions made by people with little or no criminal
   justice expertise. [&] show that a simple linear predictor provided with only
   two features is nearly equivalent to COMPAS with its 137 features."
   -- [doi:10.1126/sciadv.aao5580]['18].
   ((Also see: COMPAS Classification software,
   "The COMPAS Classification software is a management support tool that
   can be interfaced with existing jail management systems to provide critical
   inmate management ... Classification - Decision Tree Primary Classification
   and Reclassification Instruments ..."
   [www][1/2018].))

%A A. Singh
%A D. Garg
%T Implementation and performance analysis of exponential tree sorting
%J Int. J. of Comp. Applications
%V 24
%N 3
%P ?-?
%M JUN
%D 2011
%K jrnl, c2011, c201x, c20xx, zz0118, integer, sort, sorting, algorithm,
   expected time, Andersson, exponential tree
%X "The trad.alg. for sorting gives a bound of O(n log n) expected time without
   randomization & O(n) with randomization. Recent researches have optimized
   lower bound for deterministic algs. for int.sorting [1-3]. Andersson has
   given the idea of Exponential tree which can be used for sorting [4].
   Andersson, Hagerup, Nilson & Raman have given an alg. which sorts n integers
   in O(n log log n) expected time but uses O(m) space [4, 5]. Andersson has
   given improved alg. which sort integers in O(n log log n) expected time &
   linear space but uses randomization [2, 4]. Yijie Han has improved further to
   sort integers in O(n log log n) expected time & linear space but passes
   integers in a batch i.e. all integers at a time [6]. These algs. are very
   complex to implement. In this paper we discussed a way to implement the
   exponential tree sorting & later compare results with traditional sorting
   technique."
   -- pdf@[www]['18].
   (*NB. "expected time", not "worst-case time".*)

%A J. Alman
%A V. V. Williams
%T Further limitations of the known approaches for matrix multiplication
%J arXiv
%M DEC
%D 2017
%O 9th Innovations in Theor. Comp. Sci. Conf. (ITCS 2018)
%K TR, c2017, c201x, c20xx, zz0118, fast, matrix multiplication, algorithm
%X "... showing that all known matrix multiplication running times since 1986
   can be achieved from a single very natural tensor - the structural tensor Tq
   of addition modulo an integer q.  (2)We show that if one applies a
   generalization of the known techniques (arbitrary zeroing out of tensor
   powers to obtain independent matrix products in order to use the asymptotic
   sum inequality of Schonhage) to an arbitrary monomial degeneration of Tq,
   then there is an explicit lower bound, depending on q, on the bound on the
   matrix mult. exponent w that one can achieve. We also show upper bounds on
   the value alpha that one can achieve, where alpha is such that
   n x n^alpha x n matrix mult. can be computed in n2+o(1) time.  (3)We show
   that our lower bound on w approaches 2 as q goes to infinity. This suggests
   a promising approach to improving the bound on ω: for variable q, ..."
   -- 1712.07246@[arXiv]['17].
   [Also search for: fast matrix multiplication algorithm].

%A R. Heckel
%A M. Simchowitz
%A K. Ramchandran
%A M. J. Wainwright
%T Approximate ranking from pairwise comparisons
%J arXiv
%M JAN
%D 2018
%K TR, c2018, c201x, c20xx, zz0118, rank, approximate ranking, algorithm,
   sorting, top k, topK, score, comparison, pairwise
   of pre-specified sizes according to their scores, which includes
   identification of the top-k items as the most prominent special case. The
   score of a given item is defined as the probability that it beats a randomly
   chosen other item. Finding an exact ranking typically requires a
   prohibitively large # of comparisons, but in practice, approx. rankings are
   often adequate. ... study the problem of finding approx. rankings from
   pairwise comparisons. We analyze an active ranking alg. that counts the # of
   comparisons won, & decides whether to stop or which pair of items to compare
   next, based on confidence intervals computed from the data collected in
   prev. steps. We show that this alg. succeeds in recovering approx. rankings
   using a # of comparisons that is close to optimal up to logarithmic factors.
   We also present numerical results, showing that in practice, approx. can
   drastically reduce the number of comparisons required to estimate a ranking."
   -- 1801.01253@[arXiv]['18].

%A N. Tishby
%A N. Zaslavsky
%T Deep learning and the information bottleneck principle
%J arXiv
%M MAR
%D 2015
%O invited talk, IEEE Information Theory Workshop (ITW), 2015
%K TR, c2015, c201x, c20xx, zz0118, NN, ANN, DNN, layers, information,
   bottleneck, deep learning
%X "Deep Neural Networks (DNNs) are analyzed via the theoretical  of the
   information bottleneck (IB) principle. We first show that any DNN can be
   quantified by the mutual info. between the layers & the input & output
   variables. Using this repn we can calculate the optimal info.theoretic limits
   of the DNN & obtain finite sample generalization bounds. The advantage of
   getting closer to the theoretical limit is quantifiable both by the
   generalization bound & by the n/wk's simplicity. We argue that both the
   optimal architecture, # of layers & features/connections at each layer, are
   related to the bifurcation points of the info.bottleneck tradeoff, namely,
   relevant compression of the input layer with respect to the output layer. The
   hierarchical repn at the layered n/wk naturally corr.to the structural phase
   transitions along the information curve. We believe that this new insight can
   lead to new optimality bounds & deep learning algorithms."
   -- 1503.02406@[arXiv]['17].
   [Also search for: Tishby ANN].

%A L. Kaiser
%A A. N. Gomez
%A N. Shazeer
%A A. Vaswani
%A N. Parmar
%A L. Jones
%A J. Uszkoreit
%T One model to learn them all
%J arXiv
%M JUN
%D 2017
%K TR, c2017, c201x, c20xx, zz0118, NN, ANN, AI, II, convolutional layer,
   layers, deep learning, ImageNet, COCO, google
%X "... present a single model that yields good results on a # of problems
   spanning multiple domains. In particular, this single model is trained
   concurrently on ImageNet, multiple translation tasks, image captioning
   (COCO dataset), a speech recognition corpus, & an English parsing task. Our
   model architecture incorporates building blocks from multiple domains. It
   contains convolutional layers, an attention mechanism, & sparsely-gated
   layers. Each of these computational blocks is crucial for a subset of the
   tasks we train on. Interestingly, even if a block is not crucial for a task,
   we observe that adding it never hurts performance & in most cases improves it
   on all tasks. We also show that tasks with less data benefit largely from
   joint training with other tasks, while performance on large tasks degrades
   only slightly if at all."
   -- 1706.05137@[arXiv]['18].
   (auth1@[go'gle],
    auth2@[www]['18].)

%A E. Nyquist
%T New theory cracks open the black box of deep learning
%J Quanta
%M SEP
%D 2017
%K mag, news, views, c2017, c201x, c20xx, zz0118, NN, ANN, deep learning,
   information, dog
%X "A new idea called the 'information bottleneck' is helping to explain the
   puzzling success of today's artificial-intelligence algorithms - and might
   also explain how human brains learn. ..."
   -- [www]['18].
   [Also search for: information bottleneck ANN]  and, as always, be sceptical.

%A V. Mullachery
%A A. Khera
%A A. Husai
%T Bayesian neural networks
%J arXiv
%M JAN
%D 2018
%K TR, c2018, c201x, c20xx, zz0118, NN, ANN, network, PyMC3, Edward, Stan
%X "... BNNs are comprised of a Probabilistic Model and a Neural n/wk. ... to
   combine the strengths of Neural n/wks & Stochastic modeling. Neural n/wks
   exhibit continuous fn approximator capabilities. Stochastic models allow
   direct spec. of a model with known interaction between parameters to generate
   data. During the prediction phase, stochastic models generate a complete
   posterior distribution & produce probabilistic guarantees on the predictions.
   Thus BNNs are a unique combination of neural network & stochastic models with
   the stochastic model forming the core of this integration. BNNs can then
   produce probabilistic guarantees on it's predictions & also generate the
   distribution of parameters that it has learnt from the observations. That
   means, in the parameter space, one can deduce the nature & shape of the
   neural n/wk's learnt parameters. These two characteristics makes them highly
   attractive to theoreticians as well as practitioners. Recently there has been
   a lot of activity in this area, with the advent of numerous probabilistic
   programming libraries such as: PyMC3, Edward, Stan etc. ..."
   -- 1801.07710@[arXiv]['18].
   [Also search for: Bayesian neural network].

%A P. J. Flory
%T Principles of Polymer Chemistry
%I CornellUP
%P 688
%D 1953
%K book, text, chemistry, chem, c1953, c195x, c19xx, zz0118, polymer chemistry,
   chain, chains
%X 1st ed 1953; hb us$99; uk us isbn:0801401348; uk us isbn13:978-0801401343.
   txt (1.5M), pdf (19.3M), ...
   -- [archive.org]['18].
   Go'gleBo'ks[www]['18].
   Buy:[CorUP]['18].

%A D. A. Brant
%A P. J. Flory
%T The configuration of random polypeptide chains. I. Experimental Results
%J J. Amer. Chem. Soc.
%V 87
%N 13
%P 2788-2791
%MD 1965
%K jrnl, JACS, c2965, c196x, c19xx, zz0118, chemical, polymer, chain, chains,
   protein, 3D, structure, folding, random, amino acids, AA,
   theory, experimental results
%X Part 1, experimental results, 87(13), pp.2788-2791, July 1965
   -- [doi:10.1021/ja01091a002]['18].
   Part 2, theory, 87(13), pp.2791-2800, July 1965
   -- [doi:10.1021/ja01091a003]['18].
   [Also search for: Flory book].

%A E. H. Wilson
%A et al ...
%A D. Platt
%T Genotype specification language
%J ACS Synthetic Biology
%V 5
%N 6
%P 471-478
%M JUN
%D 2016
%K jrnl, MolBio, c2016, c201x, c20xx, zz0118, genetic engineering, DPlatt, daz,
   Amyris, DNA, GSL
%X "... Genotype Specification Language (GSL), a language that facilitates the
   rapid design of large & complex DNA constructs used to engineer genomes. The
   GSL compiler implements a high-level language based on traditional genetic
   notation, as well as a set of low-level DNA manipulation primitives. The
   language allows facile incorporation of parts from a library of cloned DNA
   constructs & from the 'natural' library of parts in fully sequenced &
   annotated genomes. GSL was designed to engage genetic engineers in their
   native language while providing a framework for higher level abstract
   tooling. To this end we define four language levels, Level 0 (literal DNA
   sequence) through Level 3, with increasing abstraction of part selection &
   construction paths. GSL targets an intermediate language based on DNA slices
   that translates efficiently into a wide range of final output formats, such
   as FASTA & GenBank, & includes formats that specify instructions & materials
   such as oligonucleotide primers to allow the physical construction of the GSL
   designs by individual strain engineers or an automated DNA assembly core
   facility."
   -- [doi:10.1021/acssynbio.5b00194]['18].

%A E. Latorre
%A et al ...
%A L. W. Harries
%T Small molecule modulation of splicing factor expression is associated with
   rescue from cellular senescence
%J BMC Cell Biol.
%V 18
%N 31
%M OCT
%D 2017
%K jrnl, eJrnl, MolBio, c2017, c201x, c20xx, zz0118, biology, cell, aging,
   ageing, senescence, ERK, resveralogue, resveratrol, mRNA, splicing,
   UniEssex, UEssex
%X "... Treatment with resveralogues was assoc. with altered splicing factor
   expression & rescue of multiple features of senescence. This rescue was
   indep. of cell cycle traverse & also indep. of SIRT1, SASP modulation or
   senolysis. Under growth permissive conditions, cells demonstrating restored
   splicing factor expression also demonstrated increased telomere length,
   re-entered cell cycle & resumed proliferation. These phenomena were also
   influenced by ERK antagonists & agonists. This is the first demo. that
   moderation of splicing factor levels is assoc. with reversal of cellular
   senescence in human primary fibroblasts. Small molecule modulators of such
   targets may therefore represent promising novel anti-degenerative therapies."
   -- [doi:10.1186/s12860-017-0147-7]['17].
   [Also search for: resveratrol].

%A A. N. Cowell
%A et al
%T Mapping the malaria parasite druggable genome by using in vitro evolution
   and chemogenomics
%J Science
%V 359
%N 6372
%P 191-199
%M JAN
%D 2018
%K jrnl, MolBio, c2018, c201x, c20xx, zz0118, malaria, Plasmodium falciparum,
   drug resistance, adaption, mutation, thymidylate, benzoquinazolinone,
   farnesyltransferase, pyrimidinedione, dipeptidylpeptidase, arylurea
%X "... performed a genome analysis of 262 Plasmodium falciparum parasites
   resistant to 37 diverse compounds. We found 159 gene amplifications & 148
   nonsynonymous changes in 83 genes associated with drug-resistance
   acquisition, where gene amplifications contributed to one-third of
   resistance acquisition events. Beyond confirming previously identified
   multidrug-resistance mechanisms, we discovered hitherto unrecognized drug
   target-inhibitor pairs, including thymidylate synthase & a
   benzoquinazolinone, farnesyltransferase & a pyrimidinedione, & a
   dipeptidylpeptidase & an arylurea. ..."
   -- [doi:10.1126/science.aan4472]['18].
  [Also search for: Plasmodium falciparum].

%A M. J. Ryan
%T A Taste for the Beautiful: The Evolution of Attraction
%I PrincetonUP
%P 208
%M JAN
%D 2018
%K book, text, c2018, c20x, c20xx, zz0118, biol, biology, attractiveness,
   sexual, mate selection, beauty, human, animal behaviour, evolution, peacock
%X 1st ed 2018; hb us$24; uk us isbn:0691167265; uk us isbn13:978-0691167268.
   "... [how] scientists have taken up where Darwin left off and transformed
   our understanding of sexual selection, shedding new light on human behavior
   in the process. ..."

%A Z. Liu
%A et al
%T Cloning of Macaque monkeys by somatic cell nuclear transfer
%J Cell
%V ?
%M JAN
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0118, clone, cloning, cloned, Macaque monkey,
   Macaca fascicularis, mammal, Dolly
%X "... successfully cloned cynomolgus monkeys (Macaca fascicularis) by somatic
   cell nuclear transfer (SCNT). ... For SCNT using fetal monkey fibroblasts,
   6 pregnancies were confirmed in 21 surrogates and yielded 2 healthy babies.
   For SCNT using adult monkey cumulus cells, 22 pregnancies were confirmed in
   42 surrogates and yielded 2 babies that were short-lived. In both cases,
   genetic analyses confirmed that the nuclear DNA and mitochondria DNA of the
   monkey offspring originated from the nucleus donor cell and the oocyte
   donor monkey, respectively. Thus, cloning macaque monkeys by SCNT is feasible
   using fetal fibroblasts."
   -- [doi:10.1016/j.cell.2018.01.020]['18],
   or [www]['18].

%A L. Fegeras
%T An algebra for distributed big data analytics
%J JFP
%V 27
%M DEC
%D 2017
%K jrnl, JFP, c2017, c201x, c20xx, zz0118, FP, functional programming, monoid,
   big, data analysis, MRQL, join, joins, parallel, query, queries, map reduce,
   mapReduce, Hadoop, Pregel, groupBy, orderBy, coGroup, cMap, collections
%X "... an algebra for data-intensive scalable computing based on monoid
   homomorphisms that consists of a small set of operations that capture most
   features supported by current domain-specific languages for data-centric
   distributed computing. This algebra is being used as the formal basis of
   MRQL, which is a query processing & optimization system for large-scale
   distributed data analysis. The MRQL semantics is given in terms of monoid
   comprehensions, which support group-by & order-by syntax & can work on
   heterogeneous collections without requiring any extension to the monoid
   algebra. We present the syntax & semantics of monoid comprehensions & provide
   rules to translate them to the monoid algebra. We give evidence of the
   effectiveness of our algebra by presenting some important optimization rules,
   such as converting nested queries to joins."
   -- [doi:10.1017/S0956796817000193]['18].
   (*A 'monoid' has an associative binary operation & has an identity element.*)

%A R. Munroe
%T What If? Serious Scientific Answers to Absurd Hypothetical Questions
%I MarinerBooks
%P 320
%D 2014
%K book, c2014, c201x, c20xx, zz0118, xkcd, science, predictions, myths, fun,
   funny, haha, ha ha, www, HREF, popular, scientific, question, answer,
   QandA, urban myth, popular, sceptic
%X 1st ed 2014; pb us$10; uk us isbn:0544456866; uk us isbn13:978-0544456860.
   "... His responses are masterpieces of clarity and wit, gleefully and
   accurately explaining everything from the relativistic effects of a baseball
   pitched at near the speed of light to the many horrible ways you could die
   while building a periodic table out of all the actual elements. ..."
   (Also see [what-if.xkcd.com]['17].)

%T Maths strikes a blow for democracy
%J Nature
%M JAN
%D 2018
%K editorial, c2018, c201x, c20xx, zz0118, Mattingly, US, USA, North Carolina,
   politics, Republican party, gerrymander, drawing electoral boundary,
   boundaries, 2012, election, elections, voting, vote, fair, fairness,
   criteria, Reock, democracy
%X "... In striking down the way that officials in North Carolina unfairly
   partitioned the state into electoral districts, a US federal court last week
   conspicuously cited the work of mathematicians including Jonathan Mattingly,
   an expert in mathematical modelling. ... Mattingly, a researcher at Duke U.
   in Durham, NC ... alg. that produced around 24,000 maps of marginally
   different district configurations that were randomly drawn on the basis of
   geographic criteria. The Republican-drawn boundaries, which had delivered 9
   Republicans to the state's 13 seats in the House of Reps. in Washington DC in
   2012, were more gerrymandered than practically every single one of
   Mattingly's algorithm-derived maps. ..."
   -- [www]['18].
   (*Also see [doi:10.1038/546200a][8/6/2017].*)

%A N. Brown
%A T. Sandholm
%T Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
%J Science
%V 359
%N 6374
%P 418-424
%M JAN
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0118, AI, card, cards, game, playing, poker,
   HUNL, Texas hold'em, Libratus, bluff, bluffing
%X "... present Libratus, an AI that, in a 120,000-hand competition, defeated
   four top human specialist professionals in heads-up no-limit Texas hold'em,
   the leading benchmark & long-standing challenge problem in
   imperfect-information game solving. Our game-theoretic approach features
   application-independent techniques: an alg. for computing a blueprint
   for the overall strategy, an alg. that fleshes out the details of the
   strategy for subgames that are reached during play, & a self-improver
   alg. that fixes potential weaknesses that opponents have identified
   in the blueprint strategy."
   -- [doi:10.1126/science.aao1733]['18].
   [Also search for: poker AI].

%A N. Stern
%T Age and achievement in mathematics: A case-study in the sociology of science
%J Social Studies of Science
%V 1
%N 1
%P ?-?
%M FEB
%D 1978
%K jrnl, c1978, c197x, c19xx, zz0118, mathematics, maths, mathematician,
   age, impact, importance
%X "... An analysis is performed to determine whether citations are a rough
   measure of quality in mathematics. Citations to work published by
   mathematicians who have been elected to the US National Academy of Sciences
   are compared with those to the work of a random sample of university-based
   American mathematicians. The study examines productivity & citation counts,
   to determine if there is a relationship between a m's age & achievement, & to
   test the claim that younger ms are more apt to do important work. Finally,
   this paper explores the difficulties peculiar to the sociological study of
   maths, which account for the reluctance of most sociologists of science to
   study this field."
   -- [doi:10.1177/030631277800800105]['18].
   (Also see [www][12/1/2018].)

%A D. Darling
%A A. Banerjee
%T Weird Maths: At the Edge of Infinity and Beyond
%I OneWorld Publ.
%P 288
%M FEB
%D 2018
%K book, c2018, c201x, c20xx, zz0118, maths, mathematics, random
%X 1st ed 2018; pb stg.12; uk us isbn:1786072645, uk us isbn13:978-178607264.
   "Is anything truly random? Does infinity actually exist? Could we ever
   see into other dimensions? ... would we like alien music? ..."

%A D. M. Zajac
%A et al
%T Resonantly driven CNOT gate for electron spins
%J Science
%V 359
%N 6374
%P 439-442
%M JAN
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0118, quantum computing, CNOT, controlled NOT,
   gate, qubit, qubits, silicon, dots
%X "Single-qubit rotations & two-qubit CNOT operations are crucial ingredients
   for universal quantum computing.  ... demonstrate an efficient resonantly
   driven CNOT gate for electron spins in silicon. Our platform achieves
   single-qubit rotations with fidelities greater than 99%, as verified by
   randomized benchmarking. Gate control of the exchange coupling allows a
   quantum CNOT gate to be implemented with resonant driving in ~200
   nanoseconds. We used the CNOT gate to generate a Bell state with 78% fidelity
   (corrected for errors in state preparation & measurement). Our quantum dot
   device architecture enables multi-qubit algorithms in silicon."
   -- [doi:10.1126/science.aao5965]['18].

%A S. Hough
%T Do large (magnitude >= 8) global earthquakes occur on preferred days of the
   calendar year or lunar cycle?
%J Seismological Res. Lett.
%M JAN
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0118, earth quake, earthquake, seismology,
   full, moon, lunar, cycle, month, stats, myth
%X -- [doi:10.1785/0220170154['18]?
   or [www]['18]?
   Also see [phys.org]['18],
   and [abc][1/2018].
   [Also search for: lunar stats].

%A H. Doi
%A H. Basadonne
%A P. Venuti
%A K. Shinohara
%T Negative correlation between salivary testosterone concentration and
   preference for sophisticated music in males
%J Personality and individual differences
%V 125
%P 106-111
%M APR
%D 2018
%K jrnl, c2018, c201x, c20xx, zz0118, human, personality, male, males,
   testosterone, music, tastes, jazz, classical, rock and roll
%X "... conjectured that testosterone partly determines individual differences
   in music preference. ... investigated the association between salivary
   testosterone concentration & strength of preference for five different music
   types in young males & females. The results revealed a sig. -ve correlation
   between salivary testosterone concentration & preference for sophisticated
   music, such as classical & jazz in males. This relationship was not mediated
   by the big-five personality traits. ... indicate the possibility that
   neuroendocrinological fn can exert influences on music preference patterns."
   -- [doi:10.1016/j.paid.2017.11.041]['18].

%A X. He
%A N. Huang
%A X. Sun
%T On the decision tree complexity of string matching
%J arXiv
%M DEC
%D 2017
%K TR, c2017, c201x, c20xx, zz0118, Rivest, Tuza, Skolem, problem, strings,
   match, search, pattern, comparisons, character queries
%X "... A natural problem is to find the # of characters that need to be queried
   (i.e. the decision tree complexity) in a string in order to determine whether
   this string contains a certain pattern. Rivest showed that for every pattern
   p, in the worst case any deterministic algorithm needs to query at least
   n-|p|+1 chars, where n is the length of the string and |p| is the length
   of the pattern. He further conjectured that these bounds are tight. By using
   adversary methods, Tuza disproved this conjecture and showed that more than
   half of binary patterns are evasive, i.e. any algorithm needs to query all
   the characters. ... we give a new sufficient condn for the evasiveness of
   patterns, which reveals an interesting connection to Skolem's Problem."
   -- 1712.09738@[arXiv]['17].

%A N. Smith
%A T. Graham
%T Mapping the anti-vaccination movement on Facebook
%J Info., Commn and Society
%V ?
%P ?-?
%M DEC
%D 2017
%K jrnl, eJrnl, c2017, c201x, c20xx, zz0118, web, www, href, social media,
   Facebook, network, filter bubble, science, fake news, fakeNews,
   anti-vaccination, antiVaccination, anti vax, antiVax, antiVaxxer,
   misinformation, conspiracy, myth, Tenpenny
%X "... examine the characteristics of & the discourses present within six
   popular anti-vaccination Facebook pages. We examine these large-scale
   datasets using a range of methods, inc. social n/wk analysis, gender
   prediction using historical census data, & generative statistical models for
   topic analysis (Latent Dirichlet allocation). We find that present-day
   discourses centre around moral outrage & structural oppression by
   institutional government & the media, suggesting a strong logic of
   'conspiracy-style' beliefs & thinking. Furthermore, anti-vaccination pages
   on [FB] reflect a highly 'feminised' movement - the vast majority of
   participants are women. Although anti-vaccination n/wks on [FB] are large &
   global in scope, the comment activity sub-n/wks appear to be 'small world'.
   This suggests that social media may have a role in spreading anti-vaccination
   ideas & making the movement durable on a global scale." (online Dec 2017)
   -- [doi:10.1080/1369118X.2017.1418406]['18].
   [Also search for: fakeNews].
   (Also see [abc][1/2018].)