{"title":"Adaptively Approximate Techniques in Distributed Architectures","authors":"B. Catania, G. Guerrini","doi":"10.1007/978-3-662-46078-8_7","DOIUrl":"https://doi.org/10.1007/978-3-662-46078-8_7","url":null,"abstract":"","PeriodicalId":345875,"journal":{"name":"Spring Young Researchers Colloquium on Databases and Information Systems","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114816015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Use of Multiple Features for Extracting Topics from News Clusters","authors":"A. Alekseev, Natalia V. Loukachevitch","doi":"10.15514/ISPRAS-2012-23-15","DOIUrl":"https://doi.org/10.15514/ISPRAS-2012-23-15","url":null,"abstract":"Annotation. In this paper we consider a method for extraction of alternative names of a concept or a named entity mentioned in a news cluster. The method is based on the structural organization of news clusters and exploits comparison of various contexts of words. The word contexts are used as basis for multiword expression extraction and main entity detection. At the end of cluster processing we obtain groups of near-synonyms, in which the main synonym of a group is determined.","PeriodicalId":345875,"journal":{"name":"Spring Young Researchers Colloquium on Databases and Information Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121404380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. Chernishev, K. Smirnov, Pavel Fedotovsky, G. Erokhin, Kirill Cherednik
{"title":"To Sort or not to Sort: The Evaluation of R-Tree and B + -Tree in Transactional Environment with Ordered Result Set Requirement.","authors":"G. Chernishev, K. Smirnov, Pavel Fedotovsky, G. Erokhin, Kirill Cherednik","doi":"10.15514/ISPRAS-2014-26(4)-6","DOIUrl":"https://doi.org/10.15514/ISPRAS-2014-26(4)-6","url":null,"abstract":"In this paper we consider multidimensional indexing with the additional constraint of lexicographical ordering. In order to deal with this problem we discuss two well-known tree data structures: R-tree and B-tree. We study the problem in the transactional environment with read committed isolation level. To evaluate these approaches we had implemented these structures (modified GiST ensures concurrency) and provide extensive experiments.","PeriodicalId":345875,"journal":{"name":"Spring Young Researchers Colloquium on Databases and Information Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126144626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automatic recognition of domain-specific terms: an experimental evaluation","authors":"D. Fedorenko, N. Astrakhantsev, D. Turdakov","doi":"10.15514/ISPRAS-2014-26(4)-5","DOIUrl":"https://doi.org/10.15514/ISPRAS-2014-26(4)-5","url":null,"abstract":"This paper presents an experimental evaluation of the state-of-the-art approaches for automatic term recognition based on multiple features: machine learning method and voting algorithm. We show that in most cases machine learning approach obtains the best results and needs little data for training; we also find the best subsets of all popular features.","PeriodicalId":345875,"journal":{"name":"Spring Young Researchers Colloquium on Databases and Information Systems","volume":" 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132159702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}