We present an emotion computational model based on social tags. The model is built upon an automatically generated lexicon that describes emotions by means of synonym and antonym terms, and that is linked to multiple domainspecific emotion folksonomies extracted from entertainment social tagging systems. Using these cross-domain folksonomies, we develop a number of methods that automatically tr...

Mining of frequent patterns is a basic problem in data mining applications. Frequent Itemset Mining is considered to be an important research oriented task in data mining, due to its large applicability in real world applications. In this paper, a new Maximal Frequent Itemset mining algorithm with effective pruning mechanism is proposed. The proposed algorithm takes vertical tidset representati...

In the era of Web 2.0, user generated content (UGC), such as social tag and user review, widely exists on the Internet. However, in recommender systems, most of existing related works only study single kind of UGC in each paper, and different types of UGC are utilized in different ways. This paper proposes a unified way to use different types of UGC to improve the prediction accuracy for recomm...

Query and transformation languages developed since the mid 90es for XML and semistructured data – e.g. XQuery, the precursors of XQuery, and XSLT – built upon a path-oriented node selection: A node in a data item is specified in terms of a root-to-node path in the manner of the file selection languages of operating systems. Constructs from regular expressions such as ∗, +, ?, and “wildcards” gi...

The field of relational database research has developed many database accessing methods for effective data retrieval, e.g. B tree indexing, Bitmap indexing, hash-based join, sort-merge join. These methods are oriented on finding or joining single items (represented by records) that satisfy point or range conditions. However, in the area of data mining research, there is often the need to effect...

Most query and transformation languages developed since the mid 90es for XML and semistructured data – e.g. XQuery [1], the precursors of XQuery [2], and XSLT [3] – build upon a path-oriented node selection: A node in a data item is specified in terms of a root-to-node path in the manner of the file selection languages of operating systems. Constructs inspired from the regular expression constr...

Predicting the stability of object-oriented systems is an important and challenging task. Classical approaches to quality prediction perform some form of inductive inference starting from datasets of software items with known quality factor values and looking for typical features that discriminate the items regarding the quality factor. However, most of the effective methods for predictive mode...

Introduction: Substance use disorder is one of the most critical social problems in Iran. For this disorder, weneed a proper assessment tool based on our indigenous culture. Objective: This study assesses the factor structure and psychometric properties of 10-item and 20-item Persian versions of Drug Abuse Screening Tests (DAST-10 and DAST-20). Materials and Methods: In this cross-sectional s...

Bloom filter (BF) is a space-efficient data structure that represents a large set of items and supports efficient membership queries. It has been widely proposed to employ Bloom filters in the routing entries so as to facilitate data-centric routing in network applications. The existing designs of Bloom filters, however, cannot effectively support in-network queries. Given a query for a data it...