Related Tags - Algorithm by tags

No algorithm description given

Takes as input a mapping from each object to its tags, and a set of starting tags to generate recommendations for. {"object" -> ["tagA", "tagB"]}, ["tag1", "tag2"] This algorithm models the tags as a bipartite graph, and uses collaborative filtering to recommend new tags. This can be useful when paired with automatic tag generation, as it allows for generating new tags that don't necessarily appear in the auto-tagged documents, but may still be related.

Tags

(no tags)

Cost Breakdown

0 cr

royalty per call

1 cr

usage per second

avg duration

Cost Calculator

API call duration (sec)

API calls

Estimated cost

per calls

for large volume discounts

For additional details on how pricing works, see Algorithmia pricing.

Internet access

This algorithm has Internet access. This is necessary for algorithms that rely on external services, however it also implies that this algorithm is able to send your input data outside of the Algorithmia platform.

To understand more about how algorithm permissions work, see the permissions documentation.

1. Type your input

2. See the result

Running algorithm...

curl -X POST -d '{{input | formatInput:"curl"}}' -H 'Content-Type: application/json' -H 'Authorization: Simple YOUR_API_KEY' https://api.algorithmia.com/v1/algo/tags/RelatedTags/0.1.1

View cURL Docs

algo auth
# Enter API Key: YOUR_API_KEY
algo run algo://tags/RelatedTags/0.1.1 -d '{{input | formatInput:"cli"}}'

View CLI Docs

import (
  algorithmia "github.com/algorithmiaio/algorithmia-go"
)

input := {{input | formatInput:"go"}}

var client = algorithmia.NewClient("YOUR_API_KEY", "")
algo, _ := client.Algo("algo://tags/RelatedTags/0.1.1")
resp, _ := algo.Pipe(input)
response := resp.(*algorithmia.AlgoResponse)
fmt.Println(response.Result)

View Go Docs

import com.algorithmia.*;
import com.algorithmia.algo.*;

String input = "{{input | formatInput:"java"}}";
AlgorithmiaClient client = Algorithmia.client("YOUR_API_KEY");
Algorithm algo = client.algo("algo://tags/RelatedTags/0.1.1");
AlgoResponse result = algo.pipeJson(input);
System.out.println(result.asJsonString());

View Java Docs

import com.algorithmia._
import com.algorithmia.algo._

val input = {{input | formatInput:"scala"}}
val client = Algorithmia.client("YOUR_API_KEY")
val algo = client.algo("algo://tags/RelatedTags/0.1.1")
val result = algo.pipeJson(input)
System.out.println(result.asJsonString)

View Scala Docs

var input = {{input | formatInput:"javascript"}};
Algorithmia.client("YOUR_API_KEY")
           .algo("algo://tags/RelatedTags/0.1.1")
           .pipe(input)
           .then(function(output) {
             console.log(output);
           });

View Javascript Docs

var input = {{input | formatInput:"javascript"}};
Algorithmia.client("YOUR_API_KEY")
           .algo("algo://tags/RelatedTags/0.1.1")
           .pipe(input)
           .then(function(response) {
             console.log(response.get());
           });

View NodeJS Docs

import Algorithmia

input = {{input | formatInput:"python"}}
client = Algorithmia.client('YOUR_API_KEY')
algo = client.algo('tags/RelatedTags/0.1.1')
print algo.pipe(input)

View Python Docs

library(algorithmia)

input <- {{input | formatInput:"r"}}
client <- getAlgorithmiaClient("YOUR_API_KEY")
algo <- client$algo("tags/RelatedTags/0.1.1")
result <- algo$pipe(input)$result
print(result)

View R Docs

require 'algorithmia'

input = {{input | formatInput:"ruby"}}
client = Algorithmia.client('YOUR_API_KEY')
algo = client.algo('tags/RelatedTags/0.1.1')
puts algo.pipe(input).result

View Ruby Docs

use algorithmia::Algorithmia;

let input = {{input | formatInput:"rust"}};
let client = Algorithmia::client("YOUR_API_KEY");
let algo = client.algo("tags/RelatedTags/0.1.1");
let response = algo.pipe(input);

View Rust Docs

import Algorithmia

let input = "{{input | formatInput:"swift"}}";
let client = Algorithmia.client(simpleKey: "YOUR_API_KEY")
let algo = client.algo(algoUri: "tags/RelatedTags/0.1.1") { resp, error in
  print(resp)
}

View Swift Docs

Discussion