Search for project
More than 2000 projects issued through our platform and this
amount increases very fast.
Near Duplicate, Document Clustering, Concept Search (ID:3878)
| Project Creator: |
todd416
FC Member For 6225 Days
Credits 20 Completed Proj. Num. 0 / 1 Total payment USD Avg Daily Online 0.00 h (From 21/5/2007) Available on MSN/Skype No Last Login 2/21/2008 Peers Rating 0.00% 
|
|---|---|
| Budget: | More than 2500 |
| Created: | 2/9/2008 11:10:55 AM EST |
| Bidding Ends: | 3/10/2008 11:10:55 AM EST ( Expired ) |
| Development Cycle: | N/A Days |
| Bid Count: | 4
|
| Average Bid: | 2,865.00 |
| Project Description:
This project requires an understanding of Near Duplicate, Document Clustering and conceptual search algorithms. The project will have a fixed fee for the Near Duplicate part, you may also bid on the other parts document clustering and automatic conceptual search. If you wish to be considered for this project or any part thereof you must prove that you understand this are of computer science, if your math or linguaistic skills are not up to par you will not be conisdered. DO NOT ASK ME CONTACT YOU OFFLINE TO BID, DO NOT ASK FOR A DEPOSIT VIA SOME WIRE TRANSFER ETC. ALL INTERACTION WILL OCCUR THROUGH THIS SITE! PLEASE READ: Lets not waste each others time, if this is the first time you have ever heard of these concepts then please do not bid these are complex problems that require a good undestanding of math and the research already done at the university level. I will only consider candidates who 1. Explain explicitly (not code or engineering but at least an algorithmic approach) how they would generally go about implementing each problem. 2. A estimate of how much time each problem would take (approxiamately) to endcode which cannot exceed x2 (if 100 hours then 200 hour limit) A1. Near Duplciate Detection Given any number of documents group the documents using the text so that a group would contain similar documents that met a minimum threshold of |
|
| Job Type | .NET, C/C++ |
| Attached Files: | N/A |
