473,324 Members | 2,581 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,324 software developers and data experts.

50524 Mining the Web :Searches with Kriging, Inverse DistanceWeighting, eigenVectors and Cross-Pollination 50524

Site and Features: http://www.eigensearch.com

Search engine, eigenMethod, eigenvector, mathematical, manifolds, science, technical, search tools, eigenmath, Jacobian, quantum, mechanics, manifolds, science, physics, chemistry, law, legal, government, home, office, business, domain lookup, medical, travel, food, university students, searching, searchers, surfing, advanced search, search tools

Chemistry, mathematics, physical sciences, engineering, aerospace, astronomy, photography, news, computers, software, investment, venture capital, stakeholder, Biology, Chemistry, Geosciences, Biotechnology, Medical, Nursing, Anthropology, psychology, psychiatry, Philosophy, History, Business, bachelor, Ph.D., Masters, administrative, MBA, eigenMethod, eigenvector, mathematical, manifolds, science, technical, search tools, eigenmath, Jacobian, quantum, mechanics, manifolds, physics, chemistry, law, legal, health, government, home, office, business, domain, lookup, medical, travel, food, university, students, search, searches, search engine, directory, directories, category, categories, help, searching, searchers, surfing, advanced search, search help, search tips
Beta Users and advanced features Sign-up here... http://www.eigensearch.com/inc/const...betasignup.htm

Central to eigenSearch Advanced is the freedom to construct complex search explorations, save the forms for later use; and apply weight factor to each phrase and term. EigenSearch processing will apply eigenvector math and Jacobian matrices to construct search terms that are tailored to your exploration. Cross-pollination is also applied as described below. The eigenvector approach is clearly highly advanced and would normally be useful for very sophisticated applications. Nevertheless, anyone may utilize the method. An advanced form is simply a matrix in which the user types words and phrases randomly in a multi-cell form (please click thumbnail to view).

Advanced features

EigenOperator (cross pollination) and eigenvector constructs
Cross document content pollination within every web site directory tree (unlike conventional search engines and tools eigenSearch checks for your terms and phrases and drills down though multiple directory documents)
EigenSearch cross-pollination is applied to documents within the same (tree) level in a URL (peer documents). Thereby limiting the amount of contamination of results
Illustration:
"Blood Hounds" + "English Breed" will present documents that contain either of these phrases within the same peer level in a document storage structure; for example, within the directory: www.smartdogs/hounds.
eigenSearch limits pollinating occurrences outside a peer level. For example; "blood hounds" + "English breed" found in two different directories would not report an eigenSearch result: i.e. "Blood hounds" found in www.smartdogs/hounds and "English Breed" found in. www.smartdogs/hounds/Europe would not be found. EigenSearch therefore searches one tree (peer) level in a site and looks for multiple occurrences of multiple phrases across all documents within this peer level.
Corporate products can be tailored to drill down infinite levels for eigenOperator (cross-pollinating operator) matching.
eigenSearch single phrase results will find all documents and show the results as independent findings. This way the user can find results across many documents and the combined highly constrained results are reserved for a single level cross pollination.
Extremely high (cross-pollinating) eigenValues will correspond to finely granular and refined search explorations.

Beta users receive the following features:
Login and password
Save search constructs for later use in your own personal construct tables
EigenOperator (cross Pollinating Operator) advanced features as described above (eigenvector to follow)
Database (Table) upload and eigenvector computations
EigenSearch seeks 300,000 beta testers for its advanced eigenOperator based cognitive engine. This engine will allow for a multiplicity of search parameters for users to select so as to mathematically narrow results. The system will employ eigenVectors, eigenValues and eigenMatrices to determine relevance to user searches; thereby rendering high fidelity confirmed search results.
Naturally the computational power for doing such math is why beta testers are required. Each tester is welcome to comment on user friendliness, speed, change and ergonomic elegance. It is an eigenSearch goal to continue advancing the user interface so as to remain intuitively simple to use while at the same time providing hi-fidelity explorations.
All beta testers will receive a login and password, which provides entry into features for saving search constructs and parameters according to their own classification approach. Saved results and parameters can be used at any time and modified to alter search results. Beta users will be able to import their own data sets (2-dimentional) and perform an eigenValue analysis.



<r<p_
Nov 16 '05 #1
0 2029

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

6
by: David C. Fox | last post by:
Is there a function which takes a list of tuples and returns a list of lists made up of the first element of each tuple, the second element of each tuple, etc.? In other words, the the inverse...
1
by: Eugene Druker | last post by:
Hi all, I need eigen values and vectors for symmetric matrices (like VCV). Solving with numarray and testing the results, I've got strange results - input and output matrices of some sizes are...
5
by: Framework fan | last post by:
Hello, If I wrote the next ebay (yes I know, yawn-snore) and I had a database with 5 million auction items in it, what would be a really good strategy to get a search done very quickly? Would...
6
by: vishnu mahendra | last post by:
hello to all, can any one please give me an algorithm to find inverse of a matrix of order n rows and m columns. thank you in advance, vishnu.
0
by: http://www.visual-basic-data-mining.net/forum | last post by:
Looking for data mining algorithms like Naive Bayes, Neural Networks, Apriori, Genetic Algorithms, Clustering, Decision Trees, etc. implementations in VB.NET or C#.NET with Source Code. Can you...
0
by: http://www.visual-basic-data-mining.net/forum | last post by:
Looking for data mining algorithms like Naive Bayes, Neural Networks, Apriori, Genetic Algorithms, Clustering, Decision Trees source code implementations in Visual Basic.NET. Can you please post a...
4
by: Jonathan Fine | last post by:
Hello As part of the MathTran project I found myself wanting to maintain a bijection between long names and short names. http://www.open.ac.uk/mathtran In other words, I wanted to have two...
18
by: Jedora | last post by:
Hi all, I want to write a C program to compute eigenvalues and eigenvectors. But the matrix is a complex matrix which has all complex numbers. Like this: 5.8751 5.8774 + 1.5423i ...
9
by: okurt | last post by:
Hi everybody, I am looking for kriging program which is made by C++.If anybody knows or has it , please let me know as soon as possible. It's really important for me! Thank you in advance!
11
by: Simon van Beek | last post by:
Dear reader, By opening an application I get always the main Access window with the closing cross in the above right corner. Is there a possibility to make this closing cross invisible? ...
0
by: ryjfgjl | last post by:
ExcelToDatabase: batch import excel into database automatically...
0
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
0
by: jfyes | last post by:
As a hardware engineer, after seeing that CEIWEI recently released a new tool for Modbus RTU Over TCP/UDP filtering and monitoring, I actively went to its official website to take a look. It turned...
1
by: PapaRatzi | last post by:
Hello, I am teaching myself MS Access forms design and Visual Basic. I've created a table to capture a list of Top 30 singles and forms to capture new entries. The final step is a form (unbound)...
1
by: Defcon1945 | last post by:
I'm trying to learn Python using Pycharm but import shutil doesn't work
1
by: Shællîpôpï 09 | last post by:
If u are using a keypad phone, how do u turn on JavaScript, to access features like WhatsApp, Facebook, Instagram....
0
by: af34tf | last post by:
Hi Guys, I have a domain whose name is BytesLimited.com, and I want to sell it. Does anyone know about platforms that allow me to list my domain in auction for free. Thank you
0
by: Faith0G | last post by:
I am starting a new it consulting business and it's been a while since I setup a new website. Is wordpress still the best web based software for hosting a 5 page website? The webpages will be...
0
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 3 Apr 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome former...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.