tag:blogger.com,1999:blog-7950265263808507619.post9093675339059046293..comments2023-11-02T04:02:04.801-07:00Comments on Andrew LaRell Fry: Visualize MucketyDroid116http://www.blogger.com/profile/05434806942584240318noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-7950265263808507619.post-49549801457620427172008-03-18T11:50:00.000-07:002008-03-18T11:50:00.000-07:00I'll e-mail you about the project.Filtering and se...I'll e-mail you about the project.<BR/><BR/>Filtering and semantic engines, as the processes develop and improve, will certainly improve both the quality and quantity of the resulting associations.<BR/><BR/>However, each stage and application of filtering and (semantic) analysis introduces it's own level of error. And as semantic analysis rises above simple grammatical analysis, requiring more artificial intelligence, it also increasingly introduces levels of subjectivity.<BR/><BR/>Then, once all of this has taken place, selecting the relationships between the subjects of the data analyzed for storage and reference, as well as the relationships between that and the query introduced, requires not only highly complex algorithms that must apply subjective weights, it must also analyze the subjectivity of the query and compare it against the subjectivity of the data being analyzed for inclusion in the result. <BR/><BR/>As an example, picture a well educated political analyst looking for a connection between an opposing candidate and a politician involved in a breaking scandal. He'll want to ignore the rantings of moonbats (on either side) and focus on information that produces actual ties between the two. However, the actual tie might be hidden in an emotional rant that the system may have disregarded because it evaluated the emotional language as the ranting of a moonbat. <BR/><BR/>And from the beginning, all of this is based on the grammar of the sentences introduced into the processes.<BR/><BR/>In short, filtering and semantic engines will get the concept over the first hurdle on it's way to usefulness.<BR/><BR/>Obviously, this are just a few of many areas of development that I've been keeping an eye on over the years. I think the most interesting part is seeing which sector advancements come from. Will they come from garages and basements, research schools or corporate labs?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7950265263808507619.post-48258981954387924782008-03-18T09:22:00.000-07:002008-03-18T09:22:00.000-07:00I'd like to know more about your open source proje...I'd like to know more about your open source project. If you have a moment contact me with the information.<BR/><BR/>As for the effectiveness of this type of visualization approach, it definitely will increase in value as technology improves. Filtering and semantic associations will be an incredible step forward. The idea of moving through a three dimensional space of association will change the whole ball game.<BR/><BR/>With the right semantic engine and filters, you will be able to adjust and control the amount of depth and breadth of related information to suit your taste.Droid116https://www.blogger.com/profile/05434806942584240318noreply@blogger.comtag:blogger.com,1999:blog-7950265263808507619.post-22516379467174501852008-03-18T01:27:00.000-07:002008-03-18T01:27:00.000-07:00I think this has a lot of potential, but it has a ...I think this has a lot of potential, but it has a long way to go. <BR/><BR/>One problem is the heuristics of compiling a large number of various pieces of data into one representative subset. Imagine trying to compile all of the data relating to, say, "the president of the United States". Start with 43 presidents then include their vice-presidents, cabinets, congressional leaders that they worked with (and against), foreign leaders on the scene at the time, opponents in the campaigns, etc. and the interconnections of all of those individuals, each being weighted according to their proximity and importance. Throw in the political history of each president for each office they held leading up to their election as president. Then doing the same for the other person you're trying to connect them with, but roughly in reverse, so that the interconnections can be found. And how many degrees of separation you're looking for makes a big difference. Doing this for even one president might take a moment or two even on a fast computer. With that problem comes the shortcomings of currently available database platforms which are relatively linear in their ability to interrelate data.<BR/><BR/>Another issue is the visual representation of numerous interconnected pieces of data and their relations in an easy to understand format. Just connecting one president to one congressman of the same party might fill up your screen with an indistinguishable mass of icons and text. <BR/><BR/>As an example, type in your favorite recent president and click on a connected 'muckety muck' and continue on with that for even two or three levels.<BR/><BR/>I'm sure someone will come up with something soon and create the next Google. <BR/><BR/>I'm currently working on a much smaller process for an open source project. It can be somewhat mind-bending at times. But, I think the complexity makes it that much more fun.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7950265263808507619.post-2087712644790766052008-03-17T19:44:00.000-07:002008-03-17T19:44:00.000-07:00If it was too difficult (or you are too lazy) to f...If it was too difficult (or you are too lazy) to find the connection, do the following.<BR/><BR/>Double click on Zeppo Marx, then double click on Barbara Blakely.<BR/><BR/>There you go.Droid116https://www.blogger.com/profile/05434806942584240318noreply@blogger.com