Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)最新文献

筛选
英文 中文
Generic process for extracting user profiles from social media using hierarchical knowledge bases 使用分层知识库从社交媒体中提取用户配置文件的通用过程
Gregor Große-Bölting, Chifumi Nishioka, A. Scherp
{"title":"Generic process for extracting user profiles from social media using hierarchical knowledge bases","authors":"Gregor Große-Bölting, Chifumi Nishioka, A. Scherp","doi":"10.1109/ICOSC.2015.7050806","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050806","url":null,"abstract":"We present the design and application of a generic approach for semantic extraction of professional interests from social media using a hierarchical knowledge-base and spreading activation theory. By this, we can assess to which extend a user's social media life reflects his or her professional life. Detecting named entities related to professional interests is conducted by a taxonomy of terms in a particular domain. It can be assumed that one can freely obtain such a taxonomy for many professional fields including computer science, social sciences, economics, agriculture, medicine, and so on. In our experiments, we consider the domain of computer science and extract professional interests from a user's Twitter stream. We compare different spreading activation functions and metrics to assess the performance of the obtained results against evaluation data obtained from the professional publications of the Twitter users. Besides selected existing activation functions from the literature, we also introduce a new spreading activation function that normalizes the activation w.r.t. to the outdegree of the concepts.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130361855","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}
引用次数: 10
cDNA microarray image segmentation with an improved moving k-means clustering method 基于改进移动k均值聚类方法的cDNA芯片图像分割
G. Shao, Shunxiang Wu, Tiejun Li
{"title":"cDNA microarray image segmentation with an improved moving k-means clustering method","authors":"G. Shao, Shunxiang Wu, Tiejun Li","doi":"10.1109/ICOSC.2015.7050824","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050824","url":null,"abstract":"Different clustering based strategies have been proposed to increase the performance of image segmentation. However, due to complexity of chip preparing process, the real microarray image will contain artifacts, noises, and spots with different shapes, which result in these segmentation algorithms can't meet the satisfactory results. To overcome those drawbacks, this paper proposed an improved k-means clustering based algorithm to improve the segmentation accuracy rate. Firstly, an automatic contrast enhancement method is introduced to improve the image quality. Secondly, the maximum between-class variance gridding is conducted to separate the spots into sole areas. Then, we combine the k-means clustering algorithm with the moving k-means clustering method to gain a higher segmentation precision. In addition, an adjustable circle means is used for missing spots segmentation. Finally, intensive experiments are conducted on GEO and SMD data set. The results shows that the method presented in this paper is more accurate and robustness.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134112593","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}
引用次数: 5
Linked crowdsourced data - Enabling location analytics in the linking open data cloud 链接的众包数据——在链接的开放数据云中启用位置分析
A. Uzun
{"title":"Linked crowdsourced data - Enabling location analytics in the linking open data cloud","authors":"A. Uzun","doi":"10.1109/ICOSC.2015.7050776","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050776","url":null,"abstract":"Geospatial datasets in the Linking Open Data (LOD) Cloud are rather of static nature and mainly consist of information such as a name, geo coordinates, an address, or opening hours. There is no linked dataset providing dynamic information about the “popularity” of certain places or the “Visiting frequency” of users in specific contextual situations. This type of information within the LOD Cloud, however, would enable a variety of new applications based on semantically enriched location analytics. In this paper, we present Linked Crowdsourced Data as a dataset, which links real user location preferences (e.g., check-ins, ratings, or comments) as well as specific context situations (e.g., weather conditions, holiday information, or measured networks) collected via crowdsourcing to static location data. We showcase the applicability of this dataset for location analytics use cases through a map visualization and highlight its added value with exemplary SPARQL queries that allow for location requests depending on historic context information.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127586265","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}
引用次数: 1
Advertising slogan generation system reflecting user preference on the web 反映网络用户偏好的广告语生成系统
Hiroaki Yamane, M. Hagiwara
{"title":"Advertising slogan generation system reflecting user preference on the web","authors":"Hiroaki Yamane, M. Hagiwara","doi":"10.1109/ICOSC.2015.7050834","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050834","url":null,"abstract":"Increased demand for Web advertising has resulted in a corresponding increase in the need to develop online personalized advertisements. This paper proposes an advertising-slogan generation system reflecting Web-user preferences. Using a social networking service (SNS) site as the knowledge base for word preferences, and by employing an advertising slogan corpus, the proposed system aims to generate slogans that reflect advertising posts on an SNS. Using model slogans selected from a corpus containing 24,472 slogans, the proposed system generates slogan candidates using the knowledge obtained from a post on an SNS. These slogan candidates are selected based on the following three indexes: the natural level given by a large-scale balanced corpus, a semantic-relations score using advertising slogans, and the preference level obtained from SNS sites. In particular, the proposed system extracts preference data from these SNS fan pages and estimates the preference level on each word based on a bag-of-words model. This enables the proposed system to select slogans in a timely fashion. The authors conducted a subjective experiment to examine the quality of the generated slogans. The results show that (1) the natural and semantic-relation levels are effective for selecting slogans that reflect a post, and (2) the preference-level index contributes to the selection of preferred slogans that are interesting to users.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126801528","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}
引用次数: 1
Partitioning of ontologies driven by a structure-based approach 由基于结构的方法驱动的本体划分
F. Amato, Aniello De Santo, V. Moscato, Fabio Persia, A. Picariello, S. Poccia
{"title":"Partitioning of ontologies driven by a structure-based approach","authors":"F. Amato, Aniello De Santo, V. Moscato, Fabio Persia, A. Picariello, S. Poccia","doi":"10.1109/icosc.2015.7050827","DOIUrl":"https://doi.org/10.1109/icosc.2015.7050827","url":null,"abstract":"In this paper, we propose a novel structure-based partitioning algorithm able to break a large ontology into different modules related to specific topics for the domain of interest. In particular, we leverage the topological properties of the ontology graph and exploit several techniques derived from Network Analysis to produce an effective partitioning without considering any information about semantics of ontology relationships. An automated partitioning tool has been developed and several preliminary experiments have been conducted to validate the effectiveness of our approach with respect to other techniques.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126203847","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}
引用次数: 19
Schema adaptive modeling and incremental matching for web interface web界面模式自适应建模与增量匹配
Heng Chen, Hai Jin, Feng Zhao, Lei Zhu
{"title":"Schema adaptive modeling and incremental matching for web interface","authors":"Heng Chen, Hai Jin, Feng Zhao, Lei Zhu","doi":"10.1109/ICOSC.2015.7050804","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050804","url":null,"abstract":"There are so many web data hidden behind so-called deep web and can only be accessed through query interfaces, and the data volume is increasing. We often need to fill forms over alternative interfaces in the same domain to select the best product or service, such as buying a book across various online book websites to choose the most affordable one. Integrating these web interfaces in the same domain to an uniform interface is as a matter of course. One of the most important things for interface integration is interface schema matching. In this paper, we present a new structure and a corresponding algorithm for web interface schema modeling and matching. Using the new schema structure, we could not only easily handle two interfaces schema matching, but also handle incremental schema matching between an existing integrated interface and a new interface. We present a detailed experimental evaluation using UIUC Web Integration Repository dataset. The results show that our approach is effective: it obtains significantly higher accuracy for two schema matching and is more robust than previous techniques. For incremental schema matching, it also performs well.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121029879","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}
引用次数: 1
Weighted finite automata based on local patterns for image authentication 基于局部模式的图像认证加权有限自动机
U. Raju, Shibin George, Irlanki Sandeep, Kothuri Sai Kiran
{"title":"Weighted finite automata based on local patterns for image authentication","authors":"U. Raju, Shibin George, Irlanki Sandeep, Kothuri Sai Kiran","doi":"10.1109/ICOSC.2015.7050797","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050797","url":null,"abstract":"This paper presents an efficient image authentication system. The authentication signature is extracted from WFA encoding of the image. For noises that are more textural rather than color-based, we transform the image using a Local-Binary-Pattern filter, which is then converted to automata. We present a technique that incorporates the weights of the WFA, unlike previous works.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127095507","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}
引用次数: 2
Semantic description, discovery and integration for the Internet of Things 物联网的语义描述、发现和集成
Sejin Chun, Seungmin Seo, Byungkook Oh, Kyong-Ho Lee
{"title":"Semantic description, discovery and integration for the Internet of Things","authors":"Sejin Chun, Seungmin Seo, Byungkook Oh, Kyong-Ho Lee","doi":"10.1109/ICOSC.2015.7050819","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050819","url":null,"abstract":"To share and publish the domain knowledge of IoT objects, the development of a semantic IoT model based directory system that manages meta-data and relationships of IoT objects is required. Many researches focus on static relationships between IoT objects. However, because complex relationships between various resources change with time in an IoT environment, an efficient method for updating the meta-data is required. Thus, we propose an IoT-DS as the IoT directory that supports semantic description, discovery, and integration of IoT objects. Firstly, we introduce a semantic IoT component model to establish a shared conceptualization. Secondly, we present general cases of relationships to efficiently interact between IoT-DS and IoT objects. Thirdly, we construct IoT-DS as a Web portal. Finally, we verify in our evaluation study that the query processing time and communication workload imposed by the proposed approach are reduced.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130803130","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}
引用次数: 43
Cascade object detection with complementary features and algorithms 具有互补特征和算法的级联目标检测
De Cheng, Jinjun Wang, Xing Wei, Nan Liu, Shizhou Zhang, Yihong Gong, N. Zheng
{"title":"Cascade object detection with complementary features and algorithms","authors":"De Cheng, Jinjun Wang, Xing Wei, Nan Liu, Shizhou Zhang, Yihong Gong, N. Zheng","doi":"10.1109/ICOSC.2015.7050775","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050775","url":null,"abstract":"This paper presents a novel method of combining the object detection algorithms and the methods used for image classification aiming to further boosting the object detection performance. Since the algorithm and image features which used in the image classification tasks have not been well transplanted into the object detection method, most of the reason is that the feature used in the image classification is extracted from the whole image which have no space information. In our framework, firstly we use the detection model to propose the candidate windows; in the second stage the candidate windows will act as the whole image to be classified. Intuitively, the first stage should have high recall, while the second stage should have high precision. In our proposed detection framework, a SVM model was trained to combine the scores computed from both stages. The proposed framework can be generally used, while in our experiments we used the LSVM as the object detector in the first stage and the mostly used deep convolutional neural network classifier in the second stage. Finally, a combined model shows that the object detection performance can be further boosted under this framework in our experiments.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130887646","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}
引用次数: 0
NNB: An efficient nearest neighbor search method for hierarchical clustering on large datasets NNB:一种高效的大数据集分层聚类的最近邻搜索方法
Wei Zhang, Gongxuan Zhang, Yongli Wang, Zhaomeng Zhu, Tao Li
{"title":"NNB: An efficient nearest neighbor search method for hierarchical clustering on large datasets","authors":"Wei Zhang, Gongxuan Zhang, Yongli Wang, Zhaomeng Zhu, Tao Li","doi":"10.1109/ICOSC.2015.7050840","DOIUrl":"https://doi.org/10.1109/ICOSC.2015.7050840","url":null,"abstract":"Nearest neighbor search is a key technique used in hierarchical clustering. The time complexity of standard agglomerative hierarchical clustering is O(n3), while the time complexity of more advanced hierarchical clustering algorithms (such as nearest neighbor chain) is O(n2). This paper presents a new nearest neighbor search method called nearest neighbor boundary(NNB), which first divides a large dataset into independent subsets and then finds nearest neighbor of each point in the subsets. When NNB is used, the time complexity of hierarchical clustering can be reduced to O(n log2n). Based on NNB, we propose a fast hierarchical clustering algorithm called nearest-neighbor boundary clustering(NBC), and the proposed algorithm can also be adapted to the parallel and distributed computing frameworks. The experimental results demonstrate that our proposal algorithm is practical for large datasets.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114335485","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}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信