Sean, Jack, the PR is an excellent idea, I was not even thinking about it,
but a tweaked version of the PageRank algorithm can absolutely work for
this, and is relatively easy to implement.
Ted, straight question, thank you. You are right, I'm not working for a
washing powder company nor a laundry
And further linear Markov chains can be expressed as matrix products which
can be computed efficiently using SVD's.
Zoltan, is this literally the problem that you are working on? Or is this
a shadow of the problem that you are interested in?
On Sat, Mar 3, 2012 at 9:55 AM, Jack Tanner wrote:
>
It may further help to note that PageRank is a special case of a Markov
chain, and this washing system may well be described by a Markov chain
model.
On 3/3/2012 12:35 PM, Sean Owen wrote:
I answered on SO:
The only thing I can think of that sounds like this problem is
PageRank. It's computed
I answered on SO:
The only thing I can think of that sounds like this problem is
PageRank. It's computed by a sort of iterative simluation. Each page
has some influence (color) which flows via its links (socks its washed
with) and at some point the page influence reaches a steady state
(final colo
