{"id":"https://openalex.org/keywords/gspan","display_name":"gSpan","description":"A graph-mining algorithm that discovers frequent subgraphs by growing patterns while avoiding duplicate candidates.","display_name_alternatives":["graph-based substructure pattern mining"],"ids":{"openalex":"https://openalex.org/keywords/gspan","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.4147,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.4147,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.2507,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":126,"cited_by_count":4754,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/gspan","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
