From: vitorino.ramos@gmail.com   
      
   On Jul 14, 2:20 am, jasonjeffreyjo...@gmail.com wrote:   
   > Assume we have a set of unordered items, e.g. [e,c,a,d,f,b].  There   
   > exists some true ordering (e.g. [a,b,c,d,e,f]) but it is unknown to   
   > us.  The only queries we can make are item-to-item comparisons (e.g.   
   > Should item a be before item c?).  The yes/no answers we receive will   
   > be noisy (e.g. the same question may result in yes answers some of the   
   > time and no other times) but can be assumed to be correct more often   
   > than incorrect.  For simplicity, assume the items to be compared are   
   > chosen randomly (i.e. we don't have to/aren't able to specify a policy   
   > for choosing items to compare).   
   >   
   > The ultimate goal is to reorder our unordered set to resemble the   
   > unknowable true ordering as best as possible given the information   
   > received so far.  What is the procedure for reordering the items after   
   > each successive comparison?   
   >   
   > I'm hoping someone can point me to a specific algorithm that does   
   > exactly this.  (I'm assuming this is a solved problem.  I'm just not   
   > familiar enough with the terminology to find it.)   
   >   
   > Can someone point me to a paper or textbook example?   
   >   
      
   Have a look on section 3.1 here: http://www.laseeb.org/vramos/ref29.html   
   Maybe it could help.   
   For the noisy part, probably you should develop a "Fuzzy Logic"   
   metric.   
      
   Best, v.   
      
   ~ v.ramos, LaSEEB, IST, http://www.laseeb.org/vramos/   
      
   [...] Interactions among many sporuliferous and ubiquitous   
   abstractions   
   may lead to increasing reality [...] Vitorino Ramos, 2001.   
      
   [ comp.ai is moderated ... your article may take a while to appear. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)