{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:57Z","timestamp":1750221117785,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T00:00:00Z","timestamp":1544745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,12,14]]},"DOI":"10.1145\/3301326.3301342","type":"proceedings-article","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T17:16:26Z","timestamp":1552583786000},"page":"87-91","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["DRDLC"],"prefix":"10.1145","author":[{"given":"R. S.","family":"Ramya","sequence":"first","affiliation":[{"name":"University Visvesvaraya College of Engineering, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ganesh Singh","family":"T.","sequence":"additional","affiliation":[{"name":"University Visvesvaraya College of Engineering, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Sejal","sequence":"additional","affiliation":[{"name":"University Visvesvaraya College of Engineering, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. R.","family":"Venugopal","sequence":"additional","affiliation":[{"name":"University Visvesvaraya College of Engineering, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Iyengar","sequence":"additional","affiliation":[{"name":"Florida International University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. M.","family":"Patnaik","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Soft Computing for Data Mining Applications,\" Springer","author":"Venugopal K. R.","year":"2009","unstructured":"K. R. Venugopal , K. Srinivasa , and L. M. Patnaik , \" Soft Computing for Data Mining Applications,\" Springer , 2009 . K. R. Venugopal, K. Srinivasa, and L. M. Patnaik, \"Soft Computing for Data Mining Applications,\" Springer, 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICISIP.2005.1619409"},{"issue":"5","key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Feature Extraction and Duplicate Detection for Text Mining: A Survey","volume":"16","author":"Ramya R. S.","year":"2017","unstructured":"R. S. Ramya , K. R. Venugopal , S. S. Iyengar , and L.M. Patnaik , \" Feature Extraction and Duplicate Detection for Text Mining: A Survey ,\" Global Journal of Computer Science and Technology , vol. 16 , no. 5 , pp. 1 -- 21 , 2017 . R. S. Ramya, K. R. Venugopal, S. S. Iyengar, and L.M. Patnaik, \"Feature Extraction and Duplicate Detection for Text Mining: A Survey,\" Global Journal of Computer Science and Technology, vol. 16, no. 5, pp. 1--21, 2017.","journal-title":"Global Journal of Computer Science and Technology"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.50"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/582987.785948"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/WI.2004.10132","article-title":"Automatic Pattern-Taxonomy Extraction for Web Mining","author":"Wu Sheng Tang","year":"2004","unstructured":"Sheng Tang Wu , Y. Li , Y. Xu , B. Pham , and P. Chen , \" Automatic Pattern-Taxonomy Extraction for Web Mining ,\" In Proceedings of IEEE\/WIC\/ACM International Conference on Web Intelligence , pp. 242 -- 248 , 2004 . Sheng Tang Wu, Y. Li, Y. Xu, B. Pham, and P. Chen, \"Automatic Pattern-Taxonomy Extraction for Web Mining,\" In Proceedings of IEEE\/WIC\/ACM International Conference on Web Intelligence, pp. 242--248, 2004.","journal-title":"Proceedings of IEEE\/WIC\/ACM International Conference on Web Intelligence"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835900"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.7763\/IJET.2010.V2.140"},{"key":"e_1_3_2_1_9_1","first-page":"418","article-title":"Slpminer: An Algorithm for Finding Frequent Sequential Patterns using Length-Decreasing Support Constraint","author":"Seno M.","year":"2002","unstructured":"M. Seno and G. Karypis , \" Slpminer: An Algorithm for Finding Frequent Sequential Patterns using Length-Decreasing Support Constraint ,\" In Proceedings of IEEE International Conference on Data Mining , pp. 418 -- 425 , 2002 . M. Seno and G. Karypis, \"Slpminer: An Algorithm for Finding Frequent Sequential Patterns using Length-Decreasing Support Constraint,\" In Proceedings of IEEE International Conference on Data Mining, pp. 418--425, 2002.","journal-title":"Proceedings of IEEE International Conference on Data Mining"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824795.1824798"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/599609.599626"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.211"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1344411.1344414"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(00)00016-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2373357"}],"event":{"name":"ICNCC 2018: 2018 VII International Conference on Network, Communication and Computing","acronym":"ICNCC 2018","location":"Taipei City Taiwan"},"container-title":["Proceedings of the 2018 VII International Conference on Network, Communication and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301326.3301342","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3301326.3301342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:05Z","timestamp":1750208525000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301326.3301342"}},"subtitle":["Discovering Relevant Documents Using Latent Dirichlet Allocation and Cosine Similarity"],"short-title":[],"issued":{"date-parts":[[2018,12,14]]},"references-count":15,"alternative-id":["10.1145\/3301326.3301342","10.1145\/3301326"],"URL":"https:\/\/doi.org\/10.1145\/3301326.3301342","relation":{},"subject":[],"published":{"date-parts":[[2018,12,14]]},"assertion":[{"value":"2018-12-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}