Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Sorting by geographical proximity / clumping groups of items based on X and Y

by talexb (Chancellor)
on Jul 18, 2002 at 18:16 UTC ( #182957=note: print w/replies, xml ) Need Help??


in reply to Sorting by geographical proximity / clumping groups of items based on X and Y

Again, a fascinating thread. And amazingly I actually studied this kind of problem in university 20 years ago (shudder) under a brilliant professor called Ed Jernigan (University of Waterloo, faculty of Engineering, department of Systems Design).

So for scholarly research I can suggest Google.

Abigail-II's point is quite valid -- there need to be constraints on the solution otherwise optimization cannot be done. You need to do something like

  • set a maximum cluster radius and
  • set a minimum and/or a maxmimum number of complaints within each cluster.

--t. alex

"Mud, mud, glorious mud. Nothing quite like it for cooling the blood!"
--Michael Flanders and Donald Swann

  • Comment on Re: Sorting by geographical proximity / clumping groups of items based on X and Y

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://182957]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (4)
As of 2022-12-08 02:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?