Facebook parser
- or -
Post a project like this$1.0k
- Posted:
- Proposals: 3
- Remote
- #1873108
- OPPORTUNITY
- Expired
Description
Experience Level: Entry
General information for the business: facebook parser
Description of requirements/functionality: Facebook
requires a parser fb on the principle of friends of friends.
Those. go to the friends of the user, then to friends of friends, etc. collecting pages.
Work on a large number of threads.
Automatic pulling accounts, in the case of locks (they will)
Further all this is going to base. In which we can:
1) Use negative keywords for the categories we need. (for example, the name and the word "Lera." All people with the name Lera, will retire)
2) Plus words on the categories we need. For example, the name and the word "Lera". All people with the name of Lera will remain.
The stage of filtration is multistage. Those. operations plus and minus words can be used several times. As in the usual bd.
And also need a rating for the most popular matches. I will give an example. We have a category Name. Soft considers how many names match and builds a rating from the largest number to the lowest.
If at us in the List:
Sergey Filatov
Sergey Yesenin
Alexander Pushkin
Soft will build it this way:
Sergey - 2
Alexander 1
Categories:
1)! All! column Favorites (rating)
2) Education
3) City
4) name and surname
5) Favorite quotes (rating_)
6) Work (rating)
7) Gender
OS requirements: Windows, Linux
Extra notes:
Description of requirements/functionality: Facebook
requires a parser fb on the principle of friends of friends.
Those. go to the friends of the user, then to friends of friends, etc. collecting pages.
Work on a large number of threads.
Automatic pulling accounts, in the case of locks (they will)
Further all this is going to base. In which we can:
1) Use negative keywords for the categories we need. (for example, the name and the word "Lera." All people with the name Lera, will retire)
2) Plus words on the categories we need. For example, the name and the word "Lera". All people with the name of Lera will remain.
The stage of filtration is multistage. Those. operations plus and minus words can be used several times. As in the usual bd.
And also need a rating for the most popular matches. I will give an example. We have a category Name. Soft considers how many names match and builds a rating from the largest number to the lowest.
If at us in the List:
Sergey Filatov
Sergey Yesenin
Alexander Pushkin
Soft will build it this way:
Sergey - 2
Alexander 1
Categories:
1)! All! column Favorites (rating)
2) Education
3) City
4) name and surname
5) Favorite quotes (rating_)
6) Work (rating)
7) Gender
OS requirements: Windows, Linux
Extra notes:
Alex C.
0% (0)Projects Completed
-
Freelancers worked with
-
Projects awarded
0%
Last project
26 Apr 2024
Belarus
New Proposal
Login to your account and send a proposal now to get this project.
Log inClarification Board Ask a Question
-
This job seems very interesting however it is a little confusing. If you could please explain exactly what needs to be done for Facebook I would really appreciate it. Thank you.
-
i am interested in the job its not clear for me could u explain in easier way
580354580263
We collect cookies to enable the proper functioning and security of our website, and to enhance your experience. By clicking on 'Accept All Cookies', you consent to the use of these cookies. You can change your 'Cookies Settings' at any time. For more information, please read ourCookie Policy
Cookie Settings
Accept All Cookies