Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449460
K. Shimazaki, T. Nagao
Semantic segmentation is a process that recognizes objects and their regions in images and is a significant challenge in image recognition. Many conventional methods have been proposed, and these studies are expected to be used for many applications such as image retrieval, robot vision for autonomous mobile robots, an automatic driving system for motor vehicles. However, semantic segmentation is one of the most difficult task because of the diversity and appearance of objects in images. This problem causes incorrect recognition not related to an image, or inconsistent with the spatial structure of the real world. We focus on understanding the scene in an image. For example, objects like “car” and “buildings” are likely to exist in the scene of street. On the other hand, those are not likely to exist in the scene of prairie. Besides, we expect that location and co-occurrence of objects are efficient information to recognize images. The region of “sky” is likely to exist in the upper part of them. In addition, “car” and “road” are likely to exist in the same image. This paper presents a method of semantic segmentation considering location and co-occurrence in the natural outdoor scene. Before recognizing objects in images, we classify them in terms of scene and execute pixel-wise object recognition. Then, we consider the location and co-occurrence of objects in the scene. Experimental results show that our proposed method is effective compared to other methods not considering scene information.
{"title":"Semantic segmentation considering location and co-occurrence in scene","authors":"K. Shimazaki, T. Nagao","doi":"10.1109/IWCIA.2015.7449460","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449460","url":null,"abstract":"Semantic segmentation is a process that recognizes objects and their regions in images and is a significant challenge in image recognition. Many conventional methods have been proposed, and these studies are expected to be used for many applications such as image retrieval, robot vision for autonomous mobile robots, an automatic driving system for motor vehicles. However, semantic segmentation is one of the most difficult task because of the diversity and appearance of objects in images. This problem causes incorrect recognition not related to an image, or inconsistent with the spatial structure of the real world. We focus on understanding the scene in an image. For example, objects like “car” and “buildings” are likely to exist in the scene of street. On the other hand, those are not likely to exist in the scene of prairie. Besides, we expect that location and co-occurrence of objects are efficient information to recognize images. The region of “sky” is likely to exist in the upper part of them. In addition, “car” and “road” are likely to exist in the same image. This paper presents a method of semantic segmentation considering location and co-occurrence in the natural outdoor scene. Before recognizing objects in images, we classify them in terms of scene and execute pixel-wise object recognition. Then, we consider the location and co-occurrence of objects in the scene. Experimental results show that our proposed method is effective compared to other methods not considering scene information.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125102402","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449466
Tatsuhiro Sakai, Keiichi Tamura, H. Kitakami
Geo-tagged documents on social media are usually related to local topics and events. Extracting areas of interest associated with local “attractive” topics from geo-tagged documents is one of the most important challenges in many application domains. In this paper, we propose a novel method for extracting the areas of interest from geo-tagged documents. There are two main steps in the proposed method. First, the (ε, σ)-density-based adaptive spatial clustering algorithm extracts areas where local topics are attracting attention as spatial clusters. Second, representative geo-tagged documents are detected to identify the main topic in each spatial cluster. The (ε, σ)-density-based adaptive spatial clustering algorithm changes the threshold for seamlessly extracting spatial clusters regardless of the local densities of the posted geo-tagged documents. Moreover, the proposed method utilizes the network-based important sentence extraction method in order to extract representative geo-tagged documents from each spatial cluster. The experimental results show that the proposed method can extract the areas of interest as spatial clusters and representative documents as main topics.
{"title":"Identifying main topics in density-based spatial clusters using network-based representative document extraction","authors":"Tatsuhiro Sakai, Keiichi Tamura, H. Kitakami","doi":"10.1109/IWCIA.2015.7449466","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449466","url":null,"abstract":"Geo-tagged documents on social media are usually related to local topics and events. Extracting areas of interest associated with local “attractive” topics from geo-tagged documents is one of the most important challenges in many application domains. In this paper, we propose a novel method for extracting the areas of interest from geo-tagged documents. There are two main steps in the proposed method. First, the (ε, σ)-density-based adaptive spatial clustering algorithm extracts areas where local topics are attracting attention as spatial clusters. Second, representative geo-tagged documents are detected to identify the main topic in each spatial cluster. The (ε, σ)-density-based adaptive spatial clustering algorithm changes the threshold for seamlessly extracting spatial clusters regardless of the local densities of the posted geo-tagged documents. Moreover, the proposed method utilizes the network-based important sentence extraction method in order to extract representative geo-tagged documents from each spatial cluster. The experimental results show that the proposed method can extract the areas of interest as spatial clusters and representative documents as main topics.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127122171","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449479
Shin Kamada, T. Ichimura, Takanobu Watanabe
The grant for the research gives the researcher the important opportunity to make fruitful research results. Recently, the notification of the government grants and some Foundation grants in the various fields informs the researchers through Internet. However, the notification provided through Internet includes ambiguous and complex. The researchers will fail to notice the grant information which he/she should submit the application form. The department of research support at the university should avoid to miss the researcher's opportunity. The support staff classifies the notifications into some categories related to the research fields and provides to the researchers the application form best matched to the researcher's current research field. We have developed recommendation system of Grant-in-Aid system for researchers by using JSPS (Japan Society for the Promotion of Science) keywords. The system can determine some rules associated between the characteristic keywords extracted from the website and the keywords from the researcher's current research field. The system recommends to the researcher the best matched application form. The researcher can surely know the information without failing to notice it by using the developed system.
{"title":"Recommendation system of Grants-in-Aid for researchers by using JSPS keyword","authors":"Shin Kamada, T. Ichimura, Takanobu Watanabe","doi":"10.1109/IWCIA.2015.7449479","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449479","url":null,"abstract":"The grant for the research gives the researcher the important opportunity to make fruitful research results. Recently, the notification of the government grants and some Foundation grants in the various fields informs the researchers through Internet. However, the notification provided through Internet includes ambiguous and complex. The researchers will fail to notice the grant information which he/she should submit the application form. The department of research support at the university should avoid to miss the researcher's opportunity. The support staff classifies the notifications into some categories related to the research fields and provides to the researchers the application form best matched to the researcher's current research field. We have developed recommendation system of Grant-in-Aid system for researchers by using JSPS (Japan Society for the Promotion of Science) keywords. The system can determine some rules associated between the characteristic keywords extracted from the website and the keywords from the researcher's current research field. The system recommends to the researcher the best matched application form. The researcher can surely know the information without failing to notice it by using the developed system.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130844654","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449463
Kumiko Motodoi, T. Tokuyasu, T. Kusano, M. Inomata, N. Shiraishi, S. Kitanou
At present, some training tools for endoscopic surgery have been commercialized such as box simulator and virtual training simulator. These training tools enable a trainee to practice various operation without any risks of a patient and have been utilized by unskilled surgeons in medical institutions. However, more effective training environments have been required by the doctors who engage in medical education. Then this study focuses on the importance of improving fundamental operation skills in an operating room. Because, most of human tissues, such as blood vessels, organs, and nerves, are easily bruised by surgical tools. Due to the structural particularity of endoscopic forceps makes us difficult to only move the tip of forceps on a straight line. Hence, this study suggests a haptic guide function that dynamically controls the position of forceps to the appropriate direction in the forceps operation. In this paper, the system structure and the control methods of forceps control devices are firstly described. The training effects of our proposed system will be discussed by reviewing the experimental results.
{"title":"Discussion about training effects of haptic guide function for endoscopic forceps operation","authors":"Kumiko Motodoi, T. Tokuyasu, T. Kusano, M. Inomata, N. Shiraishi, S. Kitanou","doi":"10.1109/IWCIA.2015.7449463","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449463","url":null,"abstract":"At present, some training tools for endoscopic surgery have been commercialized such as box simulator and virtual training simulator. These training tools enable a trainee to practice various operation without any risks of a patient and have been utilized by unskilled surgeons in medical institutions. However, more effective training environments have been required by the doctors who engage in medical education. Then this study focuses on the importance of improving fundamental operation skills in an operating room. Because, most of human tissues, such as blood vessels, organs, and nerves, are easily bruised by surgical tools. Due to the structural particularity of endoscopic forceps makes us difficult to only move the tip of forceps on a straight line. Hence, this study suggests a haptic guide function that dynamically controls the position of forceps to the appropriate direction in the forceps operation. In this paper, the system structure and the control methods of forceps control devices are firstly described. The training effects of our proposed system will be discussed by reviewing the experimental results.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"388 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113998328","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449484
Kentaro Uehara, Shinya Sekizaki, I. Nishizaki, Tomohiro Hayashida
Recently in Japan, a deregulation of electricity market is being extended and retailers are expected to supply the electricity to consumers. Moreover, an energy management system enables the consumers to easily manage their energy consumption according to the electricity prices. This means that a large number of decision makers who manages electricity energy will be in the electricity market. In order to operate stably the next generation power system, in which the structure of the system is complicated, it is necessary to appropriately design the market based on a detail market analysis with a mathematical model of the decision makers. Thus, to formulate a mathematical model that adequately represents the behavior of a large number of decision-makers in the power market is indispensable. From this background, we formulates a Stackelberg game model as the bilevel programming problem which represents the statistical decision making in a trade between the retailer and the consumers considering a forward contract and day-ahead market, real time trade. The computational experiment shows that the proposed decision making model can represents the behavior of the market players.
{"title":"A study for retailer's risk hedge considering responses of consumers in electricity deregulation","authors":"Kentaro Uehara, Shinya Sekizaki, I. Nishizaki, Tomohiro Hayashida","doi":"10.1109/IWCIA.2015.7449484","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449484","url":null,"abstract":"Recently in Japan, a deregulation of electricity market is being extended and retailers are expected to supply the electricity to consumers. Moreover, an energy management system enables the consumers to easily manage their energy consumption according to the electricity prices. This means that a large number of decision makers who manages electricity energy will be in the electricity market. In order to operate stably the next generation power system, in which the structure of the system is complicated, it is necessary to appropriately design the market based on a detail market analysis with a mathematical model of the decision makers. Thus, to formulate a mathematical model that adequately represents the behavior of a large number of decision-makers in the power market is indispensable. From this background, we formulates a Stackelberg game model as the bilevel programming problem which represents the statistical decision making in a trade between the retailer and the consumers considering a forward contract and day-ahead market, real time trade. The computational experiment shows that the proposed decision making model can represents the behavior of the market players.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114876854","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449465
Akira Hara, J. Kushida, Tomoya Okita, T. Takahama
In this paper, we focus on evolutionary optimization of multi-agent behavior. There are two representative models for multi-agent control, homogeneous and heterogeneous models. In the homogeneous model, all agents are controlled by the same controller. Therefore, it is difficult to realize complex cooperative behavior such as division of labors. In contrast, in the heterogeneous model, respective agents can play different roles for cooperative tasks. However, the search space becomes too large to optimize respective controllers. To solve the problems, we propose a new multi-agent control model based on Cartesian Genetic Programming (CGP). In CGP, each individual represents a graph-structural program and it can have multiple outputs. The feature is utilized for controlling multiple agents in our model. In addition, we propose a new genetic operator dedicated to multi-agent control. Our method enables multiple agents to not only take different actions according to their own roles but also share sub-programs if the same behavior is needed for solving problems. We applied our method to a food foraging problem. The experimental results showed that the performance of our method is superior to those of the conventional models.
{"title":"Behavior control of multiple agents by Cartesian Genetic Programming equipped with sharing sub-programs among agents","authors":"Akira Hara, J. Kushida, Tomoya Okita, T. Takahama","doi":"10.1109/IWCIA.2015.7449465","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449465","url":null,"abstract":"In this paper, we focus on evolutionary optimization of multi-agent behavior. There are two representative models for multi-agent control, homogeneous and heterogeneous models. In the homogeneous model, all agents are controlled by the same controller. Therefore, it is difficult to realize complex cooperative behavior such as division of labors. In contrast, in the heterogeneous model, respective agents can play different roles for cooperative tasks. However, the search space becomes too large to optimize respective controllers. To solve the problems, we propose a new multi-agent control model based on Cartesian Genetic Programming (CGP). In CGP, each individual represents a graph-structural program and it can have multiple outputs. The feature is utilized for controlling multiple agents in our model. In addition, we propose a new genetic operator dedicated to multi-agent control. Our method enables multiple agents to not only take different actions according to their own roles but also share sub-programs if the same behavior is needed for solving problems. We applied our method to a food foraging problem. The experimental results showed that the performance of our method is superior to those of the conventional models.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126309002","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449451
Shunsuke Kanda, M. Fuketa, K. Morita, J. Aoe
A trie is an ordered tree structure with a character on each edge. The trie provides efficient storing and retrieval of a keyword set in processing strings. The double-array has been proposed to provide fast retrieval in the trie. As its space usage depends on the number of trie nodes, the space usage decreases by reducing nodes. To reduce the number of trie nodes, an Minimal-Prefix (MP) trie and a double-trie have been proposed, and the double-array can represent these data structures efficiently. On the other hand, the data structures include many nodes that can be reduced by giving a string label to each edge. However, the double-array with string labels has not been proposed. This paper proposes a new double-array with string labels by using multiple arrays depending on label sizes. Moreover, we show its effectiveness by experiments.
{"title":"Trie compact representation using double-array structures with string labels","authors":"Shunsuke Kanda, M. Fuketa, K. Morita, J. Aoe","doi":"10.1109/IWCIA.2015.7449451","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449451","url":null,"abstract":"A trie is an ordered tree structure with a character on each edge. The trie provides efficient storing and retrieval of a keyword set in processing strings. The double-array has been proposed to provide fast retrieval in the trie. As its space usage depends on the number of trie nodes, the space usage decreases by reducing nodes. To reduce the number of trie nodes, an Minimal-Prefix (MP) trie and a double-trie have been proposed, and the double-array can represent these data structures efficiently. On the other hand, the data structures include many nodes that can be reduced by giving a string label to each edge. However, the double-array with string labels has not been proposed. This paper proposes a new double-array with string labels by using multiple arrays depending on label sizes. Moreover, we show its effectiveness by experiments.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229579","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449480
T. Ichimura, Takuya Uemoto
The social community in open source software developers has a complex network structure. The network structure represents the relations between the project and the engineer in the software developer's community. A project forms some teams which consist of engineers categorized into some task group. Source Forge is well known to be one of open source websites. The node and arc in the network structure means the engineer and their connection among engineers in the Source Forge. In the previous study, we found the growing process of project becomes strong according to the number of developers joining into the project. In the growing phase, we found some characteristic patterns between the number of agents and the produced projects. By such observations, we developed a simulation model of performing the growing process of project. In this paper, we introduced the altruism behavior as shown in the Army Ant model into the software developer's simulation model. The efficiency of the software developing process was investigated by some experimental simulation results.
{"title":"Analysis of the social community based on the network growing model in open source software community","authors":"T. Ichimura, Takuya Uemoto","doi":"10.1109/IWCIA.2015.7449480","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449480","url":null,"abstract":"The social community in open source software developers has a complex network structure. The network structure represents the relations between the project and the engineer in the software developer's community. A project forms some teams which consist of engineers categorized into some task group. Source Forge is well known to be one of open source websites. The node and arc in the network structure means the engineer and their connection among engineers in the Source Forge. In the previous study, we found the growing process of project becomes strong according to the number of developers joining into the project. In the growing phase, we found some characteristic patterns between the number of agents and the produced projects. By such observations, we developed a simulation model of performing the growing process of project. In this paper, we introduced the altruism behavior as shown in the Army Ant model into the software developer's simulation model. The efficiency of the software developing process was investigated by some experimental simulation results.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128725698","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449473
Hideaki Hayashi, Y. Kurita, T. Tsuji
This paper proposes a non-Gaussian approach for biosignal classification based on the Johnson SU translation system. The Johnson system is a normalizing translation that transforms data without normality to normal distribution using four parameters, thereby enabling the representation of a wide range of shapes for marginal distribution with skewness and kurtosis. In this study, a discriminative model based on the multivariate Johnson SU translation system is transformed into linear combinations of coefficients and input vectors using log-linearization, and is incorporated into a neural network structure, thereby allowing the determination of model parameters as weight coefficients of the network via backpropagation-based training. In the experiments, the classification performance of the proposed network is demonstrated using artificial data and electromyogram data.
{"title":"A non-Gaussian approach for biosignal classification based on the Johnson SU translation system","authors":"Hideaki Hayashi, Y. Kurita, T. Tsuji","doi":"10.1109/IWCIA.2015.7449473","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449473","url":null,"abstract":"This paper proposes a non-Gaussian approach for biosignal classification based on the Johnson SU translation system. The Johnson system is a normalizing translation that transforms data without normality to normal distribution using four parameters, thereby enabling the representation of a wide range of shapes for marginal distribution with skewness and kurtosis. In this study, a discriminative model based on the multivariate Johnson SU translation system is transformed into linear combinations of coefficients and input vectors using log-linearization, and is incorporated into a neural network structure, thereby allowing the determination of model parameters as weight coefficients of the network via backpropagation-based training. In the experiments, the classification performance of the proposed network is demonstrated using artificial data and electromyogram data.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"9 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124421389","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}
Pub Date : 2015-11-01DOI: 10.1109/IWCIA.2015.7449469
Yuto Ouchiyama, T. Miyahara, Yusuke Suzuki, Tomoyuki Uchida, T. Kuboyama, Fumiya Tokuhara
Machine learning and data mining from graph structured data have been studied intensively. Many chemical compounds can be expressed by outerplanar graphs. We use block preserving outerplanar graph patterns having structured variables for expressing structural features of outerplanar graphs. We propose a learning method for acquiring characteristic block preserving outerplanar graph patterns from positive and negative outerplanar graph data, by using Genetic Programming and tree representation of block preserving outerplanar graph patterns. We report experimental results on applying our method to synthetic outerplanar graph data.
{"title":"Acquisition of characteristic block preserving outerplanar graph patterns from positive and negative data using Genetic Programming and tree representation of graph patterns","authors":"Yuto Ouchiyama, T. Miyahara, Yusuke Suzuki, Tomoyuki Uchida, T. Kuboyama, Fumiya Tokuhara","doi":"10.1109/IWCIA.2015.7449469","DOIUrl":"https://doi.org/10.1109/IWCIA.2015.7449469","url":null,"abstract":"Machine learning and data mining from graph structured data have been studied intensively. Many chemical compounds can be expressed by outerplanar graphs. We use block preserving outerplanar graph patterns having structured variables for expressing structural features of outerplanar graphs. We propose a learning method for acquiring characteristic block preserving outerplanar graph patterns from positive and negative outerplanar graph data, by using Genetic Programming and tree representation of block preserving outerplanar graph patterns. We report experimental results on applying our method to synthetic outerplanar graph data.","PeriodicalId":298756,"journal":{"name":"2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133859084","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：