I need a Facebook Parser
- or -
Post a project like this$$
- Posted:
- Proposals: 0
- Remote
- #1876537
- Expired
Description
Experience Level: Intermediate
Hi, the parser Facebook is required. Purpose: parsing all Facebook.
Realization:
Facebook has rigid limits on almost all parsing, except parsing on type a name + the city.
We will also use it.
We specify the list by the city and the list of names. We parse everything that we are given out.
The algorithm will be approximately such:
There are cities of New York, Philadelphia
names: Mindi, John, Alice
The parser processes so:
Mindi + New York, John + New York, Alice + New York
Mindi + Philadelphia, John + Philadelphia, Alice + Philadelphia
It is required about 1 to streams. Possibly to use Amazon (as I understand, they for these purposes have servers)
ipv6 proxy.
Possibly, via the browser or his imitation. Though it is possible and through хттп to try inquiries.
Accounts, anyway, will fly to the ban so the registrar which will tighten accounts for the period of parsing is necessary.
Further all this is going to base. In which we can:
1) To use minus word on categories necessary to us. (for example, name and word "Lera". All people with a name of Ler, will leave)
2) Plus words on categories necessary to us. For example, name and word "Lera". All people with a name of Ler, will remain.
Filtration stage multistage. I.e. operations plus and minus of words can be used several times. As in a usual DB.
And also the rating on the most popular coincidence is required. I will give an example. We have a category Name. Software considers how many names coincide and build rating from the most large number to the most smaller.
If at us in the List:
Sergey Filatov
Sergey Yesenin
Alexander Pushkin
Software will build everything so:
Sergey - 2
Alexander 1
Categories:
1)! All! column Favorites (rating)
2) Education
3) City
4) name and surname
5) Favourite quotes (rating _)
6) Work (rating)
7) floor
Realization:
Facebook has rigid limits on almost all parsing, except parsing on type a name + the city.
We will also use it.
We specify the list by the city and the list of names. We parse everything that we are given out.
The algorithm will be approximately such:
There are cities of New York, Philadelphia
names: Mindi, John, Alice
The parser processes so:
Mindi + New York, John + New York, Alice + New York
Mindi + Philadelphia, John + Philadelphia, Alice + Philadelphia
It is required about 1 to streams. Possibly to use Amazon (as I understand, they for these purposes have servers)
ipv6 proxy.
Possibly, via the browser or his imitation. Though it is possible and through хттп to try inquiries.
Accounts, anyway, will fly to the ban so the registrar which will tighten accounts for the period of parsing is necessary.
Further all this is going to base. In which we can:
1) To use minus word on categories necessary to us. (for example, name and word "Lera". All people with a name of Ler, will leave)
2) Plus words on categories necessary to us. For example, name and word "Lera". All people with a name of Ler, will remain.
Filtration stage multistage. I.e. operations plus and minus of words can be used several times. As in a usual DB.
And also the rating on the most popular coincidence is required. I will give an example. We have a category Name. Software considers how many names coincide and build rating from the most large number to the most smaller.
If at us in the List:
Sergey Filatov
Sergey Yesenin
Alexander Pushkin
Software will build everything so:
Sergey - 2
Alexander 1
Categories:
1)! All! column Favorites (rating)
2) Education
3) City
4) name and surname
5) Favourite quotes (rating _)
6) Work (rating)
7) floor
Ronald W.
0% (0)Projects Completed
-
Freelancers worked with
-
Projects awarded
0%
Last project
23 Apr 2024
Russian Federation
New Proposal
Login to your account and send a proposal now to get this project.
Log inClarification Board Ask a Question
-
There are no clarification messages.
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