{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:12:22Z","timestamp":1654121542313},"reference-count":25,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7,1]]},"abstract":"<p>Identifying keyword associations from text and search sources is often used to facilitate many tasks such as understanding relationships among concepts, extracting relevant documents, matching advertisements to web pages, expanding user queries, etc. However, these keyword associations change continually change with time. In this paper, the authors define an equivalence relationship among keywords and develop methods to construct a temporal view of the equivalence relationship by constructing optimal temporal equivalence partitionings for keyword sets. They describe efficient algorithms to construct an optimal temporal equivalence partitioning for a keyword pair. They use the fact that the equivalence relationship is transitive to extend these algorithms to obtain an optimal temporal equivalence partitioning for a larger set of keywords. The authors show the effectiveness of the approach by constructing the temporal equivalence partitionings of several sets of keywords from the Multi-Domain Sentiment data set and the ICWS2009 Spinn3r data set.<\/p>","DOI":"10.4018\/ijkbo.2015070101","type":"journal-article","created":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T16:07:27Z","timestamp":1432051647000},"page":"1-18","source":"Crossref","is-referenced-by-count":0,"title":["Constructing Temporal Equivalence Partitionings for Keyword Sets"],"prefix":"10.4018","volume":"5","author":[{"given":"Parvathi","family":"Chundi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahadevan","family":"Subramaniam","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","reference":[{"key":"ijkbo.2015070101-0","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. International Conference on Very Large Data Bases, 487-499. Apriori Implementation, http:\/\/www2.cs.uregina.ca\/ hamilton\/courses\/831\/notes\/itemsets\/itemset prog1.html"},{"key":"ijkbo.2015070101-1","author":"R.Baeza-Yates","year":"2011","journal-title":"Modern information retrieval: The concepts and technology behind search"},{"key":"ijkbo.2015070101-2","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2010.50"},{"key":"ijkbo.2015070101-3","article-title":"The ICWSM 2009 Spinn3r data set.","author":"K.Burton","year":"2009","journal-title":"International AAAI Conference on Weblogs and Social Media"},{"key":"ijkbo.2015070101-4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.152"},{"key":"ijkbo.2015070101-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.03.009"},{"key":"ijkbo.2015070101-6","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0035-1"},{"key":"ijkbo.2015070101-7","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd. ed.). Cambridge, MA: MIT Press."},{"key":"ijkbo.2015070101-8","article-title":"Mining frequent patterns without candidate generation.","author":"J.Han","year":"2000","journal-title":"Proceedings of ACM International Conference on Management of Data"},{"key":"ijkbo.2015070101-9","doi-asserted-by":"publisher","DOI":"10.1108\/14684520810879827"},{"key":"ijkbo.2015070101-10","doi-asserted-by":"publisher","DOI":"10.1007\/11912873_4"},{"key":"ijkbo.2015070101-11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2006.23"},{"key":"ijkbo.2015070101-12","doi-asserted-by":"publisher","DOI":"10.1145\/1816123.1816135"},{"key":"ijkbo.2015070101-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15464-5_27"},{"key":"ijkbo.2015070101-14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15939-8_41"},{"key":"ijkbo.2015070101-15","first-page":"11","article-title":"Frequent itemset based hierarchical document clustering using Wikipedia as external knowledge.","author":"G. V. R.Kiran","year":"2010","journal-title":"International Conference on Knowledge-based and Intelligent Information and Engineering Systems"},{"key":"ijkbo.2015070101-16","author":"C. D.Manning","year":"1999","journal-title":"Foundations of statistical natural language processing"},{"key":"ijkbo.2015070101-17","unstructured":"Multi-Domain Sentiment Data Set (version 2.0), Available at http:\/\/www.cs.jhu.edu\/~mdredze\/datasets\/sentiment\/"},{"key":"ijkbo.2015070101-18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78646-7_59"},{"key":"ijkbo.2015070101-19","article-title":"Discovering word meanings based on frequent item sets.","author":"H.Rybinski","year":"2007","journal-title":"ECML\/PKDD Workshop on Mining Complex Data"},{"key":"ijkbo.2015070101-20","doi-asserted-by":"publisher","DOI":"10.1504\/IJWS.2013.056576"},{"key":"ijkbo.2015070101-21","first-page":"58","article-title":"Event detection and tracking in social streams.","author":"H.Sayyadi","year":"2009","journal-title":"International Conference on Weblogs and Social Media"},{"key":"ijkbo.2015070101-22","doi-asserted-by":"publisher","DOI":"10.1504\/IJDMMM.2013.053694"},{"key":"ijkbo.2015070101-23","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132957"},{"key":"ijkbo.2015070101-24","first-page":"1231","article-title":"Studying how the past is remembered: Towards computational history through large scale text mining.","author":"C. A.Yeung","year":"2011","journal-title":"ACM International Conference on Information and Knowledge Management"}],"container-title":["International Journal of Knowledge-Based Organizations"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=129071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:56:04Z","timestamp":1654120564000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijkbo.2015070101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijkbo.2015070101","relation":{},"ISSN":["2155-6393","2155-6407"],"issn-type":[{"value":"2155-6393","type":"print"},{"value":"2155-6407","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}