doesn't break for more than 6 hours in 5-6 days is
probably not human)
Cheers,
Scott
[1] Multilinguals and Wikipedia Editing
http://www.scotthale.net/pubs/?websci2014
--
Scott Hale
Oxford Internet Institute
University of Oxford
http://www.scotthale.net/
scott.h...@oii.ox.ac.uk
On Sun, May 18
Thanks all for the comments on my paper, and even more thanks to everyone
sharing these super helpful ideas on filtering bots: this is why I love the
Wikipedia research committee.
I think Oliver is definitely right that
this would be a useful topic for some piece of method-comparing research,
and screaming into
the light.
(sorry, it's annual review season. That always gets me blithe.)
On 19 May 2014 13:03, Scott Hale computermacgy...@gmail.com wrote:
Thanks all for the comments on my paper, and even more thanks to
everyone sharing these super helpful ideas on filtering bots: this is why
___
Wiki-research-l mailing list
Wiki-research-l@lists.wikimedia.org
https://lists.wikimedia.org/mailman/listinfo/wiki-research-l
--
Scott Hale
Oxford Internet Institute
University of Oxford
http://www.scotthale.net/
scott.h...@oii.ox.ac.uk
are not known by the community
of Wikipedia researchers.
Best,
Valerio
___
Wiki-research-l mailing list
Wiki-research-l@lists.wikimedia.org
https://lists.wikimedia.org/mailman/listinfo/wiki-research-l
--
Scott Hale
Oxford Internet Institute
On Fri, Sep 26, 2014 at 5:14 AM, Luca de Alfaro l...@dealfaro.com wrote:
Better merging would be welcome. But also less aggressive
editing/policing.
When I edit openstreetmap I have a better overall experience: the edits
may or may not go live immediately, but I don't have the impression
edit to their heart content, without
triggering the interest of editors and the consequent conflicts, then save
their changes.
Luca
On Thu, Sep 25, 2014 at 5:15 PM, Scott Hale computermacgy...@gmail.com
wrote:
On Fri, Sep 26, 2014 at 5:14 AM, Luca de Alfaro l...@dealfaro.com
wrote:
Better
, and that was the exact point of my first email:
On Fri, Sep 26, 2014 at 9:15 AM, Scott Hale computermacgy...@gmail.com
wrote:
And that is the fundamental flaw with this whole email thread. The
question needing to be answered isn't what increases new user retention.
The real question is what increases
--
Scott Hale
Oxford Internet Institute
University of Oxford
http://www.scotthale.net/
scott.h...@oii.ox.ac.uk
___
Wiki-research-l mailing list
Wiki-research-l@lists.wikimedia.org
https://lists.wikimedia.org/mailman/listinfo/wiki-research-l
Oliver:
Scott Hale and I have been working on a paper looking at global reach
and how it tracks with internet access growth, in the context of
editing, particularly looking at the mobile web. That, we should be
done with by then; presenting it could be highly useful (Scott? ;p)
I see what
The accept-language header is the obvious place to start, but there is
amble scope to combine multiple approaches together.
In addition to accept-language and geolocation data, any logged in user
will have view/edit history related to multiple editions. If the user is
requesting a specific
The search logs will then be analyzed in order to find recurrent search
patterns across participants.
Before beginning the experiment, I want to check that I can indeed find
patterns in search logs, using several different algorithms. The idea is to
check these algorithms on Wikipedia search
___
Wiki-research-l mailing list
Wiki-research-l@lists.wikimedia.org
https://lists.wikimedia.org/mailman/listinfo/wiki-research-l
--
Dr Scott Hale
Data Scientist
Oxford Internet Institute
University of Oxford
http://www.scotthale.net/
___
Wiki
omepage: www.bgoncalves.com
> Email: bgoncal...@gmail.com
> ***
> ___
> Wiki-research-l mailing list
> Wiki-research-l@lists.wikimedia.org
> https://lists.wikimedia.org/mailman/listinfo/wiki-research-l
>
--
Dr. Scott Hale
Data Sci
lp
> me make more progress. Thanks in advance!
>
> Sincerely,
> Bowen
>
> ___
> Wiki-research-l mailing list
> Wiki-research-l@lists.wikimedia.org
> https://lists.wikimedia.org/mailman/listinfo/wiki-research-l
>
>
--
Dr Scot
the Article-as-Concept Assumption in
Wikipedia. 2017
http://www.brenthecht.com/publications/cscw17_subarticles.pdf
[6] Omnipedia: Bridging the Wikipedia Language Gap. 2012.
http://www.brenthecht.com/papers/bhecht_CHI2012_omnipedia.pdf
Best wishes,
Scott
--
Dr Scott Hale
Senior Data Scientist
Oxford Inte
Hi Alessandro,
Usernames are unique across Wikimedia projects now; so, it is possible to
simply union/intersect the usernames from any projects to understand the
overlap. There are, however, as you have seen a huge number of users
although most are not active in any given month. One approach I
Thank you for organizing. Just a note for Europe based colleagues, that
11:30AM PDT is 18:30 UTC.
This will be 20:30 Central European Summer Time or 19:30 Western European
Summer Time (e.g., Portugal and UK).
Cheers,
Scott
On Fri, Apr 12, 2019 at 8:49 AM Janna Layton wrote:
> Hello, everyone,
Dear All,
I didn't send this earlier because it isn't strictly Wiki related, but
seeing other recent posts to the list I wanted to share as I think many
people here would be good candidates. If you are interested by unable to
send a CV by the deadline, please just tell me.
We're hiring a
Meedan, a global non-profit I work with, is hiring a software engineer. The
posting says frontend, but full-stack developers are also super welcome.
It's a distributed organization with a great mission and culture. I'm very
happy to answer questions if anyone's interested and very much appreciate
The Social Data Science program at the University of Oxford is hiring!
Below is the link for an open position in the MSc program in Social Data
Science. This position is suitable for someone in their early or mid-career
stage. It is a three-year fixed term position in the first instance and
funded
Meedan, a global technology non-profit, is seeking a Machine Learning
Engineer to play a key role in our research and engineering teams. We
build Check, a web platform for collaborative media annotation and
claim-checking used by some of the world’s leading fact-checking and media
organizations,
22 matches
Mail list logo
