| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

C-ORM: docs, API.

Last 100 entries

Telephone System Quotes for Cat Soft LLC; Even; Cherry Jam; Lebanese Writer Amin Maalouf; Learning From Trump; Chinese Writer Hu Fayun; C++ - it's the language of the future; And; Apricot Jam; Also; Excellent Article on USA Politics; Oh Metafilter; Prejudice Against The Rurals; Also, Zizek; Trump; Why Trump Won; Doxygen + Latex on CentOS 6; SMASH - Solve 5 Biggest Problems in Physics; Good article on racism, brexit, and social divides; Grandaddy are back!; Consciousness From Max Entropy; Democrats; Harvard Will Fix Black Poverty; Modelling Bicycle Wheels; Amusing Polling Outlier; If Labour keeps telling working class people...; Populism and Choice; Books on Defeat; Enrique Ferrari - Argentine Author; Transcript of German Scientists on Learning of Hiroshima; Calvert Journal; Owen Jones on Twitter; Possible Japanese Authors; Complex American Literature; Chutney v5; Weird Componentized Virus; Interesting Argentinian Author - Antonio Di Benedetto; Useful Thread on MetaPhysics; RAND on fighting online anarchy (2001); NSA Hacked; Very Good LRB Article on Brexit; Nussbaum on Anger; Tasting; Apple + Kiwi Jam; Hit Me; Sudoku - CSP + Chaos; Recycling Electronics In Santiago; Vector Displays in OpenGL; And Anti-Aliased; OpenGL - Render via Intermediate Texture; And Garmin Connect; Using Garmin Forerunner 230 With Linux; (Beating Dead Horse) StackOverflow; Current State of Justice in China; Axiom of Determinacy; Ewww; Fee Chaos Book; Course on Differential Geometry; Okay, but...; Sparse Matrices, Deep Learning; Sounds Bad; Applebaum Rape; Tomato Chutney v4; Have to add...; Culturally Liberal and Nothing More; Weird Finite / Infinite Result; Your diamond is a beaten up mess; Maths Books; Good Bike Route from Providencia / Las Condes to Panul; Iain Pears (Author of Complex Plots); Plum Jam; Excellent; More Recently; For a moment I forgot StackOverflow sucked; A Few Weeks On...; Chilean Book Recommendations; How To Write Shared Libraries; Jenny Erpenbeck (Author); Dijkstra, Coins, Tables; Python libraries error on OpenSuse; Deserving Trump; And Smugness; McCloskey Economics Trilogy; cmocka - Mocks for C; Concept Creep (Americans); Futhark - OpenCL Language; Moved / Gone; Fan and USB issues; Burgers in Santiago; The Origin of Icosahedral Symmetry in Viruses; autoenum on PyPI; Jars Explains; Tomato Chutney v3; REST; US Elections and Gender: 24 Point Swing; PPPoE on OpenSuse Leap 42.1; SuperMicro X10SDV-TLN4F/F with Opensuse Leap 42.1; Big Data AI Could Be Very Bad Indeed....; Cornering; Postcapitalism (Paul Mason); Black Science Fiction

© 2006-2015 Andrew Cooke (site) / post authors (content).

Flattening Graphs

From: andrew cooke <andrew@...>

Date: Mon, 28 Mar 2011 06:46:16 -0300

When you construct a graph of relationships you often have a rather vague /
flexible notion of "relatedness".  It's natural to use this to decide who are
neighbours, and even to weight the edges.  But it also leads to a curious
problem when you start to use the graph.

The problem is that some nodes come out "better" than others.  You can play
around with how you calculate your "relatedness factor", but the natural
result of any flexible measurement is a degree of inequality.

This can lead to bias.  For example, in the case of Uykfe (and Uykfd before),
I construct a graph of related musicians and then use that to generate
playlists of related tracks.  The "better" nodes tend to capture the playlist
(I imagine that you could relate this to eigenvectors of a transition matrix
or something similar?).

For example, Sparklehorse had links out to various artists, but the highest
weighted links from those neighbours went elsewhere.  So my playlist, when it
starts at Sparklehorse, never returns.

My natural response to this is to make the graph undirected.  But this doesn't
help - it turns out not of the links from Sparklehorse are that great, so
neighbours still prefer other nodes.

A simple solution (one I reinvented for Uykfe after using it in Uykfd and then
forgetting) is to restrict the number of links for each node to some fixed
amount (note: not a cutoff by weight, but a fixed number) and then ignore
weights in transitions.

This doesn't completely remove the problem - the "best" nodes now have more
connections that the "worst" - but it does level the playing field a little.

(I haven't yet tried weighting the notes out from nodes by the inverse of the
number of links at the target).

Andrew

Active Flattening

From: andrew cooke <andrew@...>

Date: Fri, 1 Apr 2011 08:58:02 -0300

Just to follow up on this, the latest (final?) version of Uykfe does actively
flatten graphs: it initially generates 10 outgoing edges per node.  Then it
identifies nodes with the most incoming edges and deletes the loweest weighted
edges that contribute to that.  It's not a perfect solution (you have to stop
when you hit some minimum number of outgoing edges in the neighbours), but it
helps.

Andrew

Comment on this post