{"id":"https://openalex.org/W334430741","doi":"https://doi.org/10.4018/ijkbo.2015070101","title":"Constructing Temporal Equivalence Partitionings for Keyword Sets","display_name":"Constructing Temporal Equivalence Partitionings for Keyword Sets","publication_year":2015,"publication_date":"2015-05-19","ids":{"openalex":"https://openalex.org/W334430741","doi":"https://doi.org/10.4018/ijkbo.2015070101","mag":"334430741"},"language":"en","primary_location":{"id":"doi:10.4018/ijkbo.2015070101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijkbo.2015070101","pdf_url":null,"source":{"id":"https://openalex.org/S4210171617","display_name":"International Journal of Knowledge-Based Organizations","issn_l":"2155-6393","issn":["2155-6393","2155-6407"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Knowledge-Based Organizations","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043942607","display_name":"Parvathi Chundi","orcid":null},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Parvathi Chundi","raw_affiliation_strings":["Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112241016","display_name":"Mahadevan Subramaniam","orcid":null},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahadevan Subramaniam","raw_affiliation_strings":["Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043942607"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00641162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"3","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9998999834060669,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9998999834060669,"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/T13083","display_name":"Advanced Text Analysis Techniques","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.8178360462188721},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.8105347156524658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6761583685874939},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6110830307006836},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5288872718811035},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.4638599753379822},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45763352513313293},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3905026316642761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24118316173553467},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08582699298858643}],"concepts":[{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.8178360462188721},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.8105347156524658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6761583685874939},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6110830307006836},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5288872718811035},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.4638599753379822},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45763352513313293},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3905026316642761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24118316173553467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08582699298858643},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijkbo.2015070101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijkbo.2015070101","pdf_url":null,"source":{"id":"https://openalex.org/S4210171617","display_name":"International Journal of Knowledge-Based Organizations","issn_l":"2155-6393","issn":["2155-6393","2155-6407"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Knowledge-Based Organizations","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jkbo00:v:5:y:2015:i:3:p:1-18","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijkbo.2015070101","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W165525898","https://openalex.org/W1483313504","https://openalex.org/W1486587593","https://openalex.org/W1497233514","https://openalex.org/W1506285740","https://openalex.org/W1507039213","https://openalex.org/W1526490331","https://openalex.org/W1574901103","https://openalex.org/W1599532270","https://openalex.org/W1969729883","https://openalex.org/W2010119160","https://openalex.org/W2017569274","https://openalex.org/W2031131051","https://openalex.org/W2038360085","https://openalex.org/W2064853889","https://openalex.org/W2095427323","https://openalex.org/W2118819772","https://openalex.org/W2127743235","https://openalex.org/W2134150392","https://openalex.org/W2137426349","https://openalex.org/W2152991815","https://openalex.org/W2167291765","https://openalex.org/W2421105961","https://openalex.org/W4241183394"],"related_works":["https://openalex.org/W4312527695","https://openalex.org/W2361167282","https://openalex.org/W1528932152","https://openalex.org/W2091342995","https://openalex.org/W1677394555","https://openalex.org/W3007067598","https://openalex.org/W2366107444","https://openalex.org/W2359420171","https://openalex.org/W2271118953","https://openalex.org/W2006385248"],"abstract_inverted_index":{"Identifying":[0],"keyword":[1,35,72,87],"associations":[2,36],"from":[3,135],"text":[4],"and":[5,53,141],"search":[6],"sources":[7],"is":[8,97],"often":[9],"used":[10],"to":[11,26,56,78,99,103],"facilitate":[12],"many":[13],"tasks":[14],"such":[15],"as":[16],"understanding":[17],"relationships":[18],"among":[19,51],"concepts,":[20],"extracting":[21],"relevant":[22],"documents,":[23],"matching":[24],"advertisements":[25],"web":[27],"pages,":[28],"expanding":[29],"user":[30],"queries,":[31],"etc.":[32],"However,":[33],"these":[34,101],"change":[37,39],"continually":[38],"with":[40],"time.":[41],"In":[42],"this":[43],"paper,":[44],"the":[45,62,91,94,119,122,126,136,142],"authors":[46,117],"define":[47],"an":[48,80,105],"equivalence":[49,63,69,83,95,108,128],"relationship":[50,64,96],"keywords":[52,134],"develop":[54],"methods":[55],"construct":[57,79],"a":[58,86,111],"temporal":[59,68,82,107,127],"view":[60],"of":[61,114,121,130,133],"by":[65,124],"constructing":[66,125],"optimal":[67,81,106],"partitionings":[70,129],"for":[71,85,110],"sets.":[73],"They":[74,89],"describe":[75],"efficient":[76],"algorithms":[77,102],"partitioning":[84,109],"pair.":[88],"use":[90],"fact":[92],"that":[93],"transitive":[98],"extend":[100],"obtain":[104],"larger":[112],"set":[113,140],"keywords.":[115],"The":[116],"show":[118],"effectiveness":[120],"approach":[123],"several":[131],"sets":[132],"Multi-Domain":[137],"Sentiment":[138],"data":[139,145],"ICWS2009":[143],"Spinn3r":[144],"set.":[146]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}