Pub Date : 2018-11-01DOI: 10.1109/ICTAI.2018.00049
Yassine El-Khadiri, G. Corona, C. Rose, F. Charpillet
Early detection of frailty signs is important for the senior population that prefers to keep living in their homes instead of moving to a nursing home. Sleep quality is a good predictor for frailty monitoring. Thus we are interested in tracking sleep parameters like sleep wake patterns to predict and detect potential sleep disturbances of the monitored senior residents. We use an unsupervised inference method based on actigraphy data generated by ambient motion sensors scattered around the senior's apartment. This enables our monitoring solution to be flexible and robust to the different types of housings it can equip while still attaining accuracy of 0.94 for sleep period estimates.
{"title":"Sleep Activity Recognition Using Binary Motion Sensors","authors":"Yassine El-Khadiri, G. Corona, C. Rose, F. Charpillet","doi":"10.1109/ICTAI.2018.00049","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00049","url":null,"abstract":"Early detection of frailty signs is important for the senior population that prefers to keep living in their homes instead of moving to a nursing home. Sleep quality is a good predictor for frailty monitoring. Thus we are interested in tracking sleep parameters like sleep wake patterns to predict and detect potential sleep disturbances of the monitored senior residents. We use an unsupervised inference method based on actigraphy data generated by ambient motion sensors scattered around the senior's apartment. This enables our monitoring solution to be flexible and robust to the different types of housings it can equip while still attaining accuracy of 0.94 for sleep period estimates.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130458290","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00053
J. Carbonera, Mara Abel
Machine learning approaches have been applied in huge volumes of data. In order to deal with this big data, techniques for instance selection have been applied for reducing the data to a manageable volume and, consequently, for reducing the computational resources that are necessary to apply machine learning approaches. In this paper, we propose an efficient approach for instance selection called ISDSP. It adopts the notion of spatial partition for efficiently splitting the dataset in sets of similar instances. In a second step, the algorithm selects a representative instance of each of the densest spatial partitions that were previously identified. The approach was evaluated on 15 well-known datasets used in a classification task, and its performance was compared to those of 6 state-of-the-art algorithms, considering two measures: accuracy and reduction. All the obtained results show that, in general, the proposed approach provides a good trade-off between accuracy and reduction, with a significantly lower running time, when compared with other approaches.
{"title":"Efficient Instance Selection Based on Spatial Abstraction","authors":"J. Carbonera, Mara Abel","doi":"10.1109/ICTAI.2018.00053","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00053","url":null,"abstract":"Machine learning approaches have been applied in huge volumes of data. In order to deal with this big data, techniques for instance selection have been applied for reducing the data to a manageable volume and, consequently, for reducing the computational resources that are necessary to apply machine learning approaches. In this paper, we propose an efficient approach for instance selection called ISDSP. It adopts the notion of spatial partition for efficiently splitting the dataset in sets of similar instances. In a second step, the algorithm selects a representative instance of each of the densest spatial partitions that were previously identified. The approach was evaluated on 15 well-known datasets used in a classification task, and its performance was compared to those of 6 state-of-the-art algorithms, considering two measures: accuracy and reduction. All the obtained results show that, in general, the proposed approach provides a good trade-off between accuracy and reduction, with a significantly lower running time, when compared with other approaches.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129695666","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00054
F. Marulanda, P. Libin, T. Verstraeten, A. Nowé
Over the last decade, the demand for better segmentation and classification algorithms in 3D spaces has significantly grown due to the popularity of new 3D sensor technologies and advancements in the field of robotics. Point-clouds are one of the most popular representations to store a digital description of 3D shapes. However, point-clouds are stored in irregular and unordered structures, which limits the direct use of segmentation algorithms such as Convolutional Neural Networks. The objective of our work is twofold: First, we aim to provide a full analysis of the PointNet architecture to illustrate which features are being extracted from the point-clouds. Second, to propose a new network architecture called IPC-Net to improve the state-of-the-art point cloud architectures. We show that IPC-Net extracts a larger set of unique features allowing the model to produce more accurate segmentations compared to the PointNet architecture. In general, our approach outperforms PointNet on every family of 3D geometries on which the models were tested. A high generalisation improvement was observed on every 3D shape, especially on the rockets dataset. Our experiments demonstrate that our main contribution, inter-point activation on the network's layers, is essential to accurately segment 3D point-clouds.
{"title":"IPC-Net: 3D Point-Cloud Segmentation Using Deep Inter-Point Convolutional Layers","authors":"F. Marulanda, P. Libin, T. Verstraeten, A. Nowé","doi":"10.1109/ICTAI.2018.00054","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00054","url":null,"abstract":"Over the last decade, the demand for better segmentation and classification algorithms in 3D spaces has significantly grown due to the popularity of new 3D sensor technologies and advancements in the field of robotics. Point-clouds are one of the most popular representations to store a digital description of 3D shapes. However, point-clouds are stored in irregular and unordered structures, which limits the direct use of segmentation algorithms such as Convolutional Neural Networks. The objective of our work is twofold: First, we aim to provide a full analysis of the PointNet architecture to illustrate which features are being extracted from the point-clouds. Second, to propose a new network architecture called IPC-Net to improve the state-of-the-art point cloud architectures. We show that IPC-Net extracts a larger set of unique features allowing the model to produce more accurate segmentations compared to the PointNet architecture. In general, our approach outperforms PointNet on every family of 3D geometries on which the models were tested. A high generalisation improvement was observed on every 3D shape, especially on the rockets dataset. Our experiments demonstrate that our main contribution, inter-point activation on the network's layers, is essential to accurately segment 3D point-clouds.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128923729","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00043
Florin Brad, R. Iacob, Ionel-Alexandru Hosu, Stefan Ruseti, Traian Rebedea
Recent advances in neural code generation have incorporated syntax to improve the generation of the target code based on the user's request in natural language. We adapt the model of [1] to the Natural Language Interface to Databases (NLIDB) problem by taking into account the database schema. We evaluate our model on the recently introduced WIKISQL and SENLIDB datasets. Our results show that the syntax-guided model outperforms a simple sequence-to-sequence (SEQ2SEQ) baseline on WIKISQL, but has trouble with the SENLIDB dataset due to its complexity.
{"title":"A Syntax-Guided Neural Model for Natural Language Interfaces to Databases","authors":"Florin Brad, R. Iacob, Ionel-Alexandru Hosu, Stefan Ruseti, Traian Rebedea","doi":"10.1109/ICTAI.2018.00043","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00043","url":null,"abstract":"Recent advances in neural code generation have incorporated syntax to improve the generation of the target code based on the user's request in natural language. We adapt the model of [1] to the Natural Language Interface to Databases (NLIDB) problem by taking into account the database schema. We evaluate our model on the recently introduced WIKISQL and SENLIDB datasets. Our results show that the syntax-guided model outperforms a simple sequence-to-sequence (SEQ2SEQ) baseline on WIKISQL, but has trouble with the SENLIDB dataset due to its complexity.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120952545","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00038
F. Durão, D. Bridge
It is becoming more common to publish data in a way that accords with the Linked Data principles. In an effort to improve the human exploitation of this data, we propose a Linked Data browser that is enhanced with recommendation functionality. Based on a user profile, also represented as Linked Data, we propose a technique that we call LDRec that chooses in a personalized way which of the resources that lie within a certain neighbourhood in a Linked Data graph to recommend to the user. The recommendation technique, which is novel, is inspired by a collective classifier known as the Iterative Classification Algorithm. We evaluate LDRec using both an off-line experiment and a user trial. In the off-line experiment, we obtain higher hit rates than we obtain using a simpler classifier. In the user trial, comparing against the same simpler classifier, participants report significantly higher levels of overall satisfaction for LDRec.
{"title":"A Linked Data Browser with Recommendations","authors":"F. Durão, D. Bridge","doi":"10.1109/ICTAI.2018.00038","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00038","url":null,"abstract":"It is becoming more common to publish data in a way that accords with the Linked Data principles. In an effort to improve the human exploitation of this data, we propose a Linked Data browser that is enhanced with recommendation functionality. Based on a user profile, also represented as Linked Data, we propose a technique that we call LDRec that chooses in a personalized way which of the resources that lie within a certain neighbourhood in a Linked Data graph to recommend to the user. The recommendation technique, which is novel, is inspired by a collective classifier known as the Iterative Classification Algorithm. We evaluate LDRec using both an off-line experiment and a user trial. In the off-line experiment, we obtain higher hit rates than we obtain using a simpler classifier. In the user trial, comparing against the same simpler classifier, participants report significantly higher levels of overall satisfaction for LDRec.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122818439","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00037
C. Troussas, Akrivi Krouska, M. Virvou
The explosive growth in the amount of available digital information has increased the demand for recommender systems. Recommender systems are information filtering systems that deal with the problem of information overload by filtering vital information fragment out of large amount of dynamically generated information according to user's preferences or interests. Recommender systems have the ability to predict whether a particular user would prefer an item or not based on his/her personal profile. To this direction, this paper presents multi-algorithmic techniques, such as content-based filtering and collaborative filtering, which increase the efficiency of recommender systems. Moreover, a hybrid model for recommendation, employing content-based and collaborative filtering, is introduced. The presented recommender system takes as input information about users from their profile in Facebook, one of the most well-known social networking services. Examples of operation are given and they hold promising results for the described techniques. Finally, the paper attests that the aforementioned techniques can be used for different kind of software, such as e-learning, e-commerce, etc.
{"title":"Multi-Algorithmic Techniques and a Hybrid Model for Increasing the Efficiency of Recommender Systems","authors":"C. Troussas, Akrivi Krouska, M. Virvou","doi":"10.1109/ICTAI.2018.00037","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00037","url":null,"abstract":"The explosive growth in the amount of available digital information has increased the demand for recommender systems. Recommender systems are information filtering systems that deal with the problem of information overload by filtering vital information fragment out of large amount of dynamically generated information according to user's preferences or interests. Recommender systems have the ability to predict whether a particular user would prefer an item or not based on his/her personal profile. To this direction, this paper presents multi-algorithmic techniques, such as content-based filtering and collaborative filtering, which increase the efficiency of recommender systems. Moreover, a hybrid model for recommendation, employing content-based and collaborative filtering, is introduced. The presented recommender system takes as input information about users from their profile in Facebook, one of the most well-known social networking services. Examples of operation are given and they hold promising results for the described techniques. Finally, the paper attests that the aforementioned techniques can be used for different kind of software, such as e-learning, e-commerce, etc.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124227937","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}
Acoustic scene classification (ASC) is an important task in audio signal processing and can be useful in many real-world applications. Recently, several deep neural network models have been proposed for ASC, such as LSTMs based on temporal analysis and CNNs based on frequency spectrum, as well as hybrid models of LSTM and CNN to further improve classification performance. However, existing hybrid models fail to properly preserve the temporal information when transferring data between different models. In this work, we first analyze the cause of such temporal information loss. We then propose Multi-LCNN, a new hybrid model with two important mechanisms: (1) a LCNN architecture to effectively preserve temporal information; and (2) a multi-channel feature fusion mechanism (MCFF) that combines enhanced temporal information and frequency spectrogram information to learn highly integrated and discriminative features for ASC. Evaluations on the TUT ASC 2016 dataset show that our model can achieve an improvement of 10.23% over the baseline method, and is currently the best-performing end-to-end model on this dataset.
{"title":"Multi-LCNN: A Hybrid Neural Network Based on Integrated Time-Frequency Characteristics for Acoustic Scene Classification","authors":"Jin Lei, Changjian Wang, Boqing Zhu, Q. Lv, Zhen Huang, Yuxing Peng","doi":"10.1109/ICTAI.2018.00019","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00019","url":null,"abstract":"Acoustic scene classification (ASC) is an important task in audio signal processing and can be useful in many real-world applications. Recently, several deep neural network models have been proposed for ASC, such as LSTMs based on temporal analysis and CNNs based on frequency spectrum, as well as hybrid models of LSTM and CNN to further improve classification performance. However, existing hybrid models fail to properly preserve the temporal information when transferring data between different models. In this work, we first analyze the cause of such temporal information loss. We then propose Multi-LCNN, a new hybrid model with two important mechanisms: (1) a LCNN architecture to effectively preserve temporal information; and (2) a multi-channel feature fusion mechanism (MCFF) that combines enhanced temporal information and frequency spectrogram information to learn highly integrated and discriminative features for ASC. Evaluations on the TUT ASC 2016 dataset show that our model can achieve an improvement of 10.23% over the baseline method, and is currently the best-performing end-to-end model on this dataset.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115555669","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00136
M. Dey, S. P. Rana, S. Dudley
This work demonstrates and evaluates semisupervised learning (SSL) techniques for heating, ventilation and air-conditioning (HVAC) data from a real building to automatically discover and identify faults. Real HVAC sensor data is unfortunately usually unstructured and unlabelled, thus, to ensure better performance of automated methods promoting machine-learning techniques requires raw data to be preprocessed, increasing the overall operational costs of the system employed and makes real time application difficult. Due to the data complexity and limited availability of labelled information, semi-supervised learning based robust automatic fault detection and diagnosis (AFDD) tool has been proposed here. Further, this method has been tested and compared for more than 50 thousand TUs. Established statistical performance metrics and paired t-test have been applied to validate the proposed work.
{"title":"Semi-Supervised Learning Techniques for Automated Fault Detection and Diagnosis of HVAC Systems","authors":"M. Dey, S. P. Rana, S. Dudley","doi":"10.1109/ICTAI.2018.00136","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00136","url":null,"abstract":"This work demonstrates and evaluates semisupervised learning (SSL) techniques for heating, ventilation and air-conditioning (HVAC) data from a real building to automatically discover and identify faults. Real HVAC sensor data is unfortunately usually unstructured and unlabelled, thus, to ensure better performance of automated methods promoting machine-learning techniques requires raw data to be preprocessed, increasing the overall operational costs of the system employed and makes real time application difficult. Due to the data complexity and limited availability of labelled information, semi-supervised learning based robust automatic fault detection and diagnosis (AFDD) tool has been proposed here. Further, this method has been tested and compared for more than 50 thousand TUs. Established statistical performance metrics and paired t-test have been applied to validate the proposed work.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115755444","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00104
Konstantinos Kolomvatsos, C. Anagnostopoulos
Humongous contextual data are produced by sensing and computing devices (nodes) in distributed computing environments supporting inferential/predictive analytics. Nodes locally process and execute analytics tasks over contextual data. Demanding inferential analytics are crucial for supporting local real-time applications, however, they deplete nodes' resources. We contribute with a distributed methodology that pushes the task allocation decision at the network edge by intelligently scheduling and distributing analytics tasks among nodes. Each node autonomously decides whether the tasks are conditionally executed locally, or in networked neighboring nodes, or delegated to the Cloud based on the current nodes' context and statistical data relevance. We comprehensively evaluate our methodology demonstrating its applicability in edge computing environments.
{"title":"In-Network Decision Making Intelligence for Task Allocation in Edge Computing","authors":"Konstantinos Kolomvatsos, C. Anagnostopoulos","doi":"10.1109/ICTAI.2018.00104","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00104","url":null,"abstract":"Humongous contextual data are produced by sensing and computing devices (nodes) in distributed computing environments supporting inferential/predictive analytics. Nodes locally process and execute analytics tasks over contextual data. Demanding inferential analytics are crucial for supporting local real-time applications, however, they deplete nodes' resources. We contribute with a distributed methodology that pushes the task allocation decision at the network edge by intelligently scheduling and distributing analytics tasks among nodes. Each node autonomously decides whether the tasks are conditionally executed locally, or in networked neighboring nodes, or delegated to the Cloud based on the current nodes' context and statistical data relevance. We comprehensively evaluate our methodology demonstrating its applicability in edge computing environments.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127027298","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 : 2018-11-01DOI: 10.1109/ICTAI.2018.00116
Philippe Jégou, Hélène Kanso, C. Terrioux
For the study and the solving of NP-hard problems, the concept of tree decomposition is nowadays a major topic in Computer Science, in Artificial Intelligence and particularly in Constraint Programming. It appears as a promising field for the theoretical study of numerous graphical models like Bayesian Networks or (Weighted) Constraint Networks, since it can ensure, under some hypothesis, the existence of polynomial time algorithms. This concept is also used in a wide range of applications. Recently, a real improvement in the practical computation of optimal tree decompositions has been observed, allowing new promising applications of this concept in real applications. In this paper, we first aim to analyze the real relevance of such optimal decompositions. We first set that a larger set of instances are now optimally decomposable in practice but using these algorithms on a practical level still constitutes a real difficulty. In a second time, we assess the impact of such optimal decompositions for solving these instances and note a discrepancy between the empirical results and what is expected from the complexity analysis. Finally, we discuss of the next investigations which are needed on this topic.
{"title":"On the Relevance of Optimal Tree Decompositions for Constraint Networks","authors":"Philippe Jégou, Hélène Kanso, C. Terrioux","doi":"10.1109/ICTAI.2018.00116","DOIUrl":"https://doi.org/10.1109/ICTAI.2018.00116","url":null,"abstract":"For the study and the solving of NP-hard problems, the concept of tree decomposition is nowadays a major topic in Computer Science, in Artificial Intelligence and particularly in Constraint Programming. It appears as a promising field for the theoretical study of numerous graphical models like Bayesian Networks or (Weighted) Constraint Networks, since it can ensure, under some hypothesis, the existence of polynomial time algorithms. This concept is also used in a wide range of applications. Recently, a real improvement in the practical computation of optimal tree decompositions has been observed, allowing new promising applications of this concept in real applications. In this paper, we first aim to analyze the real relevance of such optimal decompositions. We first set that a larger set of instances are now optimally decomposable in practice but using these algorithms on a practical level still constitutes a real difficulty. In a second time, we assess the impact of such optimal decompositions for solving these instances and note a discrepancy between the empirical results and what is expected from the complexity analysis. Finally, we discuss of the next investigations which are needed on this topic.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123761126","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
扫码关注我们
求助内容：
应助结果提醒方式：