New answers tagged sorting
I think you are looking for bipartite(men/women) complete(all men like all women and viceversa). I would tackle the problem from a graph perspective where each user is a node and two nodes are connected if they are mutually interested. Then you can create a matrix and apply some kind of clustering or graph pattern mining. If you think this can help I can ...
In other words, the whole database would have to undergo some major reindexing (recalculating all the matches) every time a new person is added. The strategy in such cases is to maintain a smaller, cached dataset ("delta"), in this case containing new people added throughout the day, which gets merged into the database on a daily basis - could be at night, ...
Categorize interests. For example put math and physics in category science and tennis in someKindofSport. Then try to set grade(score) for matches. Example: if there are in same category then grade +10 or in same interest +20 and if he/she is in range or... then print them by grades.
A topological sort algorithm can sort a collection of data according to some set of rules as you have specified, where not all pairs have a pre-defined ordering. Typically the rules only define a partial ordering, so there are multiple possible orderings and topological sorting chooses an arbitrary one. If there's a contradiction in the rules you have ...
Top 50 recent answers are included