|
|
Addition of your link
IMPORTANT:
1. You first put the code of our link at your
site. Only in this case your link will be immediately
activated.
2. In the column You should indicate
the exact address of the page of your site, where there is a code of our link . If the address is indicated wrong, your link
will be deleted.
3. We don't exchange links with
domain of the third level (e.g.: http://nnn.mmm.com).
4. We don't exchange links with
sites, based on the free hostings. (e.g.: narod.ru, com.ru etc
.)
5. We don't exchange links with
sites, which have meta tags: noindex, nofollow in their code, or
hiding their bans against indexation in the file robots.txt.
6. We don't exchange links with
sites, which have no transfer to the catalogue of links from the main page of the site or
have indirect links to our sites.
7. We don't exchange links with
sites, which have PR of main page less than 1.
8. We constantly will check
indexation of your site in Yandex and Google.
9. We disapprove of exchange links
with sites - linkfarms. Linkfarms- it is, as a rule, a catalogue which have
more than 20 per page, or have no features of design of the main
site.
10. The link to your catalogue should be
at the main page of the site.
11. The address of the link should be constant and should not
change while addition of new links.
|
Text of our link
Mark Sanderson, Kalervo Järvelin, James Allan, Peter Bruza (Eds.): SIGIR 2004: Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Sheffield, UK, July 25-29, 2004. ACM 2004, ISBN 1-58113-881-4Using ODP Metadata to Personalize Search - By Paul Alexandru Chirita, Wolfgang Nejdl, Raluca Paiu and Christian Kohlschütter, L3S and University of Hannover, Germany. In: Proceedings of the 28th Annual International ACM SIGIR Conference, August 2005. The paper discusses how ODP metadata can be exploited to achieve high quality personalized web search.SIGIR: Information Retrieval - 'Addresses issues ranging from theory to user demands in the application of computers to the acquisition, organization, storage, retrieval, and distribution of information.'OCFS: Optimal Orthogonal Centroid Feature Selection for Text Categorization - By Jun Yan, Ning Liu, Benyu Zhang, Shuicheng Yan, Zheng Chen, Qiansheng Cheng, Weiguo Fan and Wei-Ying Ma. In: Proceedings of the 28th Annual International ACM SIGIR Conference, August 2005. Experiments based on 20 Newsgroups (20NG), Reuters Corpus Volume 1 (RCV1) and ODP data show that OCFS is a consistently better feature selection method than Information Gain (IG) and c 2-test (CHI).Improving Web Search Results Using Affinity Graph - By Benyu Zhang, Hua Li, Yi Liu, Lei Ji, Wensi Xi, Weiguo Fan, Zheng Chen and Wei-Ying Ma. In: Proceedings of the 28th Annual International ACM SIGIR Conference, August 2005. The authors propose a ranking scheme named Affinity Ranking (AR). Yahoo, ODP and newsgroup data are used for the experiments.
Code of our link
|
|
|
