CONNECTION ENGINE

• US 20110173173A1
• Filed: 01/12/2010
• Published: 07/14/2011
• Est. Priority Date: 01/12/2010
• Status: Active Grant

• Current Assignee: Intouchlevel Corporation
• Original Assignee: Intouchlevel Corporation
• Inventors: Hall, Bruce Wayne
• Granted Patent: US 8,818,980 B2
• Time in Patent Office: Days
• US Class Current: 707/706
• CPC Class Codes: G06F 16/355 Class or cluster creation or modification
• CPC Class Codes: G06F 16/9014 hash tables
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A method and system for identifying a group of objects or content that have a plurality of group-wise connections, and for revealing the evolution of the state of those connections over time. A network of symbols are generated to create a symbol backbone, and raw object or content descriptions are mapped to the generated symbols. To identify the objects or content most closely and most interconnectedly related to a query object or content, the query object or content is mapped onto the symbol backbone. The raw object or content description expression set of the related symbols are retrieved, forming the group of interconnected objects or content. The retrieved object or content descriptions can be further refined.

Claims

1. A method for identifying a group of objects or content, wherein the objects or content have a plurality of group-wise connections, said method comprising the steps of:

a. generating a plurality of sets, wherein each of said plurality of sets comprise at least one of a plurality of binary representations;

b. calculating a first distance between at least one of said plurality of sets and at least one of a plurality of object or content descriptions;

c. associating at least one of said plurality of sets with said at least one of a plurality of object or content descriptions based on said first distance;

d. associating a query with at least one of said plurality of sets;

e. creating a first list, wherein said first list comprises each of said plurality of sets related to said query; and

f. identifying each object or content description associated with each set contained within said first list.

2. The method of claim 1, wherein said first list comprises each of said plurality of sets containing said query.

3. The method of claim 1, wherein said first list comprises each of said plurality of sets which do not contain said query.

4. The method of claim 1, wherein said first list comprises each of said plurality of sets within a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

5. The method of claim 4, wherein said second distance is a Hamming distance.

6. The method of claim 1, wherein said first list comprises each of said plurality of sets outside of a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

7. The method of claim 1, wherein said first list comprises each of said plurality of sets equal to a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

8. The method of claim 1, wherein each of said plurality of sets is associated with an address.

9. The method of claim 8, wherein said address is a single binary string, the single binary string comprising every of said binary representations comprising one of said plurality of sets.

10. The method of claim 9, further comprising the steps:

arranging said binary representations by ascending decimal value; and

concatenating said ordered binary representations.

11. The method of claim 10, further comprising the steps:

arranging said binary representations by descending decimal value; and

concatenating said ordered binary representations.

12. The method of claim 1, wherein at least one of steps (a) through (f) is repeated.

13. The method of claim 12, wherein said at least one repeated step is continuously repeated.

14. The method of claim 12, wherein said at least one repeated step is repeated at a pre-defined rate.

15. The method of claim 12, wherein said at least one repeated step is repeated in response to a stimulus.

16. The method of claim 1, further comprising the step:

monitoring the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets for any change in said association over a period of time.

17. The method of claim 1, further comprising the step:

monitoring the effect of step (c) on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

18. The method of claim 1, further comprising the step:

monitoring the effect of an internal stimulus on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

19. The method of claim 1, further comprising the step of:

monitoring the effect of an external stimulus on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

20. The method of claim 16, further comprising the step:

storing the results of said monitoring.

21. The method of claim 16, further comprising the step:

making the results of said monitoring perceivable.

22. The method of claim 1, further comprising the step:

monitoring changes to said plurality of sets over a period of time.

23. The method of claim 22, further comprising the step:

storing the results of said monitoring.

24. The method of claim 22, further comprising the step:

making the results of said monitoring perceivable.

25. The method of claim 1, further comprising the step:

monitoring changes to said first distance over a period of time.

26. The method of claim 25, further comprising the step:

storing the results of said monitoring.

27. The method of claim 25, further comprising the step:

making the results of said monitoring perceivable.

28. The method of claim 1, further comprising the steps:

monitoring an aspect of said group of objects or content; and

converting the results of said monitoring into a self-describing object or content description.

29. The method of claim 28, further comprising the step:

calculating a second distance, wherein said second distance is the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said self-describing object or content description; and

associating at least one of said plurality of sets with said self-describing object or content description based on said first distance.

30. The method of claim 1, further comprising the step:

calculating a second distance, wherein said second distance is the difference between a first value obtained from at least one of said plurality of object or content descriptions and a second value obtained from at least one of said plurality of sets.

31. The method of claim 1, further comprising the step:

calculating a second distance, wherein said second distance is the difference between a first value obtained from at least one of said plurality of object or content descriptions and a second value obtained from the at least one of said plurality of sets associated with said at least one of said plurality of object or content descriptions.

32. The method of claim 30, wherein said first and second values are calculated using the following equation:

33. The method of claim 30, wherein said second distance is the difference between a first value obtained from said at least one of said plurality of sets and a second value obtained from at least one of said generated plurality of sets.

34. The method of claim 30, wherein said second distance is the difference between a first value obtained from said at least one of a plurality of object or content descriptions and a second value obtained from one of said plurality of object or content descriptions.

35. The method of claim 30, further comprising the step:

determining which of said identified object or content descriptions are within a distance equal to or smaller than a maximum value of said second distance.

36. The method of claim 30, further comprising the step:

determining which of said identified object or content descriptions are within a distance equal to or larger than a minimum value of said second distance.

37. The method of claim 35, wherein said maximum value of said second distance is chosen by a user.

38. The method of claim 37, wherein the user chooses the maximum value of said second distance using a graphical user interface.

39. The method of claim 36, wherein said minimum value of said second distance is chosen by a user.

40. The method of claim 39, wherein the user chooses the minimum value of said second distance using a graphical user interface.

41. The method of claim 30, further comprising the step:

filtering the results of at least one of steps e and f using said second distance.

42. The method of claim 30, further comprising the step:

monitoring changes to said first or second value over a period of time.

43. The method of claim 42, further comprising the step:

storing the results of said monitoring.

44. The method of claim 42, further comprising the step:

making the results of said monitoring perceivable.

45. The method of claim 1, wherein said first distance is the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from at least one of a plurality of object or content descriptions.

46. The method of claim 45, wherein each of said plurality of sets has a common first value.

47. The method of claim 45, wherein said plurality of sets have a variable first value.

48. The method of claim 45, wherein said plurality of sets have first values that are distributed according to a pre-determined parameter.

49. The method of claim 45, wherein said plurality of sets have first values that are distributed according to statistics.

50. The method of claim 45, wherein said plurality of sets is a subset of a larger plurality of sets.

51. The method of claim 45, wherein said plurality of sets is a subset of a larger plurality of sets, said subset comprised of at least one of said larger plurality of sets that falls within a range of said first value.

52. The method of claim 45, wherein said plurality of sets is comprised of object or content descriptions.

53. The method of claim 1, further comprising the step:

filtering the results of at least one of steps (e) and (f).

54. The method of claim 53, wherein said results are filtered by specifying a maximum or minimum number of sets in said first list.

55. The method of claim 53, wherein said results are filtered by specifying a maximum or minimum number of object or content descriptions associated said first list.

56. The method of claim 1, further comprising the step:

storing each of said first distances in a first storage device.

57. The method of claim 1, wherein every binary representation in each of said plurality of sets is of equal distance to every other binary representation in that set, said distance calculated by a metric function.

58. The method of claim 1, wherein every binary representation in each of said plurality of sets is of equal Hamming distance to every other binary representation in that set.

59. The method of claim 58, wherein said Hamming distance is a value found within the range between 0 and a number equal to the length of the shortest of the binary representation in that set.

60. The method of claim 1, wherein said first distance is determined using a distance function.

61. The method of claim 1, wherein said query is a binary representation.

62. The method of claim 1, wherein said query is a plurality of binary representations.

63. The method of claim 1, wherein said query is an object or content description.

64. The method of claim 1, wherein a user presents the query.

65. The method of claim 1, wherein a computer program presents the query.

66. The method of claim 1, further comprising the following step:

mapping at least one of said plurality of binary representations found within at least two of said plurality of sets.

67. The method of claim 1, further comprising the step:

creating a second list, said second list comprising at least one of said plurality of binary representations found within at least two of said plurality of sets contained within said first list.

68. The method of claim 67, further comprising the steps:

selecting a binary representation from said second list; and

creating a third list, said third list comprising at least one of said plurality of sets found in said first list, the at least one of said plurality of sets found in said first list comprising the selected binary representation from said second list.

69. The method of claim 1, further comprising the step:

returning said identified object or content descriptions to a user.

70. The method of claim 69, wherein said identified object or content descriptions are perceived by said user.

71. The method of claim 69, wherein a graphical user interface is used to return said identified object or content descriptions to said user.

72. The method of claim 1, further comprising the step of storing the generated plurality of sets in a first storage device.

73. The method of claim 1, further comprising the step:

storing the associations in a first storage device.

74. The method of claim 1, wherein an associative memory associates said plurality of sets with said plurality of object or content descriptions in step (d).

75. The method of claim 1, further comprising the step of:

g. determining a first value within said group of sets.

76. The method of claim 75, further comprising the steps:

creating a perceptual impression of said first value; and

returning said perceptual impression to a user.

77. The method of claim 76, wherein a graphical user interface is used to return said perceptual impression to said user.

78. The method of claim 75, wherein said first value is a difference between a first measurement and a second measurement within said group of sets.

79. The method of claim 75, wherein said first value is a change over time in a first measurement within said group of sets.

80. The method of claim 75, wherein said first value is a difference between a change over time in a first measurement within said group of sets and a change over time in a second measurement within said group of sets.

81. The method of claim 75, wherein said first value is a measurement between at least two of the generated plurality of sets.

82. The method of claim 75 wherein said first value is a measurement between at least one of said plurality of object or content descriptions and at least one of said plurality of sets.

83. The method of claim 75, wherein said first value is a measurement between at least two of said plurality of object or content descriptions.

84. The method of claim 75, wherein said first value is a measurement between said query and at least one of said plurality of sets.

85. The method of claim 75, wherein said first value is a measurement between said query and at least one of said plurality of object or content descriptions.

86. The method of claim 1, further comprising the step of determining a first value, wherein said first value is a difference between a value of a first user and a value of a second user.

87. A system for identifying a group of objects or content, wherein the objects or content have a plurality of group-wise connections, said system comprising:

a. a set generator, wherein said set generator generates a plurality of sets, each of said plurality of sets comprising at least one of a plurality of binary representations;

b. a symbol memory adapted to associate at least one of said plurality of sets with at least one of a plurality of object or content descriptions, wherein said at least one of a plurality of object or content descriptions is within a first distance between said at least one of said plurality of sets and said at least one of a plurality of object or content descriptions;

c. a symbol lookup server adapted to associate a query with at least one of said plurality of sets, and further adapted to create a first list, wherein said first list comprises each of said plurality of sets related to said query; and

d. a symbol expression lookup server, wherein said symbol expression lookup server identifies each object or content description associated with each set contained within said first list.

88. The system of claim 87, wherein said first list comprises each of said plurality of sets containing said query.

89. The system of claim 87, wherein said first list comprises each of said plurality of sets which do not contain said query.

90. The system of claim 87, wherein said first list comprises each of said plurality of sets within a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

91. The system of claim 90, wherein said second distance is a Hamming distance.

92. The system of claim 87, wherein said first list comprises each of said plurality of sets outside of a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

93. The system of claim 87, wherein said first list comprises each of said plurality of sets equal to a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

94. The system of claim 87, further comprising a symbol set, wherein the symbol set is a plurality of addresses.

95. The system of claim 94, wherein each of said plurality of addresses is a single binary string, the single binary string comprising every of said binary representations of one of said plurality of sets.

96. The system of claim 95, wherein said binary representations are ordered by ascending decimal value and concatenated into a single binary string.

97. The system of claim 95, wherein said binary representations are ordered by descending decimal value and concatenated into a single binary string.

98. The system of claim 87, wherein at leak one of said set generator, said symbol memory, said symbol lookup server, or said symbol expression lookup server repeats a function at least once.

99. The system of claim 98, wherein said repeated function is continuously repeated.

100. The system of claim 98, wherein said repeated function is repeated at a pre-defined rate.

101. The system of claim 98, wherein said repeated function is repeated in response to a stimulus.

102. The system of claim 87, wherein said symbol memory is adapted to monitor the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets for any change in said association over a period of time.

103. The system of claim 87, wherein said symbol memory is adapted to monitor the effect of an internal stimulus on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

104. The system of claim 87, wherein said symbol memory is adapted to monitor the effect of an external stimulus on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

105. The system of claim 102, further comprising:

a first storage device adapted to store the results of said monitoring.

106. The system of claim 102, wherein the results, of said monitoring are perceived by a user.

107. The system of claim 87, wherein changes to said plurality of sets over a period of time are monitored.

108. The system of claim 107, wherein the results of said monitoring are stored.

109. The system of claim 107, wherein the results of said monitoring are perceived by a user.

110. The system of claim 87, wherein changes to said first distance over a period of time are monitored.

111. The system of claim 110, wherein the results of said monitoring are stored.

112. The system of claim 110, wherein the results of said monitoring are perceived by a user.

113. The system of claim 87, wherein the system monitors an aspect of said group of objects or content and converts the results of said monitoring into a self-describing object or content description.

114. The system of claim 113, wherein said symbol memory is adapted to associate said self-describing object or content description with at least one of a plurality of object or content descriptions, wherein said self-describing object or content description is within a second distance, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said self-describing object or content description.

115. The system of claim 87, wherein said symbol memory is adapted to calculate a second distance, the second distance being the difference between a first value obtained from at least one of said plurality of object or content descriptions and a second value obtained from at least one of said plurality of sets.

116. The system of claim 87, wherein said symbol memory is adapted to calculate a second distance, the second distance being the difference between a first value obtained from at least one of said plurality of object or content descriptions and a second value obtained from the at least one of said plurality of sets associated with said at least one of said plurality of object or content descriptions.

117. The system of claim 115, wherein said first and second values are calculated using the following equation:

118. The system of claim 115, wherein said second distance is the difference between a first value obtained from said at least one of said plurality of sets and a second value obtained from at least one of said generated plurality of sets.

119. The system of claim 115, wherein said second distance is the difference between a first value obtained from said at least one of a plurality of object or content descriptions and a second value obtained from one of said plurality of object or content descriptions.

120. The system of claim 115, wherein said symbol expression lookup server determines which of said identified object or content descriptions are within a distance equal to or smaller than a maximum value of said second distance.

121. The system of claim 115, wherein said symbol expression lookup server determines which of said identified object or content descriptions are within a distance equal to or larger than a minimum value of said second distance.

122. The system of claim 120, wherein said maximum value of said second distance is chosen by a user.

123. The system of claim 122, wherein the user chooses the maximum value of said second distance using a graphical user interface.

124. The system of claim 121, wherein said minimum value of said second distance is chosen by a user.

125. The system of claim 124, wherein the user chooses the minimum value of said second distance using a graphical user interface.

126. The system of claim 115, further comprising:

a filter adapted to filter the results of at least one of said symbol lookup server and said symbol expression lookup server using said second distance.

127. The system of claim 115, wherein changes to said first or second value over a period of time are monitored.

128. The system of claim 127, wherein the results of said monitoring are stored.

129. The system of claim 127, wherein the results of said monitoring are perceived by a user.

130. The system of claim 87, wherein said first distance is the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from at least one of a plurality of object or content descriptions.

131. The system of claim 130, wherein each of said plurality of sets has a common first value.

132. The system of claim 130, wherein said plurality of sets have a variable first value.

133. The system of claim 130, wherein said plurality of sets have first values that are distributed according to a pre-determined parameter.

134. The system of claim 130, wherein said plurality of sets have first values that are distributed according to statistics.

135. The system of claim 87, wherein said plurality of sets is a subset of a larger plurality of sets.

136. The system of claim 135, wherein said subset is comprised of at least one of said larger plurality of sets that falls within a range of said first value.

137. The system of claim 87, wherein said plurality of sets is comprised of object or content descriptions.

138. The system of claim 87 further comprising:

a first storage device adapted to store each of said first distance.

139. The system of claim 87, further comprising:

a filter adapted to filter the results of at least one of said symbol lookup server and said symbol expression lookup server.

140. The system of claim 139, wherein said filter is adapted to filter said results by specifying a maximum or minimum number of sets in said first list.

141. The system of claim 139, wherein said filter is adapted to filter said results by specifying a maximum or minimum number of object or content descriptions associated said first list.

142. The system of claim 87, wherein every binary representation in each of said plurality of sets is of equal distance to every other binary representation in that set, said distance calculated by a metric function.

143. The system of claim 87, wherein every binary representation in each of said plurality of sets is of equal Hamming distance to every other binary representation in that set.

144. The system of claim 143, wherein said Hamming distance is a value found within the range between 0 and a number equal to the length of the shortest of the binary representation in that set.

145. The system of claim 87, wherein said first distance is determined using a distance function.

146. The system of claim 87, wherein said query is a binary representation.

147. The system of claim 87, wherein said query is a plurality of binary representations.

148. The system of claim 87, wherein said query is an object or content description.

149. The system of claim 87, wherein a user presents the query to the system.

150. The system of claim 87, a computer program presents the query to the system.

151. The system of claim 87, wherein the symbol memory is further adapted to map at least one of said plurality of binary representations found within at least two of said plurality of sets.

152. The system of claim 87, further comprising:

a multicomplementarity relation lookup component, the multicomplementarity relation lookup component adapted to create a second list, said second list comprising at least one of said plurality of binary representations found within at least two of said plurality of sets contained within said first list.

153. The system of claim 152, further comprising:

a multicomplementarity relation facet return component, said multicomplementarity relation facet return component adapted to create a third list, said third list comprising at least one of said plurality of sets found in said first list, the at least one of said plurality of sets found in said first list comprising a binary representation selected from said second list.

154. The system of claim 87, further comprising:

an impressionator.

155. The system of claim 154, wherein said impressionator is adapted to create a perceptual impression of a first value within said group of sets.

156. The system of claim 155, wherein said impressionator is further adapted to return said perceptual impression to a user.

157. The system of claim 155, further comprising:

a graphical user interface adapted to return said perceptual impression to said user.

158. The system of claim 154, wherein said first value is a difference between a first measurement and a second measurement within said group of sets.

159. The system of claim 154, wherein said first value is a change over time in a first measurement within said group of sets.

160. The system of claim 154, wherein said first value is a difference between a change over time in a first measurement within said group of sets and a change over time in a second measurement within said group of sets.

161. The system of claim 87, wherein said impressionator is adapted to create a perceptual impression of a first value, said first value being the difference between a value of a first user and a value of a second user.

162. The system of claim 87, wherein said identified object or content descriptions are perceived by a user.

163. The system of claim 87, further comprising:

a graphical user interface.

164. The system of claim 87, further comprising:

a first storage device adapted to store the generated plurality of sets.

165. The system of claim 87, wherein said symbol memory is an associative memory.

166. A program stored on a computer readable medium, the program comprising:

a. means for generating a plurality of sets, wherein each of said plurality of sets comprise at least one of a plurality of binary representations;

b. means for calculating a first distance between at least one of said plurality of sets and at least one of a plurality of object or content descriptions;

c. means for associating at least one of said plurality of sets with said at least one of a plurality of object or content descriptions based on said first distance;

d. means for associating a query with at least one of said plurality of sets;

e. means for creating a first list, wherein said first list comprises each of said plurality of sets related to said query; and

f. means for identifying each object or content description associated with each set contained within said first list.

167. The program of claim 166, wherein said first list comprises each of said plurality of sets containing said query.

168. The program of claim 166, wherein said first list comprises each of said plurality of sets which do not contain said query.

169. The program of claim 166, wherein said first list comprises each of said plurality of sets within a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

170. The program of claim 169, wherein said second distance is a Hamming distance.

171. The program of claim 166, wherein said first list comprises each of said plurality of sets outside of a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

172. The program of claim 166, wherein said first list comprises each of said plurality of sets equal to a second distance to said query, said second distance being the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said query.

173. The program of claim 166, wherein each of said plurality of sets is associated with an address.

174. The program of claim 173, wherein each of said addresses is a single binary string, the single binary string comprising every of said binary representations of one of said plurality of sets.

175. The program of claim 174, further comprising:

means to order said binary representations by ascending decimal value; and

means to concatenate said ordered binary representations.

176. The program of claim 174, further comprising:

means to order said binary representations by descending decimal value; and

means to concatenate said ordered binary representations.

177. The program of claim 166, further comprising means to repeat at least one of said means (a) through (f).

178. The program of claim 166, wherein said means for associating at least one of said plurality of sets with at least one of a plurality of object or content descriptions further comprises means for repeating said associating.

179. The program of claim 178, wherein said means for repeating continuously repeats said associating.

180. The program of claim 178, wherein said means for repeating repeats said associating at a pre-defined rate.

181. The program of claim 178, wherein said means for repeating repeats said associating in response to a stimulus.

182. The program of claim 166, further comprising:

means for monitoring the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets for any change in said association over a period of time.

183. The program of claim 166, further comprising:

means for monitoring the effect of means (c) on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

184. The program of claim 166, further comprising:

means for monitoring the effect of an internal stimulus on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

185. The program of claim 166, further comprising:

means for monitoring the effect of an external stimulus on the association of the at least one of a plurality of object or content descriptions with the at least one of said plurality of sets.

186. The program of claim 182, further comprising:

means for storing the results of said monitoring.

187. The program of claim 182, further comprising:

means for perceiving the results of said monitoring.

188. The program of claim 166, further comprising:

means to monitor changes to said plurality of sets over a period of time.

189. The program of claim 188, further comprising:

means to store the results of said monitoring.

190. The program of claim 188, further comprising:

means to make the results of said monitoring perceivable.

191. The program of claim 166, further comprising:

means to monitor changes to said first distance over a period of time.

192. The program of claim 191, further comprising:

means to store the results of said monitoring.

193. The program of claim 191, further comprising:

means to make the results of said monitoring perceivable.

194. The program of claim 166, further comprising:

means to monitor an aspect of said group of objects or content; and

means to convert the results of said monitoring into a self-describing object or content description.

195. The program of claim 166, further comprising:

means to calculate a second distance, wherein said second distance is the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from said self-describing object or content description; and

means to associate at least one of said plurality of sets with said self-describing object or content description based on said first distance.

196. The program of claim 166, further comprising:

means to calculate a second distance, wherein said second distance is the difference between a first value obtained from at least one of said plurality of object or content descriptions and a second value obtained from at least one of said plurality of sets.

197. The program of claim 166, further comprising:

means to calculate a second distance, wherein said second distance is the difference between a first value obtained from at least one of said plurality of object or content descriptions and a second value obtained from the at least one of said plurality of sets associated with said at least one of said plurality of object or content descriptions.

198. The program of claim 196, wherein said second distance is calculated using the following equation:

199. The program of claim 196, wherein said second distance is the difference between a first value obtained from said at least one of said plurality of sets and a second value obtained from at least one of said generated plurality of sets.

200. The program of claim 196, wherein said second distance is the difference between a first value obtained from said at least one of a plurality of object or content descriptions and a second value obtained from one of said plurality of object or content descriptions.

201. The program of claim 196, further comprising:

means for determining which of said identified object or content descriptions are within a distance equal to or smaller than a maximum value of said second distance.

202. The program of claim 196, further comprising:

means for determining which of said identified object or content descriptions are within a distance equal to or larger than a minimum value of said second distance.

203. The program of claim 201, wherein said maximum value of said second distance is chosen by a user.

204. The program of claim 203, wherein the user chooses the maximum value of said second distance using a graphical user interface.

205. The program of claim 202, wherein said minimum value of said second distance is chosen by a user.

206. The program of claim 205, wherein the user chooses the minimum value of said second distance using a graphical user interface.

207. The program of claim 196, further comprising:

means to filter the results of at least one of said associating means using said second distance.

208. The program of claim 196, further comprising:

means to monitor changes to said first or second value over a period of time.

209. The program of claim 208, further comprising:

means to store the results of said monitoring.

210. The program of claim 208, further comprising:

means to make the results of said monitoring perceivable.

211. The program of claim 166, wherein said first distance is the difference between a first value obtained from at least one of said plurality of sets and a second value obtained from at least one of a plurality of object or content descriptions.

212. The program of claim 211, wherein each of said plurality of sets has a common first value.

213. The program of claim 211, wherein said plurality of sets have a variable first value.

214. The program of claim 211, wherein said plurality of sets have first values that are distributed according to a pre-determined parameter.

215. The program of claim 211, wherein said plurality of sets have first values that are distributed according to statistics.

216. The program of claim 166, wherein said plurality of sets is a subset of a larger plurality of sets.

217. The program of claim 216, wherein said subset is comprised of at least one of said larger plurality of sets that falls within a range of said first value.

218. The program of claim 166, wherein said plurality of sets is comprised of object or content descriptions.

219. The program of claim 166, further comprising:

means to filter said first list or said identified object or content descriptions.

220. The program of claim 219, wherein said results are filtered by specifying a maximum or minimum number of sets in said first list.

221. The program of claim 219, wherein said results are filtered by specifying a maximum or minimum number of object or content descriptions associated said first list.

222. The program of claim 166, further comprising:

means for storing each of said first distances.

223. The program of claim 166, wherein every binary representation in each of said plurality of sets is of equal distance to every other binary representation in that set, said distance calculated by a metric function.

224. The program of claim 166, wherein every binary representation in each of said plurality of sets is of equal Hamming distance to every other binary representation in that set.

225. The program of claim 224, wherein said Hamming distance is a value found within the range between 0 and a number equal to the length of the shortest of the binary representation in that set.

226. The program of claim 166, wherein said query is a binary representation.

227. The program of claim 166, wherein said query is a plurality of binary representations.

228. The program of claim 166, wherein said query is an object or content description.

229. The program of claim 166, wherein a user presents the query.

230. The program of claim 166, wherein a second computer program presents the query to said first computer program.

231. The program of claim 166, further comprising:

means for mapping at least one of said plurality of binary representations found within at least two of said plurality of sets.

232. The program of claim 166, further comprising:

means for creating a second list, said second list comprising at least one of said plurality of binary representations found within at least two of said plurality of sets contained within said first list.

233. The program of claim 232, further comprising:

means for creating a third list, said third list comprising at least one of said plurality of sets found in said first list, the at least one of said plurality of sets found in said first list comprising a binary representation selected from said second list.

234. The program of claim 166, further comprising:

means for returning said identified object or content descriptions to a user.

235. The program of claim 234, wherein said identified object or content descriptions are perceived by said user.

236. The program of claim 166, further comprising:

a graphical user interface.

237. The program of claim 166, wherein said graphical user interface is used to return said identified object or content descriptions to said user.

238. The program of claim 166, further comprising means for determining a first value within said group of sets.

239. The program of claim 238, further comprising:

means for creating a perceptual impression of said first value; and

means for returning said perceptual impression to a user.

240. The program of claim 239, wherein said means for returning said perceptual impression to said user is a graphical user interface.

241. The program of claim 238, wherein said first value is a difference between a first measurement and a second measurement within said group of sets.

242. The program of claim 238, wherein said first value is a change over time in a first measurement within said group of sets.

243. The program of claim 238, wherein said first value is a difference between a change over time in a first measurement within said group of sets and a change over time in a second measurement within said group of sets.

244. The program of claim 166, further comprising:

means of determining a first value, wherein said first value is a difference between a value of a first user and a value of a second user.

245. The program of claim 239, wherein said identified object or content descriptions are perceived by a user.

246. The program of claim 166, further comprising:

means for storing the generated plurality of sets.

247. The program of claim 166, further comprising:

means for storing the associations.

248. The program of claim 166, wherein the means for associating a query with at least one of said plurality of sets comprises associative memory.