Many social Web sites allow users to annotate the content with descriptive metadata, such as tags, and more recently to organize content hierarchically. These types of structured metadata provide valuable evidence for learning how a community organizes knowledge. For instance, we can aggregate many personal hierarchies into a common taxonomy, also known as a folksonomy, that will aid users in visualizing and browsing social content, and also to help them in organizing their own content. However, learning from social metadata presents several challenges, since it is sparse, shallow, ambiguous, noisy, and inconsistent. We describe an approach to folksonomy learning based on relational clustering, which exploits structured metadata contained in personal hierarchies. Our approach clusters similar hierarchies using their structure and tag statistics, then incrementally weaves them into a deeper, bushier tree. We study folksonomy learning using social metadata extracted from the photo-sharing site Flickr, and demonstrate that the proposed approach addresses the challenges. Moreover, comparing to previous work, the approach produces larger, more accurate folksonomies, and in addition, scales better.
Our present work, sap , is different from our earlier approach, sig @cite_11 in many aspects. First, sap exploits more evidence, i.e., structure and tag statistics of personal hierarchies rather than individual relations' co-occurrence statistics as in sig . Second, sap is based on the relational clustering approach that incrementally attaches relevant saplings to the learned folksonomies, as sig exhaustively determines the best path out of all possible paths from the root node to a leaf, which is computationally expensive when the learned folksonomies are deep. Last, sap demonstrates many advantages as presented in sec:results .
@cite_11
2267009405 2097808961 2119149536 2096660972
We categorize this research in terms of its contribution to both graph theory and computer vision. From the theoretical perspective, this study can be considered as the first attempt to formulate the idea of mining maximal frequent subgraphs in the challenging domain of messy visual data, and as a conceptual extension to the unsupervised learning of graph matching. We define a soft attributed pattern (SAP) to represent the common subgraph pattern among a set of attributed relational graphs (ARGs), considering both their structure and attributes. Regarding the differences between ARGs with fuzzy attributes and conventional labeled graphs, we propose a new mining strategy that directly extracts the SAP with the maximal graph size without applying node enumeration. Given an initial graph template and a number of ARGs, we develop an unsupervised method to modify the graph template into the maximal-size SAP. From a practical perspective, this research develops a general platform for learning the category model (i.e., the SAP) from cluttered visual data (i.e., the ARGs) without labeling “what is where,” thereby opening the possibility for a series of applications in the era of big visual data. Experiments demonstrate the superior performance of the proposed method on RGB RGB-D images and videos. Clustering at multiple critical scales may be common for plants since many different factors and processes may cause clustering. This is especially true for tropical rain forests for which theories explaining species coexistence and community structure rest heavily on spatial patterns. We used point pattern analysis to analyze the spatial structure of Shorea congestiflora, a dominant species in a 25-ha forest dynamics plot in a rain forest at Sinharaja World Heritage Site (Sri Lanka), which apparently shows clustering at several scales. We developed cluster processes incorporating two critical scales of clustering for exploring the spatial structure of S. congestiflora and interpret it in relation to factors such as competition, dispersal limitation, recruitment limitation, and Janzen-Connell effects. All size classes showed consistent large-scale clustering with a cluster radius of ;25 m. Inside the larger clusters, small-scale clusters with a radius of 8 m were evident for recruits and saplings, weak for intermediates, and disappeared for adults. The pattern of all trees could be divided into two independent patterns: a random pattern (nearest neighbor distance . 8m ) comprising ;12 of the trees and a nested double-cluster pattern. This finding suggests two independent recruitment and or seed dispersal mechanisms. Saplings were several times as abundant as recruits and may accumulate several recruit generations. Recruits were only weakly associated with adults and occupied about half of the large-scale clusters, but saplings almost all. This is consistent with recruitment limitation. For ;70 (95 ) of all juveniles the nearest adult was less than 26 m away (53 m), suggesting a dispersal limitation that may also be related to the critical large-scale clustering. Our example illustrates the manner in which the use of a specific and complex null hypothesis of spatial structure in point pattern analysis can help us better understand the biology of a species and generate specific hypotheses to be further investigated in the field. Today, the publication of microdata poses a privacy threat: anonymous personal records can be re-identified using third data sources. Past research has tried to develop a concept of privacy guarantee that an anonymized data set should satisfy before publication, culminating in the notion of t-closeness. To satisfy t-closeness, the records in a data set need to be grouped into Equivalence Classes (ECs), such that each EC contains records of indistinguishable quasi-identifier values, and its local distribution of sensitive attribute (SA) values conforms to the global table distribution of SA values. However, despite this progress, previous research has not offered an anonymization algorithm tailored for t-closeness. In this paper, we cover this gap with SABRE, a SA Bucketization and REdistribution framework for t-closeness. SABRE first greedily partitions a table into buckets of similar SA values and then redistributes the tuples of each bucket into dynamically determined ECs. This approach is facilitated by a property of the Earth Mover's Distance (EMD) that we employ as a measure of distribution closeness: If the tuples in an EC are picked proportionally to the sizes of the buckets they hail from, then the EMD of that EC is tightly upper-bounded using localized upper bounds derived for each bucket. We prove that if the t-closeness constraint is properly obeyed during partitioning, then it is obeyed by the derived ECs too. We develop two instantiations of SABRE and extend it to a streaming environment. Our extensive experimental evaluation demonstrates that SABRE achieves information quality superior to schemes that merely applied algorithms tailored for other models to t-closeness, and can be much faster as well. To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prevalent means to process XML data in relational databases, most notably the TwigStack[6], structural join[1], and staircase join[13] algorithms. However, the addition of these algorithms to existing systems depends on a significant invasion of the underlying database kernel, an option intolerable for most database vendors. Here, we demonstrate that we can achieve comparable XPath performance without touching the heart of the system. We carefully exploit existing database functionality and accelerate XPath navigation by purely relational means: partitioned B-trees bring access costs to secondary storage to a minimum, while aggregation functions avoid an expensive computation and removal of duplicate result nodes to comply with the XPath semantics. Experiments carried out on IBM DB2 confirm that our approach can turn off-the-shelf database systems into efficient XPath processors.