Skip to main content

Home/ PEERS ONLINE INTERACTION FRAMEWORK/ Group items tagged statistics

Rss Feed Group items tagged

Thieme Hennis

Credit Scoring, Data Mining, Predictive Analytics, Statistics, StatSoft Electronic Text... - 0 views

  •  
    This Textbook offers training in the understanding and application of statistics. The material was developed at the StatSoft R&D department based on many years of teaching undergraduate and graduate statistics courses and covers a wide variety of applications, including laboratory research (biomedical, agricultural, etc.), business statistics, credit scoring, forecasting, social science statistics and survey research, data mining, engineering and quality control applications, and many others. The Electronic Textbook begins with an overview of the relevant elementary (pivotal) concepts and continues with a more in depth exploration of specific areas of statistics, organized by "modules," accessible by buttons, representing classes of analytic techniques. A glossary of statistical terms and a list of references for further study are included.
Thieme Hennis

Collaborative thesaurus tagging the Wikipedia way - 0 views

  •  
    This paper explores the system of categories that is used to classify articles in Wikipedia. It is compared to collaborative tagging systems like del.icio.us and to hierarchical classification like the Dewey Decimal Classification (DDC). Specifics and commonalitiess of these systems of subject indexing are exposed. Analysis of structural and statistical properties (descriptors per record, records per descriptor, descriptor levels) shows that the category system of Wikimedia is a thesaurus that combines collaborative tagging and hierarchical subject indexing in a special way.
  •  
    comparison of Dewey's system of categorization and Wikipedia's mixed model.
Thieme Hennis

So Much for the Freelance Economy - 0 views

  • The trend suggests that predictions of an economy run by freelancers -- such as those made by Daniel Pink in his book Free Agent Nation, and by MIT's Thomas Malone and Robert Laubacher in their 1998 paper, "The Dawn of the E-Lance Economy" -- were shortsighted. In 2000, research firm EPIC/MRA of Lansing, Michigan, estimated that 41 percent of all Americans would be private contractors by 2010. But today, the U.S. Bureau of Labor Statistics reports that self-employment numbers have not grown at all over the past four years.
  •  
    criticism on the predicted e-lance economy. seems that number of jobs is declining, and that some of the main e-lance sites are shutting down.
Thieme Hennis

Social Information Filtering: Algorithms for Automating "Word of Mouth'' - 0 views

  • Social Information filtering essentially automates the process of ``word-of-mouth'' recommendations: items are recommended to a user based upon values assigned by other people with similar taste. The system determines which users have similar taste via standard formulas for computing statistical correlations.
    • Thieme Hennis
       
      dit gebeurt bij Last.fm, Amazon, etc...
  • need not be amenable to parsing by a computer
  • may recommend items to the user which are very different (content-wise) from what the user has indicated liking before
  • ...5 more annotations...
  • ecommendations are based on the quality of items, rather than more objective properties of the items themselves
  • The basic idea is: The system maintains a user profile, a record of the user's interests (positive as well as negative) in specific items. It compares this profile to the profiles of other users, and weighs each profile for its degree of similarity with the user's profile. The metric used to determine similarity can vary. Finally, it considers a set of the most similar profiles, and uses information contained in them to recommend (or advise against) items to the user.
  • One observation is that a social information filtering system becomes more competent as the number of users in the system increases.
  • The system may need to reach a certain {\em critical mass} of collected data before it becomes useful.
  • Finally, we haven't even begun to explore the very interesting and controversial social and economical implications of social information filtering systems like Ringo.
  •  
    article about social information filtering: items are recommended based upon values assigned by other people with similar taste.
Thieme Hennis

IEEE Spectrum: Metcalfe's Law is Wrong - 0 views

  • Of all the popular ideas of the Internet boom, one of the most dangerously influential was Metcalfe's Law. Simply put, it says that the value of a communications network is proportional to the square of the number of its users.
  • Remarkably enough, though the quaint nostrums of the dot-com era are gone, Metcalfe's Law remains, adding a touch of scientific respectability to a new wave of investment that is being contemplated, the Bubble 2.0, which appears to be inspired by the success of Google. That's dangerous because, as we will demonstrate, the law is wrong. If there is to be a new, broadband-inspired period of telecommunications growth, it is essential that the mistakes of the 1990s not be reprised.
  • If Metcalfe's mathematics were right, how can the law be wrong? Metcalfe was correct that the value of a network grows faster than its size in linear terms; the question is, how much faster? If there are n members on a network, Metcalfe said the value grows quadratically as the number of members grows. We propose, instead, that the value of a network of size n grows in proportion to n log(n). Note that these laws are growth laws, which means they cannot predict the value of a network from its size alone. But if we already know its valuation at one particular size, we can estimate its value at any future size, all other factors being equal.
  • ...4 more annotations...
  • The fundamental flaw underlying both Metcalfe's and Reed's laws is in the assignment of equal value to all connections or all groups. The underlying problem with this assumption was pointed out a century and a half ago by Henry David Thoreau in relation to the very first large telecommunications network, then being built in the United States. In his famous book Walden (1854), he wrote: "We are in great haste to construct a magnetic telegraph from Maine to Texas; but Maine and Texas, it may be, have nothing important to communicate." As it turns out, Maine did have quite a bit to communicate with Texas—but not nearly as much as with, say, Boston and New York City. In general, connections are not all used with the same intensity. In fact, in large networks, such as the Internet, with millions and millions of potential connections between individuals, most are not used at all. So assigning equal value to all of them is not justified. This is our basic objection to Metcalfe's Law, and it's not a new one: it has been noted by many observers, including Metcalfe himself.
  • Metcalfe's Law does not lead to conclusions as obviously counterintuitive as Reed's Law. But it does fly in the face of a great deal of the history of telecommunications: if Metcalfe's Law were true, it would create overwhelming incentives for all networks relying on the same technology to merge, or at least to interconnect. These incentives would make isolated networks hard to explain. To see this, consider two networks, each with n members. By Metcalfe's Law, each one's value is on the order of n 2, so the total value of both of these separate networks is roughly 2n 2. But suppose these two networks merge. Then we will effectively have a single network with 2n members, which, by Metcalfe's Law, will be worth (2n)2 or 4n 2—twice as much as the combined value of the two separate networks. Surely it would require a singularly obtuse management, to say nothing of stunningly inefficient financial markets, to fail to seize this obvious opportunity to double total network value by simply combining the two.
  • Zipf's Law is one of those empirical rules that characterize a surprising range of real-world phenomena remarkably well. It says that if we order some large collection by size or popularity, the second element in the collection will be about half the measure of the first one, the third one will be about one-third the measure of the first one, and so on. In general, in other words, the kth-ranked item will measure about 1/k of the first one. To take one example, in a typical large body of English-language text, the most popular word, "the," usually accounts for nearly 7 percent of all word occurrences. The second-place word, "of," makes up 3.5 percent of such occurrences, and the third-place word, "and," accounts for 2.8 percent. In other words, the sequence of percentages (7.0, 3.5, 2.8, and so on) corresponds closely with the 1/k sequence (1/1, 1/2, 1/3…). Although Zipf originally formulated his law to apply just to this phenomenon of word frequencies, scientists find that it describes a surprisingly wide range of statistical distributions, such as individual wealth and income, populations of cities, and even the readership of blogs.
  • Zipf's Law can also describe in quantitative terms a currently popular thesis called The Long Tail. Consider the items in a collection, such as the books for sale at Amazon, ranked by popularity. A popularity graph would slope downward, with the few dozen most popular books in the upper left-hand corner. The graph would trail off to the lower right, and the long tail would list the hundreds of thousands of books that sell only one or two copies each year.
  •  
    interesting article about Metcalfe's law and other laws, and why they are wrong about estimating value.
  •  
    interessant: over theorie van waarde van netwerken
1 - 5 of 5
Showing 20 items per page