<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
	<channel>
		<title>ACM Transactions on Intelligent Systems and Technology (TIST)</title>
		<link>http://dl.acm.org/citation.cfm?id=3447400</link>
		<description />
		<item>
			<title>ACM Transactions on Intelligent Systems and Technology (TIST) - Survey Paper and Regular Paper</title>
			<link>http://dl.acm.org/citation.cfm?id=3447400</link>
			<description />
			<pubDate>Fri, 30 Apr 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3447400</guid>
		</item>
		<item>
			<title>Dynamic Planning of Bicycle Stations in Dockless Public Bicycle-sharing System Using Gated Graph Neural Network</title>
			<link>http://dl.acm.org/citation.cfm?id=3446342</link>
			<description><![CDATA[Jianguo Chen, Kenli Li, Keqin Li, Philip S. Yu, Zeng Zeng<br /><br />Benefiting from convenient cycling and flexible parking locations, the Dockless Public Bicycle-sharing (DL-PBS) network becomes increasingly popular in many countries. However, redundant and low-utility stations waste public urban space and maintenance costs of DL-PBS vendors. In this article, we propose a Bicycle Station Dynamic Planning (BSDP) system to dynamically provide the optimal bicycle station layout for the DL-PBS network. The BSDP system contains four modules: bicycle drop-off location clustering, bicycle-station graph modeling, bicycle-station location prediction, and bicycle-station layout recommendation. In the bicycle drop-off location clustering module, candidate bicycle stations are clustered from each spatio-temporal subset of the large-scale cycling trajectory records.]]></description>
			<pubDate>Fri, 12 Mar 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3446342</guid>
		</item>
		<item>
			<title>Flatter Is Better: Percentile Transformations for Recommender Systems</title>
			<link>http://dl.acm.org/citation.cfm?id=3437910</link>
			<description><![CDATA[Masoud Mansoury, Robin Burke, Bamshad Mobasher<br /><br />It is well known that explicit user ratings in recommender systems are biased toward high ratings and that users differ significantly in their usage of the rating scale. Implementers usually compensate for these issues through rating normalization or the inclusion of a user bias term in factorization models. However, these methods adjust only for the central tendency of users&#x02019; distributions. In this work, we demonstrate that a lack of flatness in rating distributions is negatively correlated with recommendation performance. We propose a rating transformation model that compensates for skew in the rating distribution as well as its central tendency by converting ratings into percentile values as a pre-processing step before recommendation generation.]]></description>
			<pubDate>Tue, 09 Mar 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3437910</guid>
		</item>
		<item>
			<title>Causal Mechanism Transfer Network for Time Series Domain Adaptation in Mechanical Systems</title>
			<link>http://dl.acm.org/citation.cfm?id=3445033</link>
			<description><![CDATA[Zijian Li, Ruichu Cai, Hong Wei Ng, Marianne Winslett, Tom Z. J. Fu, Boyan Xu, Xiaoyan Yang, Zhenjie Zhang<br /><br />Data-driven models are becoming essential parts in modern mechanical systems, commonly used to capture the behavior of various equipment and varying environmental characteristics. Despite the advantages of these data-driven models on excellent adaptivity to high dynamics and aging equipment, they are usually hungry for massive labels, mostly contributed by human engineers at a high cost. Fortunately, domain adaptation enhances the model generalization by utilizing the labeled source data and the unlabeled target data. However, the mainstream domain adaptation methods cannot achieve ideal performance on time series data, since they assume that the conditional distributions are equal. This assumption works well in the static data but is inapplicable for the time series data.]]></description>
			<pubDate>Tue, 09 Mar 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3445033</guid>
		</item>
		<item>
			<title>Conditional Text Generation for Harmonious Human-Machine Interaction</title>
			<link>http://dl.acm.org/citation.cfm?id=3439816</link>
			<description><![CDATA[Bin Guo, Hao Wang, Yasan Ding, Wei Wu, Shaoyang Hao, Yueqi Sun, Zhiwen Yu<br /><br />In recent years, with the development of deep learning, text-generation technology has undergone great changes and provided many kinds of services for human beings, such as restaurant reservation and daily communication. The automatically generated text is becoming more and more fluent so researchers begin to consider more anthropomorphic text-generation technology, that is, the conditional text generation, including emotional text generation, personalized text generation, and so on. Conditional Text Generation (CTG) has thus become a research hotspot. As a promising research field, we find that much attention has been paid to exploring it. Therefore, we aim to give a comprehensive review of the new research trends of CTG.]]></description>
			<pubDate>Fri, 26 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3439816</guid>
		</item>
		<item>
			<title>Disentangled Item Representation for Recommender Systems</title>
			<link>http://dl.acm.org/citation.cfm?id=3445811</link>
			<description><![CDATA[Zeyu Cui, Feng Yu, Shu Wu, Qiang Liu, Liang Wang<br /><br />Item representations in recommendation systems are expected to reveal the properties of items. Collaborative recommender methods usually represent an item as one single latent vector. Nowadays the e-commercial platforms provide various kinds of attribute information for items (e.g., category, price, and style of clothing). Utilizing this attribute information for better item representations is popular in recent years. Some studies use the given attribute information as side information, which is concatenated with the item latent vector to augment representations. However, the mixed item representations fail to fully exploit the rich attribute information or provide explanation in recommender systems. To this end, we propose a fine-grained Disentangled Item Representation (DIR) for recommender systems in this article, where the items are represented as several separated attribute vectors instead of a single latent vector.]]></description>
			<pubDate>Fri, 26 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3445811</guid>
		</item>
		<item>
			<title>Attentive Excitation and Aggregation for Bilingual Referring Image Segmentation</title>
			<link>http://dl.acm.org/citation.cfm?id=3446345</link>
			<description><![CDATA[Qianli Zhou, Tianrui Hui, Rong Wang, Haimiao Hu, Si Liu<br /><br />The goal of referring image segmentation is to identify the object matched with an input natural language expression. Previous methods only support English descriptions, whereas Chinese is also broadly used around the world, which limits the potential application of this task. Therefore, we propose to extend existing datasets with Chinese descriptions and preprocessing tools for training and evaluating bilingual referring segmentation models. In addition, previous methods also lack the ability to collaboratively learn channel-wise and spatial-wise cross-modal attention to well align visual and linguistic modalities. To tackle these limitations, we propose a Linguistic Excitation module to excite image channels guided by language information and a Linguistic Aggregation module to aggregate multimodal information based on image-language relationships.]]></description>
			<pubDate>Fri, 26 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3446345</guid>
		</item>
		<item>
			<title>Indirectly Supervised Anomaly Detection of Clinically Meaningful Health Events from Smart Home Data</title>
			<link>http://dl.acm.org/citation.cfm?id=3439870</link>
			<description><![CDATA[Jessamyn Dahmen, Diane J. Cook<br /><br />Anomaly detection techniques can extract a wealth of information about unusual events. Unfortunately, these methods yield an abundance of findings that are not of interest, obscuring relevant anomalies. In this work, we improve upon traditional anomaly detection methods by introducing Isudra, an Indirectly Supervised Detector of Relevant Anomalies from time series data. Isudra employs Bayesian optimization to select time scales, features, base detector algorithms, and algorithm hyperparameters that increase true positive and decrease false positive detection. This optimization is driven by a small amount of example anomalies, driving an indirectly supervised approach to anomaly detection. Additionally, we enhance the approach by introducing a warm-start method that reduces optimization time between similar problems.]]></description>
			<pubDate>Thu, 11 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3439870</guid>
		</item>
		<item>
			<title>Active Learning for Effectively Fine-Tuning Transfer Learning to Downstream Task</title>
			<link>http://dl.acm.org/citation.cfm?id=3446343</link>
			<description><![CDATA[Md Abul Bashar, Richi Nayak<br /><br />Language model (LM) has become a common method of transfer learning in Natural Language Processing (NLP) tasks when working with small labeled datasets. An LM is pretrained using an easily available large unlabelled text corpus and is fine-tuned with the labelled data to apply to the target (i.e., downstream) task. As an LM is designed to capture the linguistic aspects of semantics, it can be biased to linguistic features. We argue that exposing an LM model during fine-tuning to instances that capture diverse semantic aspects (e.g., topical, linguistic, semantic relations) present in the dataset will improve its performance on the underlying task.]]></description>
			<pubDate>Thu, 11 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3446343</guid>
		</item>
		<item>
			<title>Aspect-Aware Response Generation for Multimodal Dialogue System</title>
			<link>http://dl.acm.org/citation.cfm?id=3430752</link>
			<description><![CDATA[Mauajama Firdaus, Nidhi Thakur, Asif Ekbal<br /><br />Multimodality in dialogue systems has opened up new frontiers for the creation of robust conversational agents. Any multimodal system aims at bridging the gap between language and vision by leveraging diverse and often complementary information from image, audio, and video, as well as text. For every task-oriented dialog system, different aspects of the product or service are crucial for satisfying the user&#x02019;s demands. Based upon the aspect, the user decides upon selecting the product or service. The ability to generate responses with the specified aspects in a goal-oriented dialogue setup facilitates user satisfaction by fulfilling the user&#x02019;s goals. Therefore, in our current work, we propose the task of aspect controlled response generation in a multimodal task-oriented dialog system.]]></description>
			<pubDate>Thu, 04 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3430752</guid>
		</item>
		<item>
			<title>Predicting Attributes of Nodes Using Network Structure</title>
			<link>http://dl.acm.org/citation.cfm?id=3442390</link>
			<description><![CDATA[Sarwan Ali, Muhammad Haroon Shakeel, Imdadullah Khan, Safiullah Faizullah, Muhammad Asad Khan<br /><br />In many graphs such as social networks, nodes have associated attributes representing their behavior. Predicting node attributes in such graphs is an important task with applications in many domains like recommendation systems, privacy preservation, and targeted advertisement. Attribute values can be predicted by treating each node as a data point described by attributes and employing classification/regression algorithms. However, in social networks, there is complex interdependence between node attributes and pairwise interaction. For instance, attributes of nodes are influenced by their neighbors (social influence), and neighborhoods (friendships) between nodes are established based on pairwise (dis)similarity between their attributes (social selection). In this article, we establish that information in network topology is extremely useful in determining node attributes.]]></description>
			<pubDate>Thu, 04 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3442390</guid>
		</item>
		<item>
			<title>Feature Grouping&#x02013;based Trajectory Outlier Detection over Distributed Streams</title>
			<link>http://dl.acm.org/citation.cfm?id=3444753</link>
			<description><![CDATA[Jiali Mao, Jiaye Liu, Cheqing Jin, Aoying Zhou<br /><br />Owing to a wide variety of deployment of GPS-enabled devices, tremendous amounts of trajectories have been generated in distributed stream manner. It opens up new opportunities to track and analyze the moving behaviors of the entities. In this work, we focus on the issue of outlier detection over distributed trajectory streams, where the outliers refer to a few entities whose motion behaviors are significantly different from their local neighbors. In view of skewed distribution property and evolving nature of trajectory data, and on-the-fly detection requirement over distributed streams, we first design a high-efficiency outlier detection solution. It consists of identifying abnormal trajectory fragment and exceptional fragment cluster at the remote sites and then detecting abnormal evolving object at the coordinator site.]]></description>
			<pubDate>Thu, 04 Feb 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3444753</guid>
		</item>
		<item>
			<title>RHUPS: Mining Recent High Utility Patterns with Sliding Window&#x2013;based Arrival Time Control over Data Streams</title>
			<link>http://dl.acm.org/citation.cfm?id=3430767</link>
			<description><![CDATA[Yoonji Baek, Unil Yun, Heonho Kim, Hyoju Nam, Hyunsoo Kim, Jerry Chun-Wei Lin, Bay Vo, Witold Pedrycz<br /><br />Databases that deal with the real world have various characteristics. New data is continuously inserted over time without limiting the length of the database, and a variety of information about the items constituting the database is contained. Recently generated data has a greater influence than the previously generated data. These are called the time-sensitive non-binary stream databases, and they include databases such as web-server click data, market sales data, data from sensor networks, and network traffic measurement. Many high utility pattern mining and stream pattern mining methods have been proposed so far. However, they have a limitation that they are not suitable to analyze these databases, because they find valid patterns by analyzing a database with only some of the features described above.]]></description>
			<pubDate>Wed, 13 Jan 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3430767</guid>
		</item>
		<item>
			<title>Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry</title>
			<link>http://dl.acm.org/citation.cfm?id=3430710</link>
			<description><![CDATA[Felix Winter, Nysret Musliu<br /><br />Factories in the automotive supply industry paint a large number of items requested by car manufacturing companies on a daily basis. As these factories face numerous constraints and optimization objectives, finding a good schedule becomes a challenging task in practice, and full-time employees are expected to manually create feasible production plans. In this study, we propose novel constraint programming models for a real-life paint shop scheduling problem. We evaluate and compare our models experimentally by performing a series of benchmark experiments using real-life instances in the industry.]]></description>
			<pubDate>Wed, 13 Jan 2021 00:00:00 GMT </pubDate>
			<author />
			<guid isPermaLink="false">3430710</guid>
		</item>
	</channel>
</rss>
