我发现了这个例子:here,其中使用了相关的有害标签并制作了图表。 但我不知道他们是如何实施的。 我不知道如何从欺骗性反应器中获取相关标签清单,因为在文件中根本没有提及,而是在错误的。 当你寻找一个标签时,就会发现右手上的相关标签。
是否有任何人知道如何利用APIC获得相关的标签?
谢谢。
我发现了这个例子:here,其中使用了相关的有害标签并制作了图表。 但我不知道他们是如何实施的。 我不知道如何从欺骗性反应器中获取相关标签清单,因为在文件中根本没有提及,而是在错误的。 当你寻找一个标签时,就会发现右手上的相关标签。
是否有任何人知道如何利用APIC获得相关的标签?
谢谢。
您不妨参阅Delicious保/a>。 http://www.delicious.com/help/api#tags_get”rel=“nofollow”具体章节,内容是插入标签。
不知道你使用什么语言(我没有看到你提供的联系中的任何例子;我承认,我 t太深),Im 介绍一些使用:
import urllib
u = urllib.FancyURLopener({})
f = u.open("https://api.del.icio.us/v1/tags/get")
tags = f.readlines()
for tag_line in tags:
print tag_line
关于该守则的说明:
警告——在开放HTTPS URLs时,它并不试图验证服务器证书。 在你们自己的风险下使用!
Do you know any strictly equivalent implementation of the PHP similar_text function in Java?
I have a bunch of objects of a class Puzzle. I have overridden equals() and hashCode(). When it comes time to present the solutions to the user, I d like to filter out all the Puzzles that are "...
I am rephrasing this question to make it a little more straightforward and easy to understand, hopefully. I have roughly 30 components (internal) that go into a single web application. That means 30 ...
I have a large collection of objects and I need to figure out the similarities between them. To be exact: given two objects I can compute their dissimilarity as a number, a metric - higher values ...
I am playing with the euclidian distance example from programming collective intelligence book, # Returns a distance-based similarity score for person1 and person2 def sim_distance(prefs,person1,...
i have built an index in Lucene. I want without specifying a query, just to get a score (cosine similarity or another distance?) between two documents in the index. For example i am getting from ...
lets say i have a set of users, a set of songs, and a set of votes on each song: =========== =========== ======= User Song Vote =========== =========== ======= user1 song1 [...
I m writing a program that will generate images. One measurement that I want is the amount of "self-similarity" in the image. I wrote the following code that looks for the countBest-th best matches ...