Query: Mobile business models: organizational and financial design issues that matter

Relevant passages:
The business model concept: theoretical underpinnings and empirical illustrations <=SEP=> Received: 13 December 2001 Revised: 27 March 2002 : 26 July 2002 Accepted:15 October 2002 Abstract The business model concept is becoming increasingly popular within IS, management and strategy literature. It is used within many fields of research, including both traditional strategy theory and in the emergent body of literature on e-business. However, the concept is often used independently from theory, meaning model components and their interrelations are relatively obscure. Nonetheless, we believe that the business model concept is useful in explaining the relation between IS and strategy. This paper offers an outline for a conceptual business model, and proposes that it should include customers and competitors, the offering, activities and organisation, resources and factor market interactions. The causal inter-relations and the longitudinal processes by which business models evolve should also be included. The model criticises yet draws on traditional strategy theory and on the literature that addresses business models directly. The business model is illustrated by an ERP implementation in a European multi-national company. European Journal of Information Systems (2003) 12, 49–59. doi:10.1057/ palgrave.ejis.3000446

Design science in information systems research <=SEP=> 

Balancing customer and network value in business models for mobile services <=SEP=> Designing business models for mobile services is complex. A business model can be seen as a blueprint of four interrelated components: service offering, technical architecture, and organisational and financial arrangements. In this paper the connections among these components are explored by analysing the critical design issues in business models for mobile services, e.g., targeting and branding in the service domain, security and quality of service in the technology domain, network governance in the organisation domain, and revenue sharing in the finance domain. A causal framework is developed linking these critical design issues to expected customer value and expected network value, and hence, to business model viability.

Evaluation in Design-Oriented Research <=SEP=> Design has been recognized for a long time both as art and as science. In the sixties of the previous century design-oriented research began to draw the attention of scientific researchers and methodologists, not only in technical engineering but also in the social sciences. However, a rather limited methodology for design-oriented research has been developed, especially as to the social sciences. In this article we introduce evaluation methodology and research methodology as a systematic input in the process of designing. A designing cycle is formulated with six stages, and for each of these stages operations, guidelines and criteria for evaluation are defined. All this may be used for a considerable improvement of the process and product of designing.

Business Models for Electronic Markets <=SEP=> Introduction Electronic commerce can be defined loosely as “doing business electronically” (European Commission 1997). Electronic commerce includes electronic trading of physical goods and of intangibles such as information. This encompasses all the trading steps such as online marketing, ordering, payment, and support for delivery. Electronic commerce includes the electronic provision of services, such as aftersales support or online legal advice. Finally it also includes electronic support for collaboration between companies, such as collaborative design.

Social Choice for Partial Preferences Using Imputation <=SEP=> Within the field of multiagent systems, the area of computational social choice considers the problems arising when decisions must be made collectively by a group of agents. Usually such systems collect a ranking of the alternatives from each member of the group in turn, and aggregate these individual rankings to arrive at a collective decision. However, when there are many alternatives to consider, individual agents may be unwilling, or unable, to rank all of them, leading to decisions that must be made on the basis of incomplete information. While earlier approaches attempt to work with the provided rankings by making assumptions about the nature of the missing information, this can lead to undesirable outcomes when the assumptions do not hold, and is ill-suited to certain problem domains. In this thesis, we propose a new approach that uses machine learning algorithms (both conventional and purpose-built) to generate plausible completions of each agent’s rankings on the basis of the partial rankings the agent provided (imputations), in a way that reflects the agents’ true preferences. We show that the combination of existing social choice functions with certain classes of imputation algorithms, which forms the core of our proposed solution, is equivalent to a form of social choice. Our system then undergoes an extensive empirical validation under 40 different test conditions, involving more than 50,000 group decision problems generated from real-world electoral data, and is found to outperform existing competitors significantly, leading to better group decisions overall. Detailed empirical findings are also used to characterize the behaviour of the system, and illustrate the circumstances in which it is most advantageous. A general testbed for comparing solutions using real-world and artificial data (Prefmine) is then described, in conjunction with results that justify its design decisions. We move on to propose a new machine learning algorithm intended specifically to learn and impute the preferences of agents, and validate its effectiveness. This Markov-Tree approach is demonstrated to be superior to imputation using conventional machine learning, and has a simple interpretation that characterizes the problems on which it will perform well. Later chapters contain an axiomatic validation of both of our new approaches, as well as techniques for mitigating their manipulability. The thesis concludes with a discussion of the applicability of its contributions, both for multiagent systems and for settings involving human elections. In all, we reveal an interesting connection between machine learning and computational social choice, and introduce a testbed which facilitates future research efforts on computational social choice for partial preferences, by allowing empirical comparisons between competing approaches to be conducted easily, accurately, and quickly. Perhaps most importantly, we offer an important and effective new direction for enabling group decision making when preferences are not completely specified, using imputation methods.

Learning an Intrinsic Image Decomposer Using Synthesized RGB-D Dataset <=SEP=> Intrinsic image decomposition refers to recover the albedo and shading from images, which is an ill-posed problem in signal processing. As realistic labeled data are severely lacking, it is difficult to apply learning methods in this issue. In this letter, we propose using a synthesized dataset to facilitate the solving of this problem. A physically based renderer is used to generate color images and their underlying ground-truth albedo and shading from three-dimensional models. Additionally, we render a Kinect-like noisy depth map for each instance. We utilize this synthetic dataset to train a deep neural network for intrinsic image decomposition and further fine-tune it for real-world images. Our model supports both RGB and RGB-D as input, and it employs both high-level and low-level features to avoid blurry outputs. Experimental results verify the effectiveness of our model on realistic images.

Geometric mechanics of curved crease origami. <=SEP=> Folding a sheet of paper along a curve can lead to structures seen in decorative art and utilitarian packing boxes. Here we present a theory for the simplest such structure: an annular circular strip that is folded along a central circular curve to form a three-dimensional buckled structure driven by geometrical frustration. We quantify this shape in terms of the radius of the circle, the dihedral angle of the fold, and the mechanical properties of the sheet of paper and the fold itself. When the sheet is isometrically deformed everywhere except along the fold itself, stiff folds result in creases with constant curvature and oscillatory torsion. However, relatively softer folds inherit the broken symmetry of the buckled shape with oscillatory curvature and torsion. Our asymptotic analysis of the isometrically deformed state is corroborated by numerical simulations that allow us to generalize our analysis to study structures with multiple curved creases.

Policy Optimization with Demonstrations <=SEP=> Exploration remains a significant challenge to reinforcement learning methods, especially in environments where reward signals are sparse. Recent methods of learning from demonstrations have shown to be promising in overcoming exploration difficulties but typically require considerable highquality demonstrations that are difficult to collect. We propose to effectively leverage available demonstrations to guide exploration through enforcing occupancy measure matching between the learned policy and current demonstrations, and develop a novel Policy Optimization from Demonstration (POfD) method. We show that POfD induces implicit dynamic reward shaping and brings provable benefits for policy improvement. Furthermore, it can be combined with policy gradient methods to produce state-of-the-art results, as demonstrated experimentally on a range of popular benchmark sparse-reward tasks, even when the demonstrations are few and imperfect.

Are You Asking the Right Questions? Teaching Machines to Ask Clarification Questions <=SEP=> Inquiry is fundamental to communication, and machines cannot effectively collaborate with humans unless they can ask questions. In this thesis work, we explore how can we teach machines to ask clarification questions when faced with uncertainty, a goal of increasing importance in today’s automated society. We do a preliminary study using data from StackExchange, a plentiful online resource where people routinely ask clarifying questions to posts so that they can better offer assistance to the original poster. We build neural network models inspired by the idea of the expected value of perfect information: a good question is one whose expected answer is going to be most useful. To build generalizable systems, we propose two future research directions: a template-based model and a sequence-to-sequence based neural generative model.

Indistinguishability of Random Systems <=SEP=> An (X ,Y)-random system takes inputs X1, X2, . . . ∈ X and generates, for each new input Xi, an output Yi ∈ Y, depending probabilistically on X1, . . . , Xi and Y1, . . . , Yi−1. Many cryptographic systems like block ciphers, MAC-schemes, pseudo-random functions, etc., can be modeled as random systems, where in fact Yi often depends only on Xi, i.e., the system is stateless. The security proof of such a system (e.g. a block cipher) amounts to showing that it is indistinguishable from a certain perfect system (e.g. a random permutation). We propose a general framework for proving the indistinguishability of two random systems, based on the concept of the equivalence of two systems, conditioned on certain events. This abstraction demonstrates the common denominator among many security proofs in the literature, allows to unify, simplify, generalize, and in some cases strengthen them, and opens the door to proving new indistinguishability results. We also propose the previously implicit concept of quasi-randomness and give an efficient construction of a quasi-random function which can be used as a building block in cryptographic systems based on pseudorandom functions.

Diabetes Data Analysis and Prediction Model Discovery Using RapidMiner <=SEP=> Data mining techniques have been extensively applied in bioinformatics to analyze biomedical data. In this paper, we choose the Rapid-I¿s RapidMiner as our tool to analyze a Pima Indians Diabetes Data Set, which collects the information of patients with and without developing diabetes. The discussion follows the data mining process. The focus will be on the data preprocessing, including attribute identification and selection, outlier removal, data normalization and numerical discretization, visual data analysis, hidden relationships discovery, and a diabetes prediction model construction.

You are what you like! Information leakage through users' Interests <=SEP=> Suppose that a Facebook user, whose age is hidden or missing, likes Britney Spears. Can you guess his/her age? Knowing that most Britney fans are teenagers, it is fairly easy for humans to answer this question. Interests (or “likes”) of users is one of the highly-available on-line information. In this paper, we show how these seemingly harmless interests (e.g., music interests) can leak privacysensitive information about users. In particular, we infer their undisclosed (private) attributes using the public attributes of other users sharing similar interests. In order to compare user-defined interest names, we extract their semantics using an ontologized version of Wikipedia and measure their similarity by applying a statistical learning method. Besides self-declared interests in music, our technique does not rely on any further information about users such as friend relationships or group belongings. Our experiments, based on more than 104K public profiles collected from Facebook and more than 2000 private profiles provided by volunteers, show that our inference technique efficiently predicts attributes that are very often hidden by users. To the best of our knowledge, this is the first time that user interests are used for profiling, and more generally, semantics-driven inference of private data is addressed.

Sentiment Adaptive End-to-End Dialog Systems <=SEP=> v This work focuses on incorporating sentiment information into task-oriented dialogue systems. v Current end-to-end approaches only consider user semantic inputs in learning and under-utilize other user information. v But the ultimate evaluator of dialog systems is the end-users and their sentiment is a direct reflection of user satisfaction and should be taken into consideration. v Therefore, we propose to include user sentiment obtained through multimodal information (acoustic, dialogic and textual), in the end-to-end learning framework to make systems more user-adaptive and effective. v We incorporated user sentiment information in both supervised and reinforcement learning settings. v In both settings, adding sentiment information reduced the dialog length and improved the task success rate on a bus information search task. Multimodal Sentiment Detector v We manually annotated 50 dialogs with 517 conversation turns to train this sentiment detector. The annotated set is open to public. v Prediction made by the detector will be used in the supervised learning and reinforcement learning. v Three sets of features: 1) Acoustic features; 2) Dialogic features; 3) Textual features. v Dialogic features include: 1) Interruption; 2) Button usage; 3) Repetitions; 4) Start over. These four categories of dialog features are chosen based on the previous literature and the observed statistics in the dataset.

Social Media for Opioid Addiction Epidemiology: Automatic Detection of Opioid Addicts from Twitter and Case Studies <=SEP=> Opioid (e.g., heroin and morphine) addiction has become one of the largest and deadliest epidemics in the United States. To combat such deadly epidemic, there is an urgent need for novel tools and methodologies to gain new insights into the behavioral processes of opioid abuse and addiction. The role of social media in biomedical knowledge mining has turned into increasingly significant in recent years. In this paper, we propose a novel framework named AutoDOA to automatically detect the opioid addicts from Twitter, which can potentially assist in sharpening our understanding toward the behavioral process of opioid abuse and addiction. In AutoDOA, to model the users and posted tweets as well as their rich relationships, a structured heterogeneous information network (HIN) is first constructed. Then meta-path based approach is used to formulate similarity measures over users and different similarities are aggregated using Laplacian scores. Based on HIN and the combined meta-path, to reduce the cost of acquiring labeled examples for supervised learning, a transductive classification model is built for automatic opioid addict detection. To the best of our knowledge, this is the first work to apply transductive classification in HIN into drug-addiction domain. Comprehensive experiments on real sample collections from Twitter are conducted to validate the effectiveness of our developed system AutoDOA in opioid addict detection by comparisons with other alternate methods. The results and case studies also demonstrate that knowledge from daily-life social media data mining could support a better practice of opioid addiction prevention and treatment.

Integrated Wideband Self-Interference Cancellation in the RF Domain for FDD and Full-Duplex Wireless <=SEP=> A fully integrated technique for wideband cancellation of transmitter (TX) self-interference (SI) in the RF domain is proposed for multiband frequency-division duplexing (FDD) and full-duplex (FD) wireless applications. Integrated wideband SI cancellation (SIC) in the RF domain is accomplished through: 1) a bank of tunable, reconfigurable second-order high-Q RF bandpass filters in the canceller that emulate the antenna interface's isolation (essentially frequency-domain equalization in the RF domain) and 2) a linear N-path Gm-C filter implementation with embedded variable attenuation and phase shifting. A 0.8-1.4 GHz receiver (RX) with the proposed wideband SIC circuits is implemented in a 65 nm CMOS process. In measurement, >20 MHz 20 dB cancellation bandwidth (BW) is achieved across frequency-selective antenna interfaces: 1) a custom-designed LTElike 0.780/0.895 GHz duplexer with TX/RX isolation peak magnitude of 30 dB, peak group delay of 11 ns, and 7 dB magnitude variation across the TX band for FDD and 2) a 1.4 GHz antenna pair for FD wireless with TX/RX isolation peak magnitude of 32 dB, peak group delay of 9 ns, and 3 dB magnitude variation over 1.36-1.38 GHz. For FDD, SIC enhances the effective outof-band (OOB) IIP3 and IIP2 to +25-27 dBm and +90 dBm, respectively (enhancements of 8-10 and 29 dB, respectively). For FD, SIC eliminates RX gain compression for as high as -8 dBm of peak in-band (IB) SI, and enhances effective IB IIP3 and IIP2 by 22 and 58 dB.

The analyse of the various methods for location of Data Matrix codes in images <=SEP=> Data Matrix codes belong to the group of 2-D bar codes, which are widely used in marking the products in storing, production, distribution and sales processes. Their compact matrix structure enables to store big amount of information in a very small area compared to conventional 1-D bar codes. In following paper we compare several methods for detection of Data Matrix codes in images. When locating the position of the code we start from typical bordering of Data Matrix code — which forms “L” so called Finder Pattern and to it the parallel dotting so called Timing Pattern. On the first stage we try to locate Finder Pattern using the edge detection or adaptive thresholding, then continuing with connecting the points into the continuous regions, we are searching for the regions, which could represent the Finder Pattern. On the second stage we verify Timing Pattern where the number of crossing between the background and foreground must be even.

Quorum responses and consensus decision making. <=SEP=> Animal groups are said to make consensus decisions when group members come to agree on the same option. Consensus decisions are taxonomically widespread and potentially offer three key benefits: maintenance of group cohesion, enhancement of decision accuracy compared with lone individuals and improvement in decision speed. In the absence of centralized control, arriving at a consensus depends on local interactions in which each individual's likelihood of choosing an option increases with the number of others already committed to that option. The resulting positive feedback can effectively direct most or all group members to the best available choice. In this paper, we examine the functional form of the individual response to others' behaviour that lies at the heart of this process. We review recent theoretical and empirical work on consensus decisions, and we develop a simple mathematical model to show the central importance to speedy and accurate decisions of quorum responses, in which an animal's probability of exhibiting a behaviour is a sharply nonlinear function of the number of other individuals already performing this behaviour. We argue that systems relying on such quorum rules can achieve cohesive choice of the best option while also permitting adaptive tuning of the trade-off between decision speed and accuracy.

No-reference image and video quality assessment: a classification and review of recent approaches <=SEP=> The field of perceptual quality assessment has gone through a wide range of developments and it is still growing. In particular, the area of no-reference (NR) image and video quality assessment has progressed rapidly during the last decade. In this article, we present a classification and review of latest published research work in the area of NR image and video quality assessment. The NR methods of visual quality assessment considered for review are structured into categories and subcategories based on the types of methodologies used for the underlying processing employed for quality estimation. Overall, the classification has been done into three categories, namely, pixel-based methods, bitstream-based methods, and hybrid methods of the aforementioned two categories. We believe that the review presented in this article will be helpful for practitioners as well as for researchers to keep abreast of the recent developments in the area of NR image and video quality assessment. This article can be used for various purposes such as gaining a structured overview of the field and to carry out performance comparisons for the state-of-the-art

Single-unit pattern generators for quadruped locomotion <=SEP=> Legged robots can potentially venture beyond the limits of wheeled vehicles. While creating controllers for such robots by hand is possible, evolutionary algorithms are an alternative that can reduce the burden of hand-crafting robotic controllers. Although major evolutionary approaches to legged locomotion can generate oscillations through popular techniques such as continuous time recurrent neural networks (CTRNNs) or sinusoidal input, they typically face a challenge in maintaining long-term stability. The aim of this paper is to address this challenge by introducing an effective alternative based on a new type of neuron called a single-unit pattern generator (SUPG). The SUPG, which is indirectly encoded by a compositional pattern producing network (CPPN) evolved by HyperNEAT, produces a flexible temporal activation pattern that can be reset and repeated at any time through an explicit trigger input, thereby allowing it to dynamically recalibrate over time to maintain stability. The SUPG approach, which is compared to CTRNNs and sinusoidal input, is shown to produce natural-looking gaits that exhibit superior stability over time, thereby providing a new alternative for evolving oscillatory locomotion.

A modular control scheme for PMSM speed control with pulsating torque minimization <=SEP=> In this paper, a modular control approach is applied to a permanent-magnet synchronous motor (PMSM) speed control. Based on the functioning of the individual module, the modular approach enables the powerfully intelligent and robust control modules to easily replace any existing module which does not perform well, meanwhile retaining other existing modules which are still effective. Property analysis is first conducted for the existing function modules in a conventional PMSM control system: proportional-integral (PI) speed control module, reference current-generating module, and PI current control module. Next, it is shown that the conventional PMSM controller is not able to reject the torque pulsation which is the main hurdle when PMSM is used as a high-performance servo. By virtue of the internal model, to nullify the torque pulsation it is imperative to incorporate an internal model in the feed-through path. This is achieved by replacing the reference current-generating module with an iterative learning control (ILC) module. The ILC module records the cyclic torque and reference current signals over one entire cycle, and then uses those signals to update the reference current for the next cycle. As a consequence, the torque pulsation can be reduced significantly. In order to estimate the torque ripples which may exceed certain bandwidth of a torque transducer, a novel torque estimation module using a gain-shaped sliding-mode observer is further developed to facilitate the implementation of torque learning control. The proposed control system is evaluated through real-time implementation and experimental results validate the effectiveness.

LIP ACTIVITY DETECTION FOR TALKING FACES CLASSIFICATION IN TV-CONTENT <=SEP=> Our objective is to index people in a TV-Content. In this context, because of multi-face shots and non-speaking face shots, it is difficult to determine which face is speaking. There is no guaranteed synchronization between sequences of a person’s appearance and sequences of his or her speech. In this work, we want to separate talking and non-talking faces by detecting lip motion. We propose a method to detect the lip motion by measuring the degree of disorder of pixel directions around the lip. Results of experiments on a TV-Show database show that a high correct classification rate can be achieved by the proposed method.

Genetic and environmental influences on sexual orientation and its correlates in an Australian twin sample. <=SEP=> We recruited twins systematically from the Australian Twin Registry and assessed their sexual orientation and 2 related traits: childhood gender nonconformity and continuous gender identity. Men and women differed in their distributions of sexual orientation, with women more likely to have slight-to-moderate degrees of homosexual attraction, and men more likely to have high degrees of homosexual attraction. Twin concordances for nonheterosexual orientation were lower than in prior studies. Univariate analyses showed that familial factors were important for all traits, but were less successful in distinguishing genetic from shared environmental influences. Only childhood gender nonconformity was significantly heritable for both men and women. Multivariate analyses suggested that the causal architecture differed between men and women, and, for women, provided significant evidence for the importance of genetic factors to the traits' covariation.

Modelling, Visualising and Summarising Documents with a Single Convolutional Neural Network <=SEP=> Capturing the compositional process which maps the meaning of words to that of documents is a central challenge for researchers in Natural Language Processing and Information Retrieval. We introduce a model that is able to represent the meaning of documents by embedding them in a low dimensional vector space, while preserving distinctions of word and sentence order crucial for capturing nuanced semantics. Our model is based on an extended Dynamic Convolution Neural Network, which learns convolution filters at both the sentence and document level, hierarchically learning to capture and compose low level lexical features into high level semantic concepts. We demonstrate the effectiveness of this model on a range of document modelling tasks, achieving strong results with no feature engineering and with a more compact model. Inspired by recent advances in visualising deep convolution networks for computer vision, we present a novel visualisation technique for our document networks which not only provides insight into their learning process, but also can be interpreted to produce a compelling automatic summarisation system for texts.

The Computable News project: Research in the Newsroom <=SEP=> We report on a four year academic research project to build a natural language processing platform in support of a large media company. The Computable News platform processes news stories, producing a layer of structured data that can be used to build rich applications. We describe the underlying platform and the research tasks that we explored building it. The platform supports a wide range of prototype applications designed to support different newsroom functions. We hope that this qualitative review provides some insight into the challenges involved in this type of project.

A language modeling framework for resource selection and results merging <=SEP=> Statistical language models have been proposed recently for several information retrieval tasks, including the resource selection task in distributed information retrieval. This paper extends the language modeling approach to integrate resource selection, ad-hoc searching, and merging of results from different text databases into a single probabilistic retrieval model. This new approach is designed primarily for Intranet environments, where it is reasonable to assume that resource providers are relatively homogeneous and can adopt the same kind of search engine. Experiments demonstrate that this new, integrated approach is at least as effective as the prior state-of-the-art in distributed IR.

A Literature Review on the Design of Spherical Rolling Robots <=SEP=> There are many advantages to the use of spherical robot designs. The current status of the design of spherical rolling robots is reviewed.

Frontal fibrosing alopecia: a clinical review of 36 patients. <=SEP=> BACKGROUND
Frontal fibrosing alopecia (FFA) is a primary lymphocytic cicatricial alopecia with a distinctive clinical pattern of progressive frontotemporal hairline recession. Currently, there are no evidence-based studies to guide treatment for patients with FFA; thus, treatment options vary among clinicians.


OBJECTIVES
We report clinical findings and treatment outcomes of 36 patients with FFA, the largest cohort to date. Further, we report the first evidence-based study of the efficacy of hydroxychloroquine in FFA using a quantitative clinical score, the Lichen Planopilaris Activity Index (LPPAI).


METHODS
A retrospective case note review was performed of 36 adult patients with FFA. Data were collected on demographics and clinical findings. Treatment responses to hydroxychloroquine, doxycycline and mycophenolate mofetil were assessed using the LPPAI. Adverse events were monitored.


RESULTS
Most patients in our cohort were female (97%), white (92%) and postmenopausal (83%). Apart from hairline recession, 75% also reported eyebrow loss. Scalp pruritus (67%) and perifollicular erythema (86%) were the most common presenting symptom and sign, respectively. A statistically significant reduction in signs and symptoms in subjects treated with hydroxychloroquine (P < 0·05) was found at both 6- and 12-month follow up.


CONCLUSIONS
In FFA, hairline recession, scalp pruritus, perifollicular erythema and eyebrow loss are common at presentation. Despite the limitations of a retrospective review, our data reveal that hydroxychloroquine is significantly effective in reducing signs and symptoms of FFA after both 6 and 12 months of treatment. However, the lack of a significant reduction in signs and symptoms between 6 and 12 months indicates that the maximal benefits of hydroxychloroquine are evident within the first 6 months of use.

Incorporating Entity Correlation Knowledge into Topic Modeling <=SEP=> Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for exploring hidden topics in text corpora. Standard LDA model suffers the problem that the topic assignment of each word is independent and lacks the mechanism to utilize the rich prior background knowledge to learn semantically coherent topics. To address this problem, in this paper, we propose a model called Entity Correlation Latent Dirichlet Allocation (EC-LDA) by incorporating constraints derived from entity correlations as the prior knowledge into LDA topic model. Different from other knowledge-based topic models which extract the knowledge information directly from the train dataset itself or even from the human judgements, for our work, we take advantage of the prior knowledge from the external knowledge base (Freebase 1, in our experiment). Hence, our approach is more suitable to widely kinds of text corpora in different scenarios. We fit our proposed model using Gibbs sampling. Experiment results demonstrate the effectiveness of our model compared with standard LDA.

Learning by Googling <=SEP=> The goal of giving a well-defined meaning to information is currently shared by endeavors such as the Semantic Web as well as by current trends within Knowledge Management. They all depend on the large-scale formalization of knowledge and on the availability of formal metadata about information resources. However, the question how to provide the necessary formal metadata in an effective and efficient way is still not solved to a satisfactory extent. Certainly, the most effective way to provide such metadata as well as formalized knowledge is to let humans encode them directly into the system, but this is neither efficient nor feasible. Furthermore, as current social studies show, individual knowledge is often less powerful than the collective knowledge of a certain community.As a potential way out of the knowledge acquisition bottleneck, we present a novel methodology that acquires collective knowledge from the World Wide Web using the GoogleTM API. In particular, we present PANKOW, a concrete instantiation of this methodology which is evaluated in two experiments: one with the aim of classifying novel instances with regard to an existing ontology and one with the aim of learning sub-/superconcept relations.