description: activity of obtaining information resources relevant to an information need from a collection of information resources
182 results
by Liz Pelly · 7 Jan 2025 · 293pp · 104,461 words
taste and receive recommendations back. Collaborative filtering was created around the same time. In music scholarship, there’s a whole field of study called “music information retrieval” (MIR) that goes back several decades and, since 2000, even has its own long-running annual conference hosted by the International Society for Music
…
Information Retrieval, the “world’s leading research forum on processing, analyzing, searching, organizing, and accessing music related data.”2 This was not Spotify’s world, but as
…
profits/corporate greed in, 2–3 (see also payola) “saving” of, 13–14, 20–21, 23 See also record labels, independent; record labels, major music information retrieval (MIR), 93 music labor movement AFM strike, 207–8 on copyright violations, 206–7 during COVID-19 lockdowns, 205–6 “Justice at Spotify” campaign, 205
by Sharon Weinberger · 14 Sep 2017 · 578pp · 169,586 words
, 18, 20, 24–28, April 1, 1969. U.S. Congress. House. Committee on Education and Labor. Subcommittee on Education. National Science Research Data Processing and Information Retrieval System. 91st Cong., 1st sess., April 29, 30, 1969. U.S. Congress. Senate. Committee on Armed Services. Authorization for Military Procurement, Research, and Development. 91st
by Joanna Walsh · 22 Sep 2025 · 255pp · 80,203 words
No Alternative? (Zero Books, 2009), p. 4. 4.Deleuze, Difference and Repetition, p. 275. 5.Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze, Introduction to Information Retrieval (Cambridge University Press. 2008), p. 22. 6.Rancière, Aesthesis, p. 4. 7.Andrew Liszewski, ‘Neural Networks Upscale Film from 1896 to 4K, Make It Look
by Doug Turnbull and John Berryman · 30 Apr 2016 · 593pp · 118,995 words
“relevant” search result? 1.2.2. Search: there’s no silver bullet! 1.3. Gaining insight from relevance research 1.3.1. Information retrieval 1.3.2. Can we use information retrieval to solve relevance? 1.4. How do you solve relevance? 1.5. More than technology: curation, collaboration, and feedback 1.6. Summary
…
approaches, like latent semantic analysis. We dove into Lucene’s guts and explored techniques for building custom search components to solve problems. We began exploring information retrieval research. As we learned more techniques to solve hard problems, we continued to write about them. Still, blogs have their limits. John and I always
…
Solr blog (http://sujitpal.blogspot.com/) The Solr Start newsletter (www.solr-start.com) On the more general topic of search and information retrieval, we recommend this canonical text: Introduction to Information Retrieval by Christopher Manning et al. (Cambridge University Press, 2008), http://nlp.stanford.edu/IR-book/. For questions specific to Solr/Elasticsearch
…
of engineering effort. You engaged with the culmination of an even larger body of academic research that goes back a century in the field of information retrieval. Standing on the shoulders of giants, you sifted through millions of pieces of information—the entire human collection of information on the topic—and found
…
but is instead a bag of tricks that can’t be generally applied. In reality, there is a discipline behind relevance: the academic field of information retrieval. It has generally accepted practices to improve relevance broadly across many domains. But you’ve seen that what’s relevant depends a great deal on
…
your application. Given that, as we introduce information retrieval, think about how its general findings can be used to solve your narrower relevance problem.[2] 2 For an introduction to the field of
…
information retrieval, we highly recommend the classic text Introduction to Information Retrieval by Christopher D. Manning et al. (Cambridge University Press, 2008); see http://nlp.stanford.edu/IR-book/. 1.3.1
…
. Information retrieval Luckily, experts have been studying search for decades. The academic field of information retrieval focuses on the precise recall of information to satisfy a user’s information need. What’s an information need
…
fortunate, you’ll find a result addressing a problem similar to your own. That information will solve your problem, and you’ll move on. In information retrieval, relevance is defined as the practice of returning search results that most satisfy the user’s information needs. Further, classic
…
information retrieval focuses on text ranking. Many findings in information retrieval try to measure how likely a given article is going to be relevant to a user’s text search. You’ll learn about several
…
of these invaluable methods throughout this book—as many of these findings are implemented in open source search engines. To discover better text-searching methods, information retrieval researchers benchmark different strategies by using test collections of articles. These test collections include Amazon reviews, Reuters news articles, Usenet posts, and other similar, article
…
judgment lists, researchers aim to measure whether changes to text relevance calculations improve the overall relevance of the results across every test collection. To classic information retrieval, a solution that improves a dozen text-heavy test collections 1% overall is a success. Rather than focusing on one particular problem in depth
…
on solving search for a broad set of problems. 1.3.2. Can we use information retrieval to solve relevance? You’ve already seen there’s no silver bullet. But information retrieval does seem to systematically create relevance solutions. So ask yourself: Do these insights apply to your application? Does your application care about
…
searching article-length text? Would it be better to solve the specific problems faced by your application, here and now? To be more precise, classic information retrieval begs several questions when brought to bear on applied relevance problems. Let’s reflect on these questions to see where
…
information retrieval research can help and where it might stop being helpful. Do we care only about information needs? For many applications, satisfying users’ information needs isn’
…
overpriced clunker off the lot, relevance engineers must work with these factors to keep their employer in business. What besides text reflects information needs? Classic information retrieval focuses on a generic, one-size-fits-all measure of text relevance. These factors may not matter—at all—to your application. You need to
…
(PageRank). Google uses PageRank to get around pure text-based measures easily gamed in its domain. Even text search doesn’t always neatly fit into information retrieval’s focus on article-length text. Good results for short text snippets such as tweets or titles require different thinking. You, not
…
information retrieval researchers, must decide which factors matter to your application, and implement those. An approach that does poorly against the Reuters test set may be exactly
…
, ready, willing, and able to solve any problem asked of it, including helping a doctor save a life? Considering these questions, you can see that information retrieval builds a foundation for applying generally useful relevance measures to extremely broad classes of problems. Your job is to solve relevance for your application. As
…
context of a particular user experience, while balancing how ranking impacts our business’s needs. 1.4. How do you solve relevance? Informed now by information retrieval, let’s focus on how to solve your relevance problems. Open source search engines recognize that what’s relevant to your application depends on a
…
factors. Many of these are application-specific (how far the user is from a restaurant, for instance). Others are broader, generic, text-ranking components from information retrieval. Given the capabilities of open source search, how do you solve an applied relevance problem? What framework can we define that incorporates both the narrower
…
, domain-specific factors alongside broader information-retrieval techniques? To solve relevance, the relevance engineer: 1. Identifies salient features describing the content, the user, or the search query 2. Finds a way to
…
. Bringing users to relevant search results can turn into a multibillion-dollar business advantage; failing to do so can mean losing out to the competition. Information retrieval is the academic field of bringing users to content that satisfies their information needs, largely as specified in search queries. In practice, relevance is more
…
chapter, we have made several references to the idea of relevance and how various search features can be used to improve it. Recall that in information retrieval, relevance measures how well search results satisfy a user’s information need. In this book, we adopt a broader notion. In light of this, relevant
…
. The scoring begins to look more cryptic, filled with deeper search-engine jargon. At this point, you’re seeing a more fundamental reflection of the information retrieval intelligence built into the search engine. At this level, you begin to see information about match statistics for a field. These matches are the basic
…
convey more strength than others. 3.6.2. The vector-space model, the relevance explain, and you Much of the Lucene scoring formula derives from information retrieval. But the theoretical influence needs to be tempered mightily. Although the theoretical basis gives you context for solving a problem, in practice, relevance scoring uses
…
. Understanding the science will help you ensure that the search engine correctly measures the weight of features latent in the text, represented by terms. To information retrieval, a search for multiple terms in a field (such as our overview:basketbal overview:alien overview:cartoon against Space Jam) attempts to approximate a vector
…
, the higher the dot product. dotprod(fruit1, fruit2) = juiciness(fruit1) × juiciness(fruit2) + size(fruit1) × size(fruit2) What does this have to do with text? To information retrieval, text (queries and documents) can also be represented as vectors. Instead of examining features such as juiciness or size, the dimensions in the text vector
…
, and similarity Although you can see that TF × IDF seems to be an intuitive weighting formula, these raw statistics need additional tweaking to be optimal. Information retrieval research demonstrates that although a search term might occur 10 times more in a piece of text, that doesn’t make it 10 times as
…
(doc=31) Lucene’s next default similarity: BM25 Over the years, an alternate approach to computing a TF × IDF score has become prevalent in the information retrieval community: Okapi BM25. Because of its proven high performance on article-length text, Lucene’s BM25 similarity will be rolling out as the default similarity
…
, even as you read this book. What is BM25? Instead of “fudge factors” as discussed previously, BM25 bases its TF × IDF “fudges” on more-robust information retrieval findings. This includes forcing the impact of TF to reach a saturation point. Instead of the impact of length (fieldNorms) always increasing, its impact is
…
). IDF is computed similarly to classic TF × IDF similarity. Will BM25 help your relevance? It’s not that simple. As we discussed in chapter 1, information retrieval focuses heavily on broad, incremental improvements to article-length pieces of text. BM25 may not matter for your specific definition of relevance. For this reason
…
be as vague as “I know it when I see it,” but ideally it should be more concretely defined. At an extreme, the field of information retrieval uses so-called relevance judgments to define “looks good.” Here, given a fixed set of queries and a fixed set of documents, each query-document
…
gather relevance judgments given sufficient user traffic. Armed with these judgments, a program can automatically adjust query parameters on your behalf. In the field of information retrieval, this highest level of automation is known as learning to rank. Learning to rank turns out to be a tricky problem to solve, but it
…
has become a focus in information retrieval. So be on the lookout for improvements and breakthroughs in the near future. We’ll have more to say on learning to rank and test
…
one day being able to automatically converge the ideal relevance parameters. Finally, you need to combine all the insights from this chapter with cutting-edge information retrieval and machine learning. Often simpler relevance gains can be gathered with the straightforward techniques discussed earlier in this book. In our consulting work, we’re
…
inconsistent scoring index-time analysis, 2nd index-time personalization indexing documents information and requirements gathering business needs required and available information users and information needs information retrieval, creating relevance solutions through inner objects innermost calculation integers, tokenizing inventory-related files inventory_dir configuration inverse document frequency. See IDF. inverted index data structure
…
engineer search relevance collaboration and curation and defined difficulty of class of search and lack of single solution feedback and gaining skills of relevance engineer information retrieval research into systematic approach for improving search-as-you-type searchable data semantic expansion sentiment analysis sentinel tokens, 2nd sharding short-tail application SHOULD clause
by Andy Oram · 26 Feb 2001 · 673pp · 164,804 words
we expect from today’s Gnutella system, but it actually doesn’t capture the unique properties Gnutella offers. Remember, Gnutella is a distributed, real-time information retrieval system wherein your query is disseminated across the network in its raw form. That means that every node that receives your query can interpret your
…
, no. 2, pp.84-88. [77] “Electronic Frontiers Georgia Remailer Uptime List,” http://anon.efga.org. [78] Tal Malkin (1999), MIT Ph.D. thesis, “Private Information Retrieval and Oblivious Transfer.” [79] Masayuki Abe (1998), “Universally Verifiable MIX-Network with Verification Work Independent of the Number of MIX Servers,” EUROCRYPT ’98, Springer-Verlag
by Anthony T. Holdener · 25 Jan 2008 · 982pp · 221,145 words
. Our specialty is architectural engineering. We sell fluffy animals. Regardless of the focus, it should be readily apparent. * Chris Roast, “Designing for Delay in Interactive Information Retrieval,” Interacting with Computers 10 (1998): 87–104. “Need for Speed I,” Zona Research, Zona Market Bulletin (1999). “Need for Speed II,” Zona Research, Zona Market
by David Sawyer McFarland · 28 Oct 2011 · 924pp · 196,343 words
make elements appear, disappear, or move around a web page (see Figure 1-1); you can even update the contents of a web page with information retrieved from a web server—without having to load a new web page. In short, JavaScript lets you make your websites more engaging and effective. Figure
by Donald Ervin Knuth · 15 Jan 1998
sound as if this book is only for those systems programmers who are concerned with the preparation of general-purpose sorting routines or applications to information retrieval. But in fact the area of sorting and searching provides an ideal framework for discussing a wide variety of important general issues: • How are good
…
complicated questions. Indeed, we might consider an entire library as a database, and a searcher may want to find everything that has been published about information retrieval. An introduction to the techniques for such secondary key (multi-attribute) retrieval problems appears below in Section 6.5. Before entering into a detailed study
…
in Table 1 as a trie structure; this name was suggested by E. Fredkin [CACM 3 A960), 490-500] because it is a part of information retrieval. A trie — pronounced "try" —is essentially an M-ary tree, whose nodes are M-place vectors with components corresponding to digits or characters. Each node
…
tries, have been analyzed by P. Kirschenhofer and H. Prodinger, Random Structures and Algorithms 5 A994), 123-134. *Balanced filing schemes. Another combinatorial approach to information retrieval, based on balanced incomplete block designs, has been the subject of considerable investigation. Although the subject is quite interesting from a mathematical point of view
…
in detail in Marshall Hall, Jr.'s book Combinatorial Theory (Waltham, Mass.: Blaisdell, 1967). Although such combinatorial configurations are very beautiful, their main application to information retrieval so far has been to decrease the redundancy incurred when compound inverted lists are being used; and David K. Chow [Information and Control-IB A969
…
. Infinity, 4, 138-139, 142-144, 156, 214, 257-258, 263, 521, 624-625, 646, 663-664, 685, 707. as sentinel, 159, 252, 308, 324. Information retrieval, 392, 395. 766 INDEX AND GLOSSARY Information theory, 183, 198, 442-444, 633. lower bounds from, 183, 194, 202, 204, 655. Inner loop: Part of
by Chris Eagle · 16 Jun 2011 · 1,156pp · 229,431 words
SetBptCnd(next_eip, "Warning(\"Exception return hit\") || 1"); return 0; //don't stop } This function locates the pointer to the process’s saved register context information , retrieves the saved instruction pointer value from offset 0xB8 within the CONTEXT structure , and sets a breakpoint on this address . In order to make it clear
by Viktor Mayer-Schönberger · 1 Jan 2009 · 263pp · 75,610 words
memory. It includes the ability to retrieve that information later easily and at will. As humans, we are all too familiar with the challenges of information retrieval from our brain’s long-term memory. External analog memory, like books, hold huge amounts of information, but finding a particular piece of information in
…
and presented in neatly formatted lists. Such trouble-free retrieval greatly enhances the value of information. To be sure, humans have always tried to make information retrieval easier and less cumbersome, but they faced significant hurdles. Take written information. The switch from tablets and scrolls to bound books helped in keeping information
…
the printing revolution. Only when subject index and page numbers were combined was the equivalent of a modern book index achieved, completing the foundations of information retrieval in a large corpus of text.32 The rise of businesses and the state made necessary methods of filing and retrieving written documents with ease
…
documents to books) became a sought-after quality among information workers, and organizations spent substantial amounts building and maintaining the tools (indexes, catalogues) necessary for information retrieval. By the end of the analog age, retrieval had come a long way. Information could be retrieved from libraries using a combination of book catalogues
…
for its collections. Instead, we use a plethora of different systems, which could even include the proverbial shoebox. The underlying reason for these challenges in information retrieval is the sequential organization of most analog information storage: without additional cues, one has to page through or perhaps even read an entire book to
…
within files for easy retrieval. They were helped by the rise of the hard disk, which unlike most analog storage devices permits direct-access nonsequential information retrieval. By the late 1960s, British IBM engineer Ted Codd formulated the theoretical concepts of what he called relational databases—essentially information organized in tables, with
…
digital storage was used judiciously as primary information storage. As costs for digital storage plummeted, more and more information became digitized, fueling demand for better information retrieval tools. In the United States in the 1970s, Lexis and Westlaw, for example, made available to their customers huge databases with the full text of
…
by the beginning of the twenty-first century it had become a standard feature of all major PC operating systems, bringing the power of pinpoint information retrieval to people’s desktops. At the same time, digital devices became capable of more or less automatically generating and managing file metadata (data about a
…
the file level (akin to searching in a book catalogue), and searching within a file (searching for a passage within a book). Such convergent digital information retrieval functions through one simple integrated interface; information is searched and retrieved at all levels, and presented almost momentarily in a visually consistent manner, irrespective of
…
. Incidentally, it has also caused shared digital information to become de- and recontextualized without the control of the original creator. As I have described earlier, information retrieval already causes information to become de- and recontextualized because pieces of information are retrieved without their accompanying contexts and presented in a new context of
…
forgetting has become inverted. Committing information to digital memory has become the default, and forgetting the exception. Digitization has made possible plummeting storage costs, easy information retrieval, as well as global access to digital memory. For the first time in human history, this has enabled us to make remembering cheaper and easier
…
rights to, 135–36, 139–40, 143–44 enforcement of right to, 139–40 purpose limitation principle in, 136, 138, 159 rights to, 134–44 information retrieval. See information: retrieval of information sharing: default of, 88 information storage: capacity, 66 cheap, 62–72 corporate, 68–69 density of, 71 economics of, 68 increase in
by Gary Price, Chris Sherman and Danny Sullivan · 2 Jan 2003 · 481pp · 121,669 words
by Dafydd Stuttard and Marcus Pinto · 30 Sep 2007 · 1,302pp · 289,469 words
by Michael W. Berry and Murray Browne · 15 Jan 2005
by Daniel J. Levitin · 18 Aug 2014 · 685pp · 203,949 words
by Martin Kleppmann · 17 Apr 2017
by Alex Wright · 6 Jun 2014
by Matthew Hindman · 24 Sep 2018
by Yves Hilpisch · 8 Dec 2020 · 1,082pp · 87,792 words
by Olivier Cure and Guillaume Blin · 10 Dec 2014
by Eric Enge, Stephan Spencer, Jessie Stricchiola and Rand Fishkin · 7 Mar 2012
by Mehmed Kantardzić · 2 Jan 2003 · 721pp · 197,134 words
by Tom White · 29 May 2009 · 933pp · 205,691 words
by Jim Jansen · 25 Jul 2011 · 298pp · 43,745 words
by Geoffrey C. Bowker · 24 Aug 2000
by Safiya Umoja Noble · 8 Jan 2018 · 290pp · 73,000 words
by Justin Schuh · 20 Nov 2006 · 2,054pp · 359,149 words
by John Brockman · 18 Jan 2011 · 379pp · 109,612 words
by Zdravko Markov and Daniel T. Larose · 5 Apr 2007
by Emmanuel Goldstein · 28 Jul 2008 · 889pp · 433,897 words
by Matthew A. Russell · 15 Jan 2011 · 541pp · 109,698 words
by Michal Zalewski · 26 Nov 2011 · 570pp · 115,722 words
by Jiawei Han, Micheline Kamber and Jian Pei · 21 Jun 2011
by Greg Nudelman and Pabini Gabriel-Petit · 8 May 2011
by Steven Pinker · 1 Jan 1997 · 913pp · 265,787 words
by Leslie Sikos · 10 Jul 2015
by Ian Goldin and Chris Kutarna · 23 May 2016 · 437pp · 113,173 words
by Trey Grainger and Timothy Potter · 14 Sep 2014 · 1,085pp · 219,144 words
by W. Richard Stevens, Bill Fenner, Andrew M. Rudoff · 8 Jun 2013
by Dipanjan Sarkar · 1 Dec 2016
by Geoffrey C. Bowker and Susan Leigh Star · 25 Aug 2000 · 357pp · 125,142 words
by Belinda Barnet · 14 Jul 2013 · 193pp · 19,478 words
by Gordon Bell and Jim Gemmell · 15 Feb 2009 · 291pp · 77,596 words
by Rafal Kuc and Marek Rogozinski · 14 Aug 2013 · 480pp · 99,288 words
by Steven Levy · 12 Apr 2011 · 666pp · 181,495 words
by Nick Bostrom · 3 Jun 2014 · 574pp · 164,509 words
by Mark Last, Abraham Kandel and Horst Bunke · 24 Jun 2004 · 205pp · 20,452 words
by Harold Abelson, Gerald Jay Sussman and Julie Sussman · 1 Jan 1984 · 1,387pp · 202,295 words
by Foster Provost and Tom Fawcett · 30 Jun 2013 · 660pp · 141,595 words
by Martin Kleppmann · 16 Mar 2017 · 1,237pp · 227,370 words
by Martin Ford · 13 Sep 2021 · 288pp · 86,995 words
by Julie Steele · 20 Apr 2010
by Robin Sharp · 13 Feb 2008
by Benjamin K. Bergen · 12 Sep 2016 · 364pp · 102,926 words
by James Vlahos · 1 Mar 2019 · 392pp · 108,745 words
by Jing Tsu · 18 Jan 2022 · 408pp · 105,715 words
by Ronald J. Deibert · 14 Aug 2020
by David J. Leinweber · 31 Dec 2008 · 402pp · 110,972 words
by James Gleick · 1 Mar 2011 · 855pp · 178,507 words
by Brian Christian and Tom Griffiths · 4 Apr 2016 · 523pp · 143,139 words
by Justin Peters · 11 Feb 2013 · 397pp · 102,910 words
by Rachel Botsman and Roo Rogers · 2 Jan 2010 · 411pp · 80,925 words
by Thierry Bardini · 1 Dec 2000
by Toby Segaran · 17 Dec 2008 · 519pp · 102,669 words
by Mark Masse · 19 Oct 2011 · 153pp · 27,424 words
by Alistair Cockburn · 30 Sep 2000
by Richard Susskind and Daniel Susskind · 24 Aug 2015 · 742pp · 137,937 words
by Unknown · 13 Jan 2012 · 470pp · 109,589 words
by Adam Greenfield · 29 May 2017 · 410pp · 119,823 words
by Jure Leskovec, Anand Rajaraman and Jeffrey David Ullman · 13 Nov 2014
by Clive Thompson · 11 Sep 2013 · 397pp · 110,130 words
by Coingecko, Darren Lau, Sze Jin Teh, Kristian Kho, Erina Azmi, Tm Lee and Bobby Ong · 22 Mar 2020 · 135pp · 26,407 words
by Ralph Watson McElvenny and Marc Wortman · 14 Oct 2023 · 567pp · 171,072 words
by Stuart Russell and Peter Norvig · 14 Jul 2019 · 2,466pp · 668,761 words
by Toby Segaran and Jeff Hammerbacher · 1 Jul 2009
by Douglas R. Dechow · 2 Jul 2015 · 223pp · 52,808 words
by Manuel Castells · 31 Aug 1996 · 843pp · 223,858 words
by Lisa Gitelman · 26 Mar 2014
by Angel Au-Yeung and David Jeans · 25 Apr 2023 · 427pp · 134,098 words
by Steven Bird, Ewan Klein and Edward Loper · 15 Dec 2009 · 504pp · 89,238 words
by Kim Zetter · 11 Nov 2014 · 492pp · 153,565 words
by Siva Vaidhyanathan · 1 Jan 2010 · 281pp · 95,852 words
by Sam Newman · 25 Dec 2014 · 540pp · 103,101 words
by Cherie L. Weible and Karen L. Janke · 15 Apr 2011 · 144pp · 55,142 words
by John Markoff · 1 Jan 2005 · 394pp · 108,215 words
by Benjamin H. Bratton · 19 Feb 2016 · 903pp · 235,753 words
by John Markoff · 24 Aug 2015 · 413pp · 119,587 words
by Thierry Poibeau · 14 Sep 2017 · 174pp · 56,405 words
by John MacCormick and Chris Bishop · 27 Dec 2011 · 250pp · 73,574 words
by David Easley and Jon Kleinberg · 15 Nov 2010 · 1,535pp · 337,071 words
by Harold Abelson, Gerald Jay Sussman and Julie Sussman · 25 Jul 1996 · 893pp · 199,542 words
by James Pustejovsky and Amber Stubbs · 14 Oct 2012 · 502pp · 107,510 words
by Ben Goertzel and Pei Wang · 1 Jan 2007 · 303pp · 67,891 words
by Shoshana Zuboff · 14 Apr 1988
by Tim Berners-Lee · 8 Sep 2025 · 347pp · 100,038 words
by Martin Ford · 16 Nov 2018 · 586pp · 186,548 words
by Thomas H. Davenport and Julia Kirby · 23 May 2016 · 347pp · 97,721 words
by Tom Clancy and Scott Brick · 2 Jan 2002
by Andrew B. King · 15 Mar 2008 · 597pp · 119,204 words
by Stephen Baker · 17 Feb 2011 · 238pp · 77,730 words
by M. Mitchell Waldrop · 14 Apr 2001
by Larry Harris · 2 Jan 2003 · 1,164pp · 309,327 words
by James Dale Davidson and William Rees-Mogg · 3 Feb 1997 · 582pp · 160,693 words
by Alastair Reynolds · 14 Feb 2006 · 436pp · 124,373 words
by Simon Head · 14 Aug 2003 · 242pp · 245 words
by Sherry Turkle · 11 Jan 2011 · 542pp · 161,731 words
by Adam Freeman · 25 Mar 2014 · 671pp · 228,348 words
by Markus Krajewski and Peter Krapp · 18 Aug 2011 · 222pp · 74,587 words
by John Brockman · 14 Feb 2012 · 416pp · 106,582 words
by Takuro Sato · 17 Nov 2015
by Katie Hafner and Matthew Lyon · 1 Jan 1996 · 352pp · 96,532 words
by David Talbot · 5 Sep 2016 · 891pp · 253,901 words
by Sonja Thiel and Johannes C. Bernhardt · 31 Dec 2023 · 321pp · 113,564 words
by Dariusz Jemielniak and Aleksandra Przegalinska · 18 Feb 2020 · 187pp · 50,083 words
by Erik J. Larson · 5 Apr 2021
by Ray Kurzweil · 14 Jul 2005 · 761pp · 231,902 words
by Steven Levy · 2 Feb 1994 · 244pp · 66,599 words
by David Smiley and Eric Pugh · 15 Nov 2009 · 648pp · 108,814 words
by John Seely Brown and Paul Duguid · 2 Feb 2000 · 791pp · 85,159 words
by Daniel C. Dennett · 7 Feb 2017 · 573pp · 157,767 words
by Lawrence Freedman · 31 Oct 2013 · 1,073pp · 314,528 words
by Claire L. Evans · 6 Mar 2018 · 371pp · 93,570 words
by Jill Lepore · 14 Sep 2020 · 467pp · 149,632 words
by Luke Dormehl · 10 Aug 2016 · 252pp · 74,167 words
by Robert N. Proctor · 28 Feb 2012 · 1,199pp · 332,563 words
by Michael Harris · 6 Aug 2014 · 259pp · 73,193 words
by Cal Newport · 5 Jan 2016
by Richard Susskind · 10 Jan 2013 · 160pp · 45,516 words
by Peter F. Hamilton · 18 Aug 2010 · 857pp · 232,302 words
by Nathan L. Ensmenger · 31 Jul 2010 · 429pp · 114,726 words
by David N. Blank-Edelman · 16 Sep 2018
by Alec Nevala-Lee · 1 Aug 2022 · 864pp · 222,565 words
by Aurélien Géron · 13 Mar 2017 · 1,331pp · 163,200 words
by Alvin Toffler · 1 Jun 1984 · 286pp · 94,017 words
by Jodi Taylor · 8 Jan 2013
by Nicholas Carr · 28 Jan 2025 · 231pp · 85,135 words
by Arvid Kahl · 24 Jun 2020 · 461pp · 106,027 words
by Donald Ervin Knuth · 15 Jan 2001
by Gayle Laakmann Mcdowell · 25 Jan 2011 · 242pp · 71,938 words
by Benjamin R. Barber · 5 Nov 2013 · 501pp · 145,943 words
by Joe Karaganis · 3 May 2018 · 334pp · 123,463 words
by Pete Warden · 20 Sep 2011 · 58pp · 12,386 words
by David B. Agus · 15 Oct 2012 · 433pp · 106,048 words
by Jacob Silverman · 17 Mar 2015 · 527pp · 147,690 words
by Peter Morville · 14 May 2014 · 165pp · 50,798 words
by Mariana Mazzucato · 1 Jan 2011 · 382pp · 92,138 words
by Pedro Domingos · 21 Sep 2015 · 396pp · 117,149 words
by Pedro Gairifo Santos · 7 Nov 2011 · 353pp · 104,146 words
by Anthony Mancuso · 2 Jan 1977
by Federico Biancuzzi and Shane Warden · 21 Mar 2009 · 496pp · 174,084 words
by Cory Doctorow · 15 Sep 2008 · 189pp · 57,632 words
by Frank Pasquale · 17 Nov 2014 · 320pp · 87,853 words
by Paul Adams · 1 Nov 2011 · 123pp · 32,382 words
by Margaret O'Mara · 8 Jul 2019
by Anson-QA
by Peter Seibel · 22 Jun 2009 · 1,201pp · 233,519 words
by Robert F. Barsky · 2 Feb 1997
by Jon Gertner · 15 Mar 2012 · 550pp · 154,725 words
by Matt Taibbi · 8 Apr 2014 · 455pp · 138,716 words
by Ajay Agrawal, Joshua Gans and Avi Goldfarb · 16 Apr 2018 · 345pp · 75,660 words
by Pistono, Federico · 14 Oct 2012 · 245pp · 64,288 words
by Library Of Congress and Carla Hayden · 3 Apr 2017
by Ray Kurzweil · 31 Dec 1998 · 696pp · 143,736 words
by Trent Hauck · 3 Nov 2014
by Lynda Gratton and Andrew Scott · 1 Jun 2016 · 344pp · 94,332 words
by Philip Augar · 20 Apr 2005 · 290pp · 83,248 words
by Veljko Krunic · 29 Mar 2020
by Peter Marshall · 1 Feb 1997
by Guy Standing · 13 Jul 2016 · 443pp · 98,113 words
by David S. Abraham · 27 Oct 2015 · 386pp · 91,913 words
by Adam Fisher · 9 Jul 2018 · 611pp · 188,732 words
by Cathy O'Neil and Rachel Schutt · 8 Oct 2013 · 523pp · 112,185 words
by Frank Pasquale · 14 May 2020 · 1,172pp · 114,305 words
by Sales, Leonard John. · 19 Sep 2008
by Yarden Katz
by Jonathan Taplin · 17 Apr 2017 · 222pp · 70,132 words
by John Brockman · 19 Feb 2019 · 339pp · 94,769 words
by Dee Maldon · 16 Mar 2010 · 32pp · 7,759 words
by Jamie Bartlett · 4 Apr 2018 · 170pp · 49,193 words
by Adam Lashinsky · 31 Mar 2017 · 190pp · 62,941 words
by Richard Dawkins · 1 Jan 1976 · 365pp · 117,713 words
by Wallace W. Kravitz · 30 Apr 1990
by Russell-Jones, Neil. · 21 Mar 2008