Question: Recognizing music emotions: understanding the significance of individual differences.

In the 21st century, the field of psychological testing and assessment is poised to undergo a significant transformation, influenced by advancements in cognitive and neurosciences. Clinical neuropsychologists will increasingly employ biological tests that quantitatively measure individual variations in brain function at the neuromolecular, neurophysiologic, and neurochemical levels. The focus of patient assessment will shift from diagnosis to optimizing the use of intact cognitive functions and finding ways to rehabilitate or circumvent impaired ones. The future will also see the widespread adoption of refined scales for evaluating personal competency, adaptive behavior, and overall quality of life, replacing or improving upon current methods. For the general population, new iterations of paper-and-pencil inventories, alongside biological assessments, will be used to identify differences in interests, attitudes, personality traits, and predispositions, reflecting a more comprehensive understanding of individuality.

**Question**: The effectiveness of a new teaching method on student learning

**Documents**: The role of feedback in the teaching and learning process
Feedback is a critical component in the teaching and learning process. It is the information provided by an involved person (teacher, peer, self, experience, or environment) regarding aspects of one's performance or characteristics. Feedback can be positive, reinforcing correct behavior, or negative, providing information on how to improve. Feedback is not just a one-way street; it involves a sender and a receiver. For feedback to be effective, it must be specific, timely, and relevant to the learner. It should also be constructive, focusing on the behavior rather than the person, and should be given in a supportive and non-judgmental manner. Feedback can take many forms, including verbal, written, visual, or through performance. It can be given by the teacher, peers, or self-assessment. The type of feedback and the way it is given can significantly influence the learning process and the learner's motivation.

**Similar Documents**:

Feedback serves as a pivotal element in the educational process, acting as a conduit for information that pertains to a learner's performance or traits. This information can originate from various sources, including teachers, peers, self-assessment, experiences, or the learning environment. Feedback can be positive, serving to reinforce accurate behaviors, or negative, offering guidance on areas for improvement. It is not a unidirectional communication but rather an interactive exchange between a sender and a recipient. For feedback to be impactful, it must be precise, timely, and pertinent to the student's needs. It should be constructive, concentrating on the action rather

Recent work introduced the notion of emotional challenge as a means to afford more unique and diverse gaming experiences. However, players' experience of emotional challenge has received little empirical attention. It remains unclear whether players enjoy it and what exactly constitutes the challenge thereof. We surveyed 171 players about a challenging or an emotionally challenging experience, and analyzed their responses with regards to what made the experience challenging, their emotional response, and the relation to core player experience constructs. We found that emotional challenge manifested itself in different ways, by confronting players with difficult themes or decisions, as well as having them deal with intense emotions. In contrast to more'conventional' challenge, emotional challenge evoked a wider range of negative emotions and was appreciated significantly more by players. Our findings showcase the appeal of uncomfortable gaming experiences, and extend current conceptualizations of challenge in games.

In a sample of 127 Spanish adolescents, the ability to understand and manage emotions, assessed by a performance measure of emotional intelligence (the MSCEIT), correlated positively with teacher ratings of academic achievement and adaptation for both males and females. Among girls, these emotional abilities also correlated positively with peer friendship nominations. After controlling for IQ and the Big Five personality traits, the ability to understand and manage emotions remained significantly associated with teacher ratings of academic adaptation among boys and peer friendship nominations among girls. Self-perceived emotional intelligence was unrelated to these criteria. These findings provide partial support for hypotheses that emotional abilities are associated with indicators of social and academic adaptation to school.

With advances in physiological sensors, we are able to understand people's physiological status and recognize stress to provide beneficial services. Despite the great potential in physiological stress recognition, there are some critical issues that need to be addressed such as the sensitivity and variability of physiology to many factors other than stress (e.g., physical activity). To resolve these issues, in this paper, we focus on the understanding of physiological responses to both stressor and physical activity and perform stress recognition, particularly in situations having multiple stimuli: physical activity and stressors. We construct stress models that correspond to individual situations, and we validate our stress modeling in the presence of physical activity. Analysis of our experiments provides an understanding on how physiological responses change with different stressors and how physical activity confounds stress recognition with physiological responses. In both objective and subjective settings, the accuracy of stress recognition drops by more than 14% when physical activity is performed. However, by modularizing stress models with respect to physical activity, we can recognize stress with accuracies of 82% (objective stress) and 87% (subjective stress), achieving more than a 5-10% improvement from approaches that do not take physical activity into account.

Access to expressions of subjective personal posts increased with the popularity of Social Media. However, most of the work in sentiment analysis focuses on predicting only valence from text and usually targeted at a product, rather than affective states. In this paper, we introduce a new data set of 2895 Social Media posts rated by two psychologicallytrained annotators on two separate ordinal nine-point scales. These scales represent valence (or sentiment) and arousal (or intensity), which defines each post’s position on the circumplex model of affect, a well-established system for describing emotional states (Russell, 1980; Posner et al., 2005). The data set is used to train prediction models for each of the two dimensions from text which achieve high predictive accuracy – correlated at r = .65 with valence and r = .85 with arousal annotations. Our data set offers a building block to a deeper study of personal affect as expressed in social media. This can be used in applications such as mental illness detection or in automated large-scale psychological studies.

The explosion of user-generated, untagged multimedia data in recent years, generates a strong need for efficient search and retrieval of this data. The predominant method for content-based tagging is through slow, labour-intensive manual annotation. Consequently, automatic tagging is currently a subject of intensive research. However, it is clear that the process will not be fully automated in the foreseeable future. We propose to involve the user and investigate methods for implicit tagging, wherein users’ responses to the interaction with the multimedia content are analysed in order to generate descriptive tags. Here, we present a multi-modal approach that analyses both facial expressions and Electroencephalography(EEG) signals for the generation of affective tags. We perform classification and regression in the valence-arousal space and present results for both feature-level and decision-level fusion. We demonstrate improvement in the results when using both modalities, suggesting the modalities contain complementary information.

We used a new theory of the biological basis of the Big Five personality traits to generate hypotheses about the association of each trait with the volume of different brain regions. Controlling for age, sex, and whole-brain volume, results from structural magnetic resonance imaging of 116 healthy adults supported our hypotheses for four of the five traits: Extraversion, Neuroticism, Agreeableness, and Conscientiousness. Extraversion covaried with volume of medial orbitofrontal cortex, a brain region involved in processing reward information. Neuroticism covaried with volume of brain regions associated with threat, punishment, and negative affect. Agreeableness covaried with volume in regions that process information about the intentions and mental states of other individuals. Conscientiousness covaried with volume in lateral prefrontal cortex, a region involved in planning and the voluntary control of behavior. These findings support our biologically based, explanatory model of the Big Five and demonstrate the potential of personality neuroscience (i.e., the systematic study of individual differences in personality using neuroscience methods) as a discipline.

This paper describes a public web service for active music listening,Songle, that enriches music listening experiences by using music-understanding technologies based on signal processing. Although various research-level interfaces and technologies have been developed, it has not been easy to get people to use them in everyday life. Songle serves as a showcase to demonstrate how people can benefit from music-understanding technologies by enabling people to experience active music listening interfaces on the web. Songle facilitates deeper understanding of music by visualizing music scene descriptions estimated automatically, such as music structure, hierarchical beat structure, melody line, and chords. When using music-understanding technologies, however, estimation errors are inevitable. Songle therefore features an efficient error correction interface that encourages people to contribute by correcting those errors to improve the web service. We also propose a mechanism of collaborative training for music-understanding technologies, in which corrected errors will be used to improve the music-understanding performance through machine learning techniques. We hope Songle will serve as a research platform where other researchers can exhibit results of their music-understanding technologies to jointly promote the popularization of the field of music information research.

Affective computing is currently one of the most active research topics, furthermore, having increasingly intensive attention. This strong interest is driven by a wide spectrum of promising applications in many areas such as virtual reality, smart surveillance, perceptual interface, etc. Affective computing concerns multidisciplinary knowledge background such as psychology, cognitive, physiology and computer sciences. The paper is emphasized on the several issues involved implicitly in the whole interactive feedback loop. Various methods for each issue are discussed in order to examine the state of the art. Finally, some research challenges and future directions are also discussed.

We develop a method for emotion recognition from facial imagery. This problem is challenging in part because of the subjectivity of ground truth labels and in part because of the relatively small size of existing labeled datasets. We use the FER+ dataset [8], a dataset with multiple emotion labels per image, in order to build an emotion recognition model that encompasses a full range of emotions. Since the amount of data in the FER+ dataset is limited, we explore the use of a much larger face dataset, MS-Celeb-1M [41], in conjunction with the FER+ dataset. Specific layers within an Inception-ResNet-v1 [13, 38] model trained for facial recognition are used for the emotion recognition problem. Thus, we leverage the MS-Celeb-1M dataset in addition to the FER+ dataset and experiment with different architectures to assess the overall performance of neural networks to recognize emotion using facial imagery.

Multimodal recognition of affective states is a difficult problem, unless the recording conditions are carefully controlled. For recognition “in the wild”, large variances in face pose and illumination, cluttered backgrounds, occlusions, audio and video noise, as well as issues with subtle cues of expression are some of the issues to target. In this paper, we describe a multimodal approach for video-based emotion recognition in the wild. We propose using summarizing functionals of complementary visual descriptors for video modeling. These features include deep convolutional neural network (CNN) based features obtained via transfer learning, for which we illustrate the importance of flexible registration and fine-tuning. Our approach combines audio and visual features with least squares regression based classifiers and weighted score level fusion. We report state-of-the-art results on the EmotiW Challenge for “in the wild” facial expression recognition. Our approach scales to other problems, and ranked top in the ChaLearn-LAP First Impressions Challenge 2016 from video clips collected in the wild.


Question: Music emotion recognition: exploring the significance of individual differences.

This paper delves into the automatic classification of audio signals into a hierarchical structure of musical genres, aiming to facilitate music information retrieval and content-based analysis. Musical genres serve as human-generated labels that encapsulate shared characteristics among pieces of music, encompassing aspects such as instrumentation, rhythmic patterns, and harmonic structures. These labels are pivotal for organizing vast music repositories online. Traditionally, genre annotation is a manual process, but automating this task could significantly streamline the classification process and enhance music information retrieval systems. Moreover, it offers a platform for refining and evaluating features crucial for the analysis of musical signals. The paper proposes three distinct feature sets to represent timbral texture, rhythmic content, and pitch content of audio signals. Through the application of statistical pattern recognition classifiers to real-world audio data, the study evaluates the performance and significance of these proposed features. Two classification methods are explored: one that analyzes entire audio files and another that operates in real-time on frames of the audio signal. Utilizing the devised feature sets, the paper reports an impressive classification accuracy of 61% for ten musical genres, a figure that aligns closely with human classification capabilities. This research underscores the potential of automatic genre classification to augment human efforts in music categorization and analysis.

This study investigated the usefulness of the five-factor model (FFM) of personality in predicting two aspects of managerial performance (task vs. contextual) assessed by utilizing the 360 degree performance rating system. The authors speculated that one reason for the low validity of the FFM might be the failure of single-source (e.g., supervisor) ratings to comprehensively capture the construct of managerial performance. The operational validity of personality was found to increase substantially (50%-74%) across all of the FFM personality traits when both peer and subordinate ratings were added to supervisor ratings according to the multitrait-multimethod approach. Furthermore, the authors responded to the recent calls to validate tests via a multivariate (e.g., multitrait-multimethod) approach by decomposing overall managerial performance into task and contextual performance criteria and by using multiple rating perspectives (sources). Overall, this study contributes to the evidence that personality may be even more useful in predicting managerial performance if the performance criteria are less deficient.

Student engagement is a key concept in contemporary education, where it is valued as a goal in its own right. In this paper we explore approaches for automatic recognition of engagement from students' facial expressions. We studied whether human observers can reliably judge engagement from the face; analyzed the signals observers use to make these judgments; and automated the process using machine learning. We found that human observers reliably agree when discriminating low versus high degrees of engagement (Cohen's κ = 0.96). When fine discrimination is required (four distinct levels) the reliability decreases, but is still quite high ( κ = 0.56). Furthermore, we found that engagement labels of 10-second video clips can be reliably predicted from the average labels of their constituent frames (Pearson r=0.85), suggesting that static expressions contain the bulk of the information used by observers. We used machine learning to develop automatic engagement detectors and found that for binary classification (e.g., high engagement versus low engagement), automated engagement detectors perform with comparable accuracy to humans. Finally, we show that both human and automatic engagement judgments correlate with task performance. In our experiment, student post-test performance was predicted with comparable accuracy from engagement labels ( r=0.47) as from pre-test scores ( r=0.44).

Current theories of emotion perception posit that basic facial expressions signal categorically discrete emotions or affective dimensions of valence and arousal. In both cases, the information is thought to be directly "read out" from the face in a way that is largely immune to context. In contrast, the three studies reported here demonstrated that identical facial configurations convey strikingly different emotions and dimensional values depending on the affective context in which they are embedded. This effect is modulated by the similarity between the target facial expression and the facial expression typically associated with the context. Moreover, by monitoring eye movements, we demonstrated that characteristic fixation patterns previously thought to be determined solely by the facial expression are systematically modulated by emotional context already at very early stages of visual processing, even by the first time the face is fixated. Our results indicate that the perception of basic facial expressions is not context invariant and can be categorically altered by context at early perceptual levels.

While accurately predicting mood and wellbeing could have a number of important clinical benefits, traditional machine learning (ML) methods frequently yield low performance in this domain. We posit that this is because a one-size-fits-all machine learning model is inherently ill-suited to predicting outcomes like mood and stress, which vary greatly due to individual differences. Therefore, we employ Multitask Learning (MTL) techniques to train personalized ML models which are customized to the needs of each individual, but still leverage data from across the population. Three formulations of MTL are compared: i) MTL deep neural networks, which share several hidden layers but have final layers unique to each task; ii) Multi-task Multi-Kernel learning, which feeds information across tasks through kernel weights on feature types; and iii) a Hierarchical Bayesian model in which tasks share a common Dirichlet Process prior. We offer the code for this work in open source. These techniques are investigated in the context of predicting future mood, stress, and health using data collected from surveys, wearable sensors, smartphone logs, and the weather. Empirical results demonstrate that using MTL to account for individual differences provides large performance improvements over traditional machine learning methods and provides personalized, actionable insights.

In literary and drama criticism, emotions, and moral emotions in particular, have been pointed out as one of characterizing features of stories. In this paper, we propose to model story characters as value-based emotional agents, who appraise their own and others’ actions based on their desires and values, and feel the appropriate moral emotions in response to narrative situations that challenge their goals and values. In order to validate the appropriateness of the agent model for narrative characters, we ran an experiment with human participants aimed at comparing their expectations about characters’ emotions with the predictions of the value-based model of emotional agent. The results of the experiment show that the participants’ expectations meet the predictions of the model. 1998 ACM Subject Classification I.2.11 Intelligent Agents, I.2.0 Cognitive Simulation

In this paper, we address the tasks of recognition and interpretation of affect communicated through text messaging in online communication environments. Specifically, we focus on Instant Messaging (IM) or blogs, where people use an informal or garbled style of writing. We introduced a novel rule-based linguistic approach for affect recognition from text. Our Affect Analysis Model (AAM) was designed to deal with not only grammatically and syntactically correct textual input, but also informal messages written in an abbreviated or expressive manner. The proposed rule-based approach processes each sentence in stages, including symbolic cue processing, detection and transformation of abbreviations, sentence parsing and word/phrase/sentence-level analyses. Our method is capable of processing sentences of different complexity, including simple, compound, complex (with complement and relative clauses) and complex–compound sentences. Affect in text is classified into nine emotion categories (or neutral). The strength of the resulting emotional state depends on vectors of emotional words, relations among them, tense of the analysed sentence and availability of first person pronouns. The evaluation of the Affect Analysis Model algorithm showed promising results regarding its capability to accurately recognize fine-grained emotions reflected in sentences from diary-like blog posts (averaged accuracy is up to 77 per cent), fairy tales (averaged accuracy is up to 70.2 per cent) and news headlines (our algorithm outperformed eight other systems on several measures).

Emotion recognition from speech plays an important role in developing affective and intelligent systems. This study investigates sentence-level emotion recognition. We propose to use a two-step approach to leverage information from subsentence segments for sentence level decision. First we use a segment level emotion classifier to generate predictions for segments within a sentence. A second component combines the predictions from these segments to obtain a sentence level decision. We evaluate different segment units (words, phrases, time-based segments) and different decision combination methods (majority vote, average of probabilities, and a Gaussian Mixture Model (GMM)). Our experimental results on two different data sets show that our proposed method significantly outperforms the standard sentence-based classification approach. In addition, we find that using time-based segments achieves the best performance, and thus no speech recognition or alignment is needed when using our method, which is important to develop language independent emotion recognition systems.

The interaction between human beings and computers will be more natural if computers are able to perceive and respond to human non-verbal communication such as emotions. Although several approaches have been proposed to recognize human emotions based on facial expressions or speech, relatively limited work has been done to fuse these two, and other, modalities to improve the accuracy and robustness of the emotion recognition system. This paper analyzes the strengths and the limitations of systems based only on facial expressions or acoustic information. It also discusses two approaches used to fuse these two modalities: decision level and feature level integration. Using a database recorded from an actress, four emotions were classified: sadness, anger, happiness, and neutral state. By the use of markers on her face, detailed facial motions were captured with motion capture, in conjunction with simultaneous speech recordings. The results reveal that the system based on facial expression gave better performance than the system based on just acoustic information for the emotions considered. Results also show the complementarily of the two modalities and that when these two modalities are fused, the performance and the robustness of the emotion recognition system improve measurably.

The study of voice perception in congenitally blind individuals allows researchers rare insight into how a lifetime of visual deprivation affects the development of voice perception. Previous studies have suggested that blind adults outperform their sighted counterparts in low-level auditory tasks testing spatial localization and pitch discrimination, as well as in verbal speech processing; however, blind persons generally show no advantage in nonverbal voice recognition or discrimination tasks. The present study is the first to examine whether visual experience influences the development of social stereotypes that are formed on the basis of nonverbal vocal characteristics (i.e., voice pitch). Groups of 27 congenitally or early-blind adults and 23 sighted controls assessed the trustworthiness, competence, and warmth of men and women speaking a series of vowels, whose voice pitches had been experimentally raised or lowered. Blind and sighted listeners judged both men's and women's voices with lowered pitch as being more competent and trustworthy than voices with raised pitch. In contrast, raised-pitch voices were judged as being warmer than were lowered-pitch voices, but only for women's voices. Crucially, blind and sighted persons did not differ in their voice-based assessments of competence or warmth, or in their certainty of these assessments, whereas the association between low pitch and trustworthiness in women's voices was weaker among blind than sighted participants. This latter result suggests that blind persons may rely less heavily on nonverbal cues to trustworthiness compared to sighted persons. Ultimately, our findings suggest that robust perceptual associations that systematically link voice pitch to the social and personal dimensions of a speaker can develop without visual input.

The advances in automatic facial expression recognition make possible to mine and characterize large amounts of data, opening a wide research domain on behavioral understanding. In this paper, we leverage the use of a state-of-the-art facial expression recognition technology to characterize users of a popular type of online social video, conversational vlogs. First, we propose the use of several activity cues to characterize vloggers based on frame-by-frame estimates of facial expressions of emotion. Then, we present results for the task of automatically predicting vloggers' personality impressions using facial expressions and the Big-Five traits. Our results are promising, specially for the case of the Extraversion impression, and in addition our work poses interesting questions regarding the representation of multiple natural facial expressions occurring in conversational video.


Question: Music emotion recognition: exploring the significance of individual differences.

This paper explores the enhancement of the K-nearest neighbor (KNN) algorithm through the incorporation of fuzzy set theory, a significant development in the field of classification and pattern recognition. In scenarios where the complete probability distribution is known, Bayes decision theory offers the lowest possible error rate. However, when such information is unavailable, distance or similarity measures between samples become crucial for classification tasks. The KNN algorithm is widely used in pattern recognition, but it treats all labeled samples equally when determining the class of an unknown pattern, without considering their 'typicalness' or representativeness. To address this limitation, a fuzzy KNN algorithm is proposed. This novel approach assigns fuzzy memberships to the labeled samples using three distinct methods, aiming to improve classification accuracy by accounting for the 'typicalness' of samples. The paper includes experimental results and a comparison with the traditional, non-fuzzy KNN algorithm, demonstrating the potential benefits of the fuzzy KNN in various classification scenarios.

**Question**: The role of individuality in music emotion recognition

**Documents**: Emotion Recognition in Music: An Individual Differences Perspective
Music is a universal language that can evoke a wide range of emotions in listeners. The recognition of these emotions in music is not only influenced by the music itself but also by the individual characteristics of the listener, including their personality, mood, and past experiences. This paper explores the role of individual differences in music emotion recognition. The study involves collecting data on participants' emotional responses to a diverse set of musical pieces and analyzing how these responses correlate with individual traits such as age, gender, and personality. The results suggest that individual differences significantly impact how emotions in music are perceived and interpreted. For example, extraverted individuals may perceive more positive emotions in music compared to introverted individuals. The findings highlight the importance of considering individual characteristics when studying music emotion recognition and offer insights into the complex relationship between music and human emotions.

**Similar Documents**: This research delves into the nuanced interplay between individual characteristics and the perception of emotions in music, underscoring the multifaceted nature of music emotion recognition. It is acknowledged that music has the capacity to elicit a broad spectrum of emotional responses, and these responses are not solely determined by the music's intrinsic properties. Instead, the listener's personality, current mood, and personal history significantly influence their emotional experience. The investigation focuses on gathering data regarding the emotional reactions of participants to a variety of musical compositions and assessing how these reactions align with individual attributes like age, gender, and personality traits. The analysis reveals

We present a computational framework for understanding the social aspects of emotions in Twitter conversations. Using unannotated data and semisupervised machine learning, we look at emotional transitions, emotional influences among the conversation partners, and patterns in the overall emotional exchanges. We find that conversational partners usually express the same emotion, which we name Emotion accommodation, but when they do not, one of the conversational partners tends to respond with a positive emotion. We also show that tweets containing sympathy, apology, and complaint are significant emotion influencers. We verify the emotion classification part of our framework by a human-annotated corpus.

The face is one of the most powerful channels of nonverbal communication. Facial expression provides cues about emotion, intention, alertness, pain, personality, regulates interpersonal behavior, and communicates psychiatric and biomedical status among other functions. Within the past 15 years, there has been increasing interest in automated facial expression analysis within the computer vision and machine learning communities. This chapter reviews fundamental approaches to facial measurement by behavioral scientists and current efforts in automated facial expression recognition. We consider challenges, review databases available to the research community, approaches to feature detection, tracking, and representation, and both supervised and unsupervised learning. keywords : Facial expression analysis, Action unit recognition, Active Appearance Models, temporal clustering.

Performance variabilit y in speech and speaker recognition systems can be attributed to many factors. One major factor, which is often acknowledged but seldom analyzed, is inherent differences in the recognizabilit y of different speakers. In speaker recognition systems such differences are characterized by the use of animal names for different types of speakers, including sheep, goats, lambs and wolves, depending on their behavior with respect to automatic recognition systems. In this paper we propose statistical tests for the existence of these animals and apply these tests to hunt for such animals using results from the 1998 NIST speaker recognition evaluation.

The ability to classify the genre of a song is an easy task for the human ear. After listening to a song for just several seconds, it is often not difficult to take note of that song’s characteristics and subsequently identify this genre. However, this task is one that computers have historically not been able to solve well, at least not until the advent of more sophisticated machine learning techniques. Our team explored several of these techniques over the course of this project and successfully built a system that achieves 61.873% accuracy in classifying music genres. This paper discusses the methods we used for exploratory data analysis, feature selection, hyperparameter optimization, and eventual implementation of several algorithms for classification.

Content-based music genre classification is a fundamental component of music information retrieval systems and has been gaining importance and enjoying a growing amount of attention with the emergence of digital music on the Internet. Currently little work has been done on automatic music genre classification, and in addition, the reported classification accuracies are relatively low. This paper proposes a new feature extraction method for music genre classification, DWCHs. DWCHs stands for Daubechies Wavelet Coefficient Histograms. DWCHs capture the local and global information of music signals simultaneously by computing histograms on their Daubechies wavelet coefficients. Effectiveness of this new feature and of previously studied features are compared using various machine learning classification algorithms, including Support Vector Machines and Linear Discriminant Analysis. It is demonstrated that the use of DWCHs significantly improves the accuracy of music genre classification.

The paper describes an experimental study on the detection of emotion from speech. As computer based characters such as avatars and virtual chat faces become more common, the use of emotion to drive the expression of the virtual characters become more important. The study utilizes a corpus containing emotional speech with 721 short utterances expressing four emotions: anger, happiness, sadness, and the neutral (unemotional) state, which were captured manually from movies and teleplays. We introduce a new concept to evaluate emotions in speech. Emotions are so complex that most speech sentences cannot be precisely assigned into a particular emotion category; however, most emotional states nevertheless can be described as a mixture of multiple emotions. Based on this concept we have trained SVMs (support vector machines) to recognize utterances within these four categories and developed an agent that can recognize and express emotions.

Music has been shown to have a profound effect on listeners’ internal states as evidenced by neuroscience research. Listeners report selecting and listening to music with specific intent, thereby using music as a tool to achieve desired psychological effects within a given context. In light of these observations, we argue that music information retrieval research must revisit the dominant assumption that listening to music is only an end unto itself. Instead, researchers should embrace the idea that music is also a technology used by listeners to achieve a specific desired internal state, given a particular set of circumstances and a desired goal. This paper focuses on listening to music in isolation (i.e., when the user listens to music by themselves with headphones) and surveys research from the fields of social psychology and neuroscience to build a case for a new line of research in music information retrieval on the ability of music to produce flow states in listeners. We argue that interdisciplinary collaboration is necessary in order to develop the understanding and techniques necessary to allow listeners to exploit the full potential of music as psychological technology.

Current affective user experience studies require both laborious and time-consuming data analysis, as well as dedicated affective classification algorithms. Moreover, the high technical complexity and lack of general guidelines for developing these affective classification algorithms further limits the comparability of the obtained results. In this paper we target this issue by presenting a tool capable of automatically annotating and triangulating players' physiologically interpreted emotional reactions to in-game events. This tool was initially motivated by an experimental psychology study regarding the emotional habituation effects of audio-visual stimuli in digital games and we expect it to contribute in future similar studies by providing both a deeper and more objective analysis on the affective aspects of user experience. We also hope it will contribute towards the rapid implementation and accessibility of this type of studies by open-sourcing it. Throughout this paper we describe the development and benefits presented by our tool, which include: enabling researchers to conduct objective a posteriori analyses without disturbing the gameplay experience, automating the annotation and emotional response identification process, and formatted data exporting for further analysis in third-party statistical software applications.

Multimodal recognition of affective states is a difficult problem, unless the recording conditions are carefully controlled. For recognition “in the wild”, large variances in face pose and illumination, cluttered backgrounds, occlusions, audio and video noise, as well as issues with subtle cues of expression are some of the issues to target. In this paper, we describe a multimodal approach for video-based emotion recognition in the wild. We propose using summarizing functionals of complementary visual descriptors for video modeling. These features include deep convolutional neural network (CNN) based features obtained via transfer learning, for which we illustrate the importance of flexible registration and fine-tuning. Our approach combines audio and visual features with least squares regression based classifiers and weighted score level fusion. We report state-of-the-art results on the EmotiW Challenge for “in the wild” facial expression recognition. Our approach scales to other problems, and ranked top in the ChaLearn-LAP First Impressions Challenge 2016 from video clips collected in the wild.

In this paper, the impact of gender and Big Five personality factors (Openness, Conscientiousness, Extraversion, Agreeableness and Neuroticism) on visual media preferences (for comedy, horror, action, romance and fantasy film genres) was examined. The analyses were carried out using data collected by Stillwell’s (2007) myPersonality application on Facebook; and focused on a sub-sample of British residents aged 16-25 (n=29,197). It was confirmed that females prefer romantic films, whereas males favour action films. As predicted, there was also a marked interaction between gender and personality characteristics: females score higher on Neuroticism and Agreeableness than males. Individuals scoring high on the dimension of Openness were more likely to prefer comedy and fantasy films than romantic films. Conscientious individuals were more inclined to enjoy action and romance genres. Individuals scoring high on Neuroticism tended to prefer romantic films. Finally, significant interactions were noted between gender and Openness with regard to preferences for comedy, action and romance genres. Overall, it is certain that the combination of gender and Big Five personality factors contributes substantially to an understanding of people’s film preferences. GENDER, PERSONALITY AND FILM PREFERENCES 3 Assessing the impact of Gender and Personality on Film Preferences Do comedies have a sexually differentiated public? Are males and females who enjoy horror films similar in terms of personality? Regardless of gender, do personality characteristics influence preference for the fantasy genre? In the present study, we have attempted to provide a meaningful answer to the aforementioned set of questions, based on the analysis of gender and personality interactions with regard to film preferences. In an attempt to complement previous research findings, we focused our analysis on the role of sex and personality in film preferences for British Facebook users aged 16-25. We paid attention to their scores on online Big Five personality questionnaires and their stated gender, using both single and multivariate measures to relate the two variables to film preferences, also listed on their profiles. The following hypotheses were tested: 1. Females and males differ with regard to film preferences. 2. Personality characteristics differ according to gender. 3. Film preferences vary in accordance with personality characteristics. 4. There is a significant interaction between gender and personality with regard to film preferences. the explanatory potential of online social networks Online social networks are mass repositories of valuable social and psychological information for researchers. Facebook, ranked as the most popular social network by worldwide monthly users, hosts for instance more than 400 million user profiles, in which individuals’ number of friends, media content preferences and socio-demographic background– amongst other things are displayed. Their systematic use for data collection purposes is a relatively recent trend in social psychological research; Stillwell’s creation of the myPersonality application (2007) on Facebook is a striking exemplar of the considerable explanatory potential of those online social networks. With myPersonality, users can take an online version of the Big Five personality questionnaire and agree to share their profile information for research purposes. As such, users’ personalities can be matched to any other single or collection of individual information available on Facebook, opening up an array of possible areas of investigation. GENDER, PERSONALITY AND FILM PREFERENCES 4 the predominance of visual media The appeal of visual media is easily demonstrated in terms of the importance it has in the lives of most individuals. Data from the National Survey of Culture, Leisure and Sport (2007) indicates that watching television is the most common leisure activity for over eight out of ten men and women in England, taking precedence over spending time with friends and family, sport, etc. Another intriguing finding relates to TV and movie watching online: the number of Britons visiting such websites reached 21 million in 2007. Although it is clear that many people enjoy visual media offerings, it is much more difficult to pinpoint the specific viewer characteristics that predict genre enjoyment. In other words, who prefers which type of content? visual media content: an explanation of viewer preferences Initially the domain of inquiry of communication theorists, media preferences and their determinants are increasingly studied from the vantage point of a variety of disciplines, amongst which psychology and sociology feature predominantly (Kraaykamp et al, 2005). Their combined explanatory potential finds its articulation in the uses and gratification approach (Blumler & Katz, 1974; Rosengreen & Windhal, 1989), according to which preferences for specific media and/or specific content result from an individual’s psychological and social attributes. gender differences in media content preferences Research on media preferences has paid notable attention to sex differences in responses to different types of film. It has been established that various movie genres elicit differentiated affective responses between the two sexes. Rather interestingly, the widespread gender – stereotyping running through entertainment products seems to correspond to actual viewer preferences. Males indeed prefer action/adventure genres typically associated with the masculine sex, whilst females have a soft spot for romance/drama. Oliver et al. (2000) point to the explanatory potential of differential gender-linked expectations, which can be conceptualized along two dimensions: (1) communality, typically associated with females and (2) agency, often associated with males (Eagly, 1987). Depending on whether they are communal or agency-consistent, the themes preponderant in each genre make up for a sexually differentiated public. A number of studies highlighted the importance of sex in social affiliation with media characters: viewers tend to affiliate more strongly with and GENDER, PERSONALITY AND FILM PREFERENCES 5 experience more intense emotional responses to same-sex characters (e.g. Deutsch, 1975; Hoffner & Cantor, 1991). Another potential explanation is that of sex differences in mean personality levels, which remain fairly constant across the lifespan (Feingold, 1994; McCrae & Costa, 1984). personality differences in media preferences Theorists have also focused considerable attention on the role of personality characteristics in modern mass communication theory (Blumler & Katz, 1974; Wober, 1986). In most personality/media use models, personality is conceptualized as the nexus of attitudes, beliefs and values that guide one’s cognitive and affective interactions with the social environment (Weaver et al, 1993). Personality characteristics are thus believed to influence media preferences, which are essentially evaluative judgements pertaining to the gratifications consumers anticipate from their interaction with the media (Palmgreen, 1984). The Big Five framework of personality is most frequently employed by researchers seeking to demonstrate empirical connections between media gratifications and their psychological roots (e.g. Kraaykamp, 2001; Kraaykamp et al, 2005). It includes the following domains: Openness (traits like originality and open-mindedness), Conscientiousness (traits like hardworking and orderly), Extraversion (traits like energetic and sociable), Agreeableness (traits like affectionate and considerate) and Neuroticism (traits like nervous and tense) (Donellan & Lucas, 2008). With regard to media preferences, individuals scoring high on the dimension of Openness seem to prefer original and serious media content, whilst conscientious individuals like predictable and structured formats (Kraaykamp et al, 2005). The findings for extroverts are less straightforward: they seemingly favour sensory stimulation because of relatively high arousal levels (Costa & McCrae, 1988). Agreeableness appears to be the second most important personality trait, after Openness, in predicting visual preferences. Friendly individuals tend to watch popular content, devoid of upsetting and unconventional images (Kraykaamp, 2001). Finally, emotionally unstable individuals are thought to find easy means of escape from feelings of tension and stress in watching TV (Conway & Rubin, 1991). Most studies on personality effects in media preferences tend to either overlook or control for participants’ gender (e.g. Weaver et al, 1993; Kraaykamp, 2001). As a result, it is difficult to tell in the former case whether the differentiated association between media GENDER, PERSONALITY AND FILM PREFERENCES 6 preferences and personality characteristics is partially caused by the fact that personality traits differ systematically between people of different sexes (Kraaykamp & Van Eijck, 2005). The latter design precludes the possibility of assessing the interaction between gender and personality when it comes to predicting media taste. It seemed to us as though no one has investigated gendered differences in personality in the context of similar genre preferences.


Question: RainForest: A framework for rapid decision tree construction on large datasets.

This paper introduces SLIQ, a novel, scalable classifier designed specifically for data mining large datasets. Traditional classification algorithms, while effective, have been primarily developed for handling data that fits entirely into memory, which poses limitations when applied to the vast data sets encountered in data mining. SLIQ addresses this challenge by employing a unique pre-sorting technique during the decision tree growth phase. This sorting procedure is seamlessly integrated with a breadth-first tree growing strategy, enabling the classification of datasets that are too large to fit in memory, residing instead on disk. Moreover, SLIQ incorporates an efficient tree-pruning algorithm that contributes to the creation of compact yet accurate decision trees. The amalgamation of these techniques ensures that SLIQ can effectively scale to handle large data volumes and classify datasets of any size, regardless of the number of classes, attributes, or examples (records), making it a highly desirable tool for data mining applications.

The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm). In addition, projected FP-trees are (optionally) pruned by removing items that have become infrequent due to the projection (an approach that has been called FP-Bonsai). I report experimental results comparing this implementation of the FP-growth algorithm with three other frequent item set mining algorithms I implemented (Apriori, Eclat, and Relim).

Management and analysis of big data are systematically associated with a data distributed architecture in the Hadoop and now Spark frameworks. This article offers an introduction for statisticians to these technologies by comparing the performance obtained by the direct use of three reference environments : R, Python Scikit-learn, ∗Université de Toulouse – INSA, Institut de Mathématiques, UMR CNRS 5219 †Institut de Mathématiques, UMR CNRS 5219 ‡Université de Toulouse – UT3, Institut de Mathématiques, UMR CNRS 5219 1 ar X iv :1 60 9. 09 61 9v 1 [ st at .A P] 3 0 Se p 20 16 Spark MLlib on three public use cases : character recognition, recommending films, categorizing products. As main result, it appears that, if Spark is very efficient for data munging and recommendation by collaborative filtering (non-negative factorization), current implementations of conventional learning methods (logistic regression, random forests) in MLlib or SparkML do not ou poorly compete habitual use of these methods (R, Python Scikit-learn) in an integrated or undistributed architecture.

Graph abstraction is essential for many applications from finding a shortest path to executing complex machine learning (ML) algorithms like collaborative filtering. Graph construction from raw data for various applications is becoming challenging, due to exponential growth in data, as well as the need for large scale graph processing. Since graph construction is a data-parallel problem, MapReduce is well-suited for this task. We developed GraphBuilder, a scalable framework for graph Extract-Transform-Load (ETL), to offload many of the complexities of graph construction, including graph formation, tabulation, transformation, partitioning, output formatting, and serialization. GraphBuilder is written in Java, for ease of programming, and it scales using the MapReduce model. In this paper, we describe the motivation for GraphBuilder, its architecture, MapReduce algorithms, and performance evaluation of the framework. Since large graphs should be partitioned over a cluster for storing and processing and partitioning methods have significant performance impacts, we develop several graph partitioning methods and evaluate their performance. We also open source the framework at https://01.org/graphbuilder/.

The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example, many gene expression datasets may contain 10,000-100,000 columns but only 100-1000 rows.Such datasets pose a great challenge for existing (closed) frequent pattern discovery algorithms, since they have an exponential dependence on the average row length. In this paper, we describe a new algorithm called CARPENTER that is specially designed to handle datasets having a large number of attributes and relatively small number of rows. Several experiments on real bioinformatics datasets show that CARPENTER is orders of magnitude better than previous closed pattern mining algorithms like CLOSET and CHARM.

Within the framework of ADABOOST.MH, we propose to train vector-valued decision trees to optimize the multi-class edge without reducing the multi-class problem toK binary one-againstall classifications. The key element of the method is a vector-valued decision stump, factorized into an input-independent vector of length K and label-independent scalar classifier. At inner tree nodes, the label-dependent vector is discarded and the binary classifier can be used for partitioning the input space into two regions. The algorithm retains the conceptual elegance, power, and computational efficiency of binary ADABOOST. In experiments it is on par with support vector machines and with the best existing multi-class boosting algorithm AOSOLOGITBOOST, and it is significantly better than other known implementations of ADABOOST.MH.

The development of data-mining applications such as classification and clustering has been applied to large scale data. In this research, we present comparative study of different classification techniques using three data mining tools named WEKA, TANAGRA and MATLAB. The aim of this paper is to analyze the performance of different classification techniques for a set of large data. The algorithm or classifiers tested are Multilayer Perceptron, Bayes Network, J48graft (c4.5), Fuzzy Lattice Reasoning (FLR), NaiveBayes, JRip (RIPPER), Fuzzy Inference System (FIS), Adaptive Neuro-Fuzzy Inference Systems(ANFIS). A fundamental review on the selected technique is presented for introduction purposes. The diabetes data with a total instance of 768 and 9 attributes (8 for input and 1 for output) will be used to test and justify the differences between the classification methods or algorithms. Subsequently, the classification technique that has the potential to significantly improve the common or conventional methods will be suggested for use in large scale data, bioinformatics or other general applications.

We introduce MiningZinc, a declarative framework for constraint-based data mining. MiningZinc consists of two key components: a language component and an execution mechanism. First, the MiningZinc language allows for high-level and natural modeling of mining problems, so that MiningZinc models are similar to the mathematical definitions used in the literature. It is inspired by the Zinc family of languages and systems and supports user-defined constraints and functions. Secondly, the MiningZinc execution mechanism specifies how to compute solutions for the models. It is solver independent and supports both standard constraint solvers and specialized data mining systems. The high-level problem specification is first translated into a normalized constraint language (FlatZinc). Rewrite rules are then used to add redundant constraints or solve subproblems using specialized data mining algorithms or generic constraint programming solvers. Given a model, different execution strategies are automatically extracted that correspond to different sequences of algorithms to run. Optimized data mining algorithms, specialized processing routines and generic solvers can all be automatically combined. Thus, the MiningZinc language allows one to model constraint-based itemset mining problems in a solver independent way, and its execution mechanism can automatically chain different algorithms and solvers. This leads to a unique combination of declarative modeling with high-performance solving.

Corresponding Author: Vanaja, S., Research Scholar and Research guide, Research and Development, Bharathiar University, Coimbatore, Tamil Nadu, India Email: vanajasha@yahoo.com Abstract: The aim of this research paper is to study and discuss the various classification algorithms applied on different kinds of medical datasets and compares its performance. The classification algorithms with maximum accuracies on various kinds of medical datasets are taken for performance analysis. The result of the performance analysis shows the most frequently used algorithms on particular medical dataset and best classification algorithm to analyse the specific disease. This study gives the details of different classification algorithms and feature selection methodologies. The study also discusses about the data constraints such as volume and dimensionality problems. This research paper also discusses the new features of C5.0 classification algorithm over C4.5 and performance of classification algorithm on high dimensional datasets. This research paper summarizes various reviews and technical articles which focus on the current research on Medical diagnosis.

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.

This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature-selection algorithm that addresses several major issues with prior work, including problems with algorithm implementation, computational complexity, and solution accuracy. The key idea is to decompose an arbitrarily complex nonlinear problem into a set of locally linear ones through local learning, and then learn feature relevance globally within the large margin framework. The proposed algorithm is based on well-established machine learning and numerical analysis techniques, without making any assumptions about the underlying data distribution. It is capable of processing many thousands of features within minutes on a personal computer while maintaining a very high accuracy that is nearly insensitive to a growing number of irrelevant features. Theoretical analyses of the algorithm's sample complexity suggest that the algorithm has a logarithmical sample complexity with respect to the number of features. Experiments on 11 synthetic and real-world data sets demonstrate the viability of our formulation of the feature-selection problem for supervised learning and the effectiveness of our algorithm.


Question: RainForest: A framework for rapid decision tree construction on large datasets.

This paper introduces a comprehensive evaluation of sampling-based estimators for determining the number of distinct values of an attribute within a database relation. Various new estimators are proposed and compared against existing methods from the database and statistics fields, using a wide range of attribute-value distributions sourced from real-world databases. This extensive comparison, unprecedented in the literature, specifically targets the highly skewed data distributions commonly observed in database applications. Our findings highlight the superior performance of a novel "hybrid" estimator, which outperforms competitors in terms of precision for a given sampling fraction. This hybrid approach uniquely considers the data's skewness and integrates a new "smoothed jackknife" estimator with Shlosser's method. We further explore the robustness of the hybrid estimator as the database size increases, demonstrating its effectiveness in handling large datasets.

This paper investigates the connections between two state of the art classifiers: decision forests (DFs, including decision jungles) and convolutional neural networks (CNNs). Decision forests are computationally efficient thanks to their conditional computation property (computation is confined to only a small region of the tree, the nodes along a single branch). CNNs achieve state of the art accuracy, thanks to their representation learning capabilities. We present a systematic analysis of how to fuse conditional computation with representation learning and achieve a continuum of hybrid models with different ratios of accuracy vs. efficiency. We call this new family of hybrid models conditional networks. Conditional networks can be thought of as: i) decision trees augmented with data transformation operators, or ii) CNNs, with block-diagonal sparse weight matrices, and explicit data routing functions. Experimental validation is performed on the common task of image classification on both the CIFAR and Imagenet datasets. Compared to state of the art CNNs, our hybrid models yield the same accuracy with a fraction of the compute cost and much smaller number of parameters.

The exponential growth in the number of complex datasets every year requires more enhancement in machine learning methods to provide robust and accurate data classification. Lately, deep learning approaches have achieved surpassing results in comparison to previous machine learning algorithms. However, finding the suitable structure for these models has been a challenge for researchers. This paper introduces Random Multimodel Deep Learning (RMDL): a new ensemble, deep learning approach for classification. RMDL solves the problem of finding the best deep learning structure and architecture while simultaneously improving robustness and accuracy through ensembles of deep learning architectures. In short, RMDL trains multiple randomly generated models of Deep Neural Network (DNN), Convolutional Neural Network (CNN) and Recurrent Neural Network (RNN) in parallel and combines their results to produce better result of any of those models individually. In this paper, we describe RMDL model and compare the results for image and text classification as well as face recognition. We used MNIST and CIFAR-10 datasets as ground truth datasets for image classification and WOS, Reuters, IMDB, and 20newsgroup datasets for text classification. Lastly, we used ORL dataset to compare the model performance on face recognition task.

LIBOL is an open-source library for large-scale online learning, which consists of a large family of efficient and scalable state-of-the-art online learning algorithms for large-scale online classification tasks. We have offered easy-to-use command-line tools and examples for users and developers, and also have made comprehensive documents available for both beginners and advanced users. LIBOL is not only a machine learning toolbox, but also a comprehensive experimental platform for conducting online learning research.

Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more acute considering that some of these hard to profile new users judge the unfamiliar system by its ability to immediately provide them with satisfying recommendations, and may quickly abandon the system when disappointed. Rapid profiling of new users by a recommender system is often achieved through a bootstrapping process - a kind of an initial interview - that elicits users to provide their opinions on certain carefully chosen items or categories. The elicitation process becomes particularly effective when adapted to users' responses, making best use of users' time by dynamically modifying the questions to improve the evolving profile. In particular, we advocate a specialized version of decision trees as the most appropriate tool for this task. We detail an efficient tree learning algorithm, specifically tailored to the unique properties of the problem. Several extensions to the tree construction are also introduced, which enhance the efficiency and utility of the method. We implemented our methods within a movie recommendation service. The experimental study delivered encouraging results, with the tree-based bootstrapping process significantly outperforming previous approaches.

Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using axis parallel splits. When the true decision boundaries are not aligned with the feature axes, this approach can produce a complicated boundary structure. Oblique decision trees use oblique decision boundaries to potentially simplify the boundary structure. The major limitation of this approach is that the tree induction algorithm is computationally expensive. In this article we present a new decision tree algorithm, called HHCART. The method utilizes a series of Householder matrices to reflect the training data at each node during the tree construction. Each reflection is based on the directions of the eigenvectors from each classes’ covariance matrix. Considering axis parallel splits in the reflected training data provides an efficient way of finding oblique splits in the unreflected training data. Experimental results show that the accuracy and size of the HHCART trees are comparable with some benchmark methods in the literature. The appealing feature of HHCART is that it can handle both qualitative and quantitative features in the same oblique split.

In this paper we introduce the concept of privacy preserving data mining. In our model, two parties owning conndential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information. This problem has many practical and important applications, such as in medical research with conndential patient records. Data mining algorithms are usually complex, especially as the size of the input is measured in megabytes, if not gigabytes. A generic secure multi-party computation solution, based on evaluation of a circuit computing the algorithm on the entire input, is therefore of no practical use. We focus on the problem of decision tree learning and use ID3, a popular and widely used algorithm for this problem. We present a solution that is considerably more eecient than generic solutions. It demands very few rounds of communication and reasonable bandwidth. In our solution, each party performs by itself a computation of the same order as computing the ID3 algorithm for its own database. The results are then combined using eecient cryptographic protocols, whose overhead is only logarithmic in the number of transactions in the databases. We feel that our result is a substantial contribution, demonstrating that secure multi-party computation can be made practical, even for complex problems and large inputs.

Mainstream parallel algorithms for mining frequent itemsets (patterns) were designed by implementing FP-Growth or Apriori algorithms on MapReduce (MR) framework. Existing MR FP-Growth algorithms can not distribute data equally among nodes, and MR Apriori algorithms utilize multiple map/reduce procedures and generate too many key-value pairs with value of 1; these disadvantages hinder their performance. This paper proposes an algorithm FIMMR: it firstly mines local frequent itemsets for each data chunk as candidates, applies prune strategies to the candidates, and then identifies global frequent itemsets from candidates. Experimental results show that the time efficiency of FIMMR outperforms PFP and SPC significantly; and under small minimum support threshold, FIMMR can achieve one order of magnitude improvement than the other two algorithms; meanwhile, the speedup of FIMMR is also satisfactory.

The development of data-mining applications such as classification and clustering has been applied to large scale data. In this research, we present comparative study of different classification techniques using three data mining tools named WEKA, TANAGRA and MATLAB. The aim of this paper is to analyze the performance of different classification techniques for a set of large data. The algorithm or classifiers tested are Multilayer Perceptron, Bayes Network, J48graft (c4.5), Fuzzy Lattice Reasoning (FLR), NaiveBayes, JRip (RIPPER), Fuzzy Inference System (FIS), Adaptive Neuro-Fuzzy Inference Systems(ANFIS). A fundamental review on the selected technique is presented for introduction purposes. The diabetes data with a total instance of 768 and 9 attributes (8 for input and 1 for output) will be used to test and justify the differences between the classification methods or algorithms. Subsequently, the classification technique that has the potential to significantly improve the common or conventional methods will be suggested for use in large scale data, bioinformatics or other general applications.

There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in parallel SQL database management systems (DBMS) for over 20 years, some have called MR a dramatically new computing model [8, 17]. In this paper, we describe and compare both paradigms. Furthermore, we evaluate both kinds of systems in terms of performance and development complexity. To this end, we define a benchmark consisting of a collection of tasks that we have run on an open source version of MR as well as on two parallel DBMSs. For each task, we measure each system's performance for various degrees of parallelism on a cluster of 100 nodes. Our results reveal some interesting trade-offs. Although the process to load data into and tune the execution of parallel DBMSs took much longer than the MR system, the observed performance of these DBMSs was strikingly better. We speculate about the causes of the dramatic performance difference and consider implementation concepts that future systems should take from both kinds of architectures.

The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example, many gene expression datasets may contain 10,000-100,000 columns but only 100-1000 rows.Such datasets pose a great challenge for existing (closed) frequent pattern discovery algorithms, since they have an exponential dependence on the average row length. In this paper, we describe a new algorithm called CARPENTER that is specially designed to handle datasets having a large number of attributes and relatively small number of rows. Several experiments on real bioinformatics datasets show that CARPENTER is orders of magnitude better than previous closed pattern mining algorithms like CLOSET and CHARM.


Question: RainForest: A framework for rapid decision tree construction on large datasets.

This paper introduces SPRINT, a Scalable Parallel Classifier tailored for efficient data mining on large datasets. Unlike existing classification algorithms that often demand significant memory resources to retain the entire dataset or substantial portions of it, SPRINT is designed to circumvent these memory constraints while maintaining high speed and scalability. The algorithm's architecture enables it to handle vast databases with ease, making it a versatile choice for data mining tasks. Moreover, SPRINT is inherently parallelizable, allowing multiple processors to collaborate in constructing a unified and consistent model. The paper also discusses the parallelization strategy employed by SPRINT, which exhibits remarkable scalability. These features collectively position SPRINT as an optimal tool for data mining, particularly in scenarios involving extensive datasets.

Boosting is one of the most important recent developments in classification methodology. Boosting works by sequentially applying a classification algorithm to reweighted versions of the training data and then taking a weighted majority vote of the sequence of classifiers thus produced. For many classification algorithms, this simple strategy results in dramatic improvements in performance. We show that this seemingly mysterious phenomenon can be understood in terms of well-known statistical principles, namely additive modeling and maximum likelihood. For the two-class problem, boosting can be viewed as an approximation to additive modeling on the logistic scale using maximum Bernoulli likelihood as a criterion. We develop more direct approximations and show that they exhibit nearly identical results to boosting. Direct multiclass generalizations based on multinomial likelihood are derived that exhibit performance comparable to other recently proposed multiclass generalizations of boosting in most situations, and far superior in some. We suggest a minor modification to boosting that can reduce computation, often by factors of 10 to 50. Finally, we apply these insights to produce an alternative formulation of boosting decision trees. This approach, based on best-first truncated tree induction, often leads to better performance, and can provide interpretable descriptions of the aggregate decision rule. It is also much faster computationally, making it more suitable to large-scale data mining applications.

Kernel-based learning algorithms have been shown to achieve state-of-the-art results in many Natural Language Processing (NLP) tasks. We present KELP, a Java framework that supports the implementation of both kernel-based learning algorithms and kernel functions over generic data representation, e.g. vectorial data or discrete structures. The framework has been designed to decouple kernel functions and learning algorithms: once a new kernel function has been implemented it can be adopted in all the available kernelmachine algorithms. The platform includes different Online and Batch Learning algorithms for Classification, Regression and Clustering, as well as several Kernel functions, ranging from vector-based to structural kernels. This paper will show the main aspects of the framework by applying it to different NLP tasks.

This research tries to view accident data collection and analysis as a system that requires a special view towards understanding the whole and making sense out of it for improved decision making in the effort of reducing the problem of road safety. Under the umbrella of an information architecture research for road safety in developing countries, the objective of this machine learning experimental research is to explore and predict the role of road users on possible injury risks. The research employed Classification and Adaptive Regression Trees (CART) and RandomForest approaches. To identify relevant patterns and illustrate the performance of the techniques for the road safety domain, road accident data collected from Addis Ababa Traffic Office is exposed to many sided analyses. Empirical results showed that the models could classify accidents with promising accuracy.

Algorithms for Continuous Queries: A Geometric

Advancements in new data analysis and visualization technologies have resulted in wide applicability of data-driven decision making. However, raw data from various sources must be wrangled into a suitable form before they are processed by the downstream data tools. People traditionally write data transformation programs to automate this process, and such work is cumbersome and tedious.
 We built a system called FOOFAH for helping the user easily synthesize a desired data transformation program. Our system minimizes the user's effort by only asking for a small illustrative example comprised of the raw input data and the target transformed output; FOOFAH then synthesizes a program that can perform the desired data transformation. This demonstration showcases how the user can apply FOOFAH to real-world data transformation tasks.

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.

Cloud computing provides on-demand services with pay-as-you-go model. In this sense, customers expect quality from providers where QoS control over DBMSs services demands decision making, usually based on performance aspects. It is essential that the system be able to assimilate the characteristics of the application in order to determine the execution time for its queries' execution. Machine learning techniques are a promising option in this context, since they o er a wide range of algorithms that build predictive models for this purpose based on the past observations of the demand and on the DBMS system behavior. In this work, we propose and evaluate the use of regression methods for modeling the SQL query execution time in the cloud. This process uses di erent techniques, such as bag-of-words, statistical lter and genetic algorithms. We use K-Fold Cross-Validation for measuring the quality of the models in each step. Experiments were carried out based on data from database systems in the cloud generated by the TPC-C benchmark.

Adaboost is a machine learning algorithm that builds a series of small decision trees, adapting each tree to predict difficult cases missed by the previous trees and combining all trees into a single model. We will discuss the AdaBoost methodology and introduce the extension called Real AdaBoost. Real AdaBoost comes from a strong academic pedigree: its authors are pioneers of machine learning and the method has well-established empirical and theoretical support spanning 15 years. Practically speaking, Real AdaBoost is able to produce readable credit scorecards and offers attractive features including variable interaction and adaptive, stage-wise binning. We will contrast Real AdaBoost to the dominant methodology for creating credit scorecards: stepwise weight of evidence logistic regression (SWOELR). Real AdaBoost is remarkably similar to SWOELR and is well positioned to serve as a benchmark for SWOELR models; it may even offer a statistical framework by which we can understand the power of SWOELR. We offer a macro to generate Real AdaBoost models in SAS. INTRODUCTION Financial institutions (FIs) must develop a wide range of models for marketing, fraud detection, loan adjudication, etc. Modeling has undergone a recent renaissance as machine learning has exploded – spurned by the availability of advanced statistical techniques, the ubiquity of powerful computers to execute these techniques, and the well-publicized successes of the companies who have embraced these methods (Parloff 2016). Modeling departments within some FIs face opposing demands: executives want some of the famed value of advanced methods, while government regulators, internal deployment teams and front-line staff want models that are easy to implement, interpret and understand. In this paper we review Real AdaBoost, a machine learning technique that may offer a middle-ground between powerful, but opaque machine learning methods and transparent conventional methods. CONSUMER RISK MODELS One field of modeling where FIs must often strike a balance between power and transparency is consumer risk modeling. Consumer risk modeling involves ranking customers by their credit worthiness (the likelihood they will repay a loan): first by identifying customer characteristics that indicate risk of delinquency, and then combining them mathematically to calculate a relative risk score for each customer (common characteristics include: past loan delinquency, high credit utilization, etc.). CREDIT SCORECARDS In order to keep the consumer risk models as transparent as possible, many FIs require that the final output of the model be in the form of a scorecard (an example is shown in Table 1). Credit scorecards are a popular way to represent customer risk models due to their simplicity, readability, and the ease with which business expertise can be incorporated during the modeling process (Maldonado et al. 2013). A scorecard lists a number of characteristics that indicate risk and each characteristic is subdivided into a small number of bins defined by ranges of values for that characteristic (e.g., credit utilization: 30-80% is a bin for the credit utilization characteristic). Each bin is assigned a number of score points, a value derived from a statistical model and proportional to the risk of that bin (SAS 2012). A customer will fall into one and only one bin per characteristic and the final score of the applicant is the sum of the points assigned by each bin (plus an intercept). This final score is proportional to consumer risk. The procedure for developing scorecards is termed stepwise weight of evidence logistic regression (SWOELR) and is implemented in the Credit Scoring add-on in SAS® Enterprise MinerTM.

Reinforcement learning aims to determine an optimal contro l policy from interaction with a system or from observations gathered from a system. In batch mode, i t can be achieved by approximating the so-calledQ-function based on a set of four-tuples (xt ,ut , rt ,xt+1) wherext denotes the system state at timet, ut the control action taken, rt the instantaneous reward obtained and xt+1 the successor state of the system, and by determining the contro l policy from this Q-function. The Q-function approximation may be obtained from the limit of a s equence of (batch mode) supervised learning problems. Within this framework we describe the use of several classical tree-based supervised learning methods (CART, Kd-tree, tree bagging) a d two newly proposed ensemble algorithms, namelyextremelyandtotally randomized trees. We study their performances on several examples and find that the ensemble methods based on regressi on trees perform well in extracting relevant information about the optimal control policy from sets of four-tuples. In particular, the totally randomized trees give good results while ensuring the convergence of the sequence, whereas by relaxing the convergence constraint even better accurac y results are provided by the extremely randomized trees.

5 Nowadays computers are in the middle of most economic transactions. 6 These “computer-mediated transactions” generate huge amounts of 7 data, and new tools can be used to manipulate and analyze this data. 8 This essay offers a brief introduction to some of these tools and meth9 ods. 10 Computers are now involved in many economic transactions and can cap11 ture data associated with these transactions, which can then be manipulated 12 and analyzed. Conventional statistical and econometric techniques such as 13 regression often work well but there are issues unique to big data sets that 14 may require different tools. 15 First, the sheer size of the data involved may require more powerful data 16 manipulation tools. Second, we may have more potential predictors than 17 appropriate for estimation, so we need to do some kind of variable selection. 18 Third, large data sets may allow for more flexible relationships than simple 19 ∗Hal Varian is Chief Economist, Google Inc., Mountain View, California, and Emeritus Professor of Economics, University of California, Berkeley, California. Thanks to Jeffrey Oldham, Tom Zhang, Rob On, Pierre Grinspan, Jerry Friedman, Art Owen, Steve Scott, Bo Cowgill, Brock Noland, Daniel Stonehill, Robert Snedegar, Gary King, the editors of this journal for comments on earlier versions of this paper. 1 linear models. Machine learning techniques such as decision trees, support 20 vector machines, neural nets, deep learning and so on may allow for more 21 effective ways to model complex relationships. 22 In this essay I will describe a few of these tools for manipulating and an23 alyzing big data. I believe that these methods have a lot to offer and should 24 be more widely known and used by economists. In fact, my standard advice 25 to graduate students these days is “go to the computer science department 26 and take a class in machine learning.” There have been very fruitful collabo27 rations between computer scientists and statisticians in the last decade or so, 28 and I expect collaborations between computer scientists and econometricians 29 will also be productive in the future. 30 1 Tools to manipulate big data 31 Economists have historically dealt with data that fits in a spreadsheet, but 32 that is changing as new more detailed data becomes available; see Einav 33 and Levin [2013] for several examples and discussion. If you have more 34 than a million or so rows in a spreadsheet, you probably want to store it in a 35 relational database, such as MySQL. Relational databases offer a flexible way 36 to store, manipulate and retrieve data using a Structured Query Language 37 (SQL) which is easy to learn and very useful for dealing with medium-sized 38 data sets. 39 However, if you have several gigabytes of data or several million observa40 tions, standard relational databases become unwieldy. Databases to manage 41 data of this size are generically known as “NoSQL” databases. The term is 42 used rather loosely, but is sometimes interpreted as meaning “not only SQL.” 43 NoSQL databases are more primitive than SQL databases in terms of data 44 manipulation capabilities but can handle larger amounts of data. 45 Due to the rise of computer mediated transactions, many companies have 46 found it necessary to develop systems to process billions of transactions per 47


Question: RainForest: A framework for rapid decision tree construction on large datasets.

In this document, we present an in-depth exploration of a comprehensive framework designed for the efficient construction of decision trees, specifically tailored for processing large datasets. This framework, known as RainForest, is a pivotal contribution to the field of machine learning, particularly when dealing with voluminous data. RainForest is engineered to expedite the decision tree construction process while maintaining high accuracy and robustness. It introduces novel algorithms and strategies that significantly enhance the scalability of decision tree learning algorithms, making them suitable for big data environments. By optimizing the splitting criteria and pruning techniques, RainForest ensures that the decision trees are not only built quickly but also yield high predictive performance. The framework is modular, allowing for easy integration with existing machine learning pipelines and offering flexibility in terms of parameter tuning. RainForest's design is also geared towards parallel and distributed computing, making it an ideal choice for handling datasets that are too large to be processed on a single machine. Through extensive experimental evaluations, we demonstrate that RainForest outperforms conventional decision tree algorithms in terms of both speed and accuracy when applied to large-scale datasets. This document serves as a detailed guide to understanding the principles, algorithms, and practical applications of the RainForest framework in the context of machine learning.

The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm). In addition, projected FP-trees are (optionally) pruned by removing items that have become infrequent due to the projection (an approach that has been called FP-Bonsai). I report experimental results comparing this implementation of the FP-growth algorithm with three other frequent item set mining algorithms I implemented (Apriori, Eclat, and Relim).

The goal of the Quest project at the IBM Almaden Research center is to develop technology to enable a new breed of da&intensive decision-support applications. This paper is a capsule summary of the current functionality and architecture of the Quest data mining System. Our overall approach has been to identify basic data mining operations that cut across applications and develop fast, scalable algorithms for their execution (Agrawal, Imielinski, & Swami 1993a). We wanted our algorithms to:

Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed for additive expansions based on any tting criterion. Speci c algorithms are presented for least{squares, least{absolute{deviation, and Huber{M loss functions for regression, and multi{class logistic likelihood for classi cation. Special enhancements are derived for the particular case where the individual additive components are decision trees, and tools for interpreting such \TreeBoost" models are presented. Gradient boosting of decision trees produces competitive, highly robust, interpretable procedures for regression and classi cation, especially appropriate for mining less than clean data. Connections between this approach and the boosting methods of Freund and Shapire 1996, and Friedman, Hastie, and Tibshirani 1998 are discussed. 1 Function estimation In the function estimation problem one has a system consisting of a random \output" or \response" variable y and a set of random \input" or \explanatory" variables x = fx1; ; xng. Given a \training" sample fyi;xig N 1 of known (y;x){values, the goal is to nd a function F (x) that maps x to y, such that over the joint distribution of all (y;x){values, the expected value of some speci ed loss function (y; F (x)) is minimized F (x) = argmin F (x) Ey;x (y; F (x)) = argmin F (x) Ex [Ey( (y; F (x)) jx] : (1) Frequently employed loss functions (y; F ) include squared{error (y F ) and absolute error jy F j for y 2 R (regression), and negative binomial log{likelihood, log(1 + e 2yF ), when y 2 f 1; 1g (classi cation). A common procedure is to take F (x) to be a member of a parameterized class of functions F (x;P), where P = fP1; P2; g is a set of parameters. In this paper we focus on \additive" expansions of the form

Mainstream parallel algorithms for mining frequent itemsets (patterns) were designed by implementing FP-Growth or Apriori algorithms on MapReduce (MR) framework. Existing MR FP-Growth algorithms can not distribute data equally among nodes, and MR Apriori algorithms utilize multiple map/reduce procedures and generate too many key-value pairs with value of 1; these disadvantages hinder their performance. This paper proposes an algorithm FIMMR: it firstly mines local frequent itemsets for each data chunk as candidates, applies prune strategies to the candidates, and then identifies global frequent itemsets from candidates. Experimental results show that the time efficiency of FIMMR outperforms PFP and SPC significantly; and under small minimum support threshold, FIMMR can achieve one order of magnitude improvement than the other two algorithms; meanwhile, the speedup of FIMMR is also satisfactory.

This paper presents a new approach to hierarchical clustering of very large data sets, named GridClustering. The method organizes unlike the conventional methods the space surrounding the patterns and not the patterns. It uses a multidimensional grid data structure. The resulting block partitioning of the value space is clustered via a topological neighbor search. The Grid-Clustering method is able to deliver structural pattern distribution information for very large data sets. It superceeds all conventional hierarchical algorithms in runtime behavior and memory space requirements. The algorithm was analyzed within a testbed and suitable values for the tunable parameters of the algorithm are proposed. A comparison of the executions times to other commonly used clustering algorithms and a heuristic runtime analysis is given.

We introduce MiningZinc, a declarative framework for constraint-based data mining. MiningZinc consists of two key components: a language component and an execution mechanism. First, the MiningZinc language allows for high-level and natural modeling of mining problems, so that MiningZinc models are similar to the mathematical definitions used in the literature. It is inspired by the Zinc family of languages and systems and supports user-defined constraints and functions. Secondly, the MiningZinc execution mechanism specifies how to compute solutions for the models. It is solver independent and supports both standard constraint solvers and specialized data mining systems. The high-level problem specification is first translated into a normalized constraint language (FlatZinc). Rewrite rules are then used to add redundant constraints or solve subproblems using specialized data mining algorithms or generic constraint programming solvers. Given a model, different execution strategies are automatically extracted that correspond to different sequences of algorithms to run. Optimized data mining algorithms, specialized processing routines and generic solvers can all be automatically combined. Thus, the MiningZinc language allows one to model constraint-based itemset mining problems in a solver independent way, and its execution mechanism can automatically chain different algorithms and solvers. This leads to a unique combination of declarative modeling with high-performance solving.

Advancements in new data analysis and visualization technologies have resulted in wide applicability of data-driven decision making. However, raw data from various sources must be wrangled into a suitable form before they are processed by the downstream data tools. People traditionally write data transformation programs to automate this process, and such work is cumbersome and tedious.
 We built a system called FOOFAH for helping the user easily synthesize a desired data transformation program. Our system minimizes the user's effort by only asking for a small illustrative example comprised of the raw input data and the target transformed output; FOOFAH then synthesizes a program that can perform the desired data transformation. This demonstration showcases how the user can apply FOOFAH to real-world data transformation tasks.

We present Stratosphere, an open-source software stack for parallel data analysis. Stratosphere brings together a unique set of features that allow the expressive, easy, and efficient programming of analytical applications at very large scale. Stratosphere’s features include “in situ” data processing, a declarative query language, treatment of user-defined functions as first-class citizens, automatic program parallelization and optimization, support for iterative programs, and a scalable and efficient execution engine. Stratosphere covers a variety of “Big Data” use cases, such as data warehousing, information extraction and integration, data cleansing, graph analysis, and statistical analysis applications. In this paper, we present the overall system architecture design decisions, introduce Stratosphere through example queries, and then dive into the internal workings of the system’s components that relate to extensibility, programming model, optimization, and query execution. We experimentally compare Stratosphere against popular open-source alternatives, and we conclude with a research outlook for the next years.

In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying data streams. In addition to reviewing past work relevant to data stream systems and current projects in the area, the paper explores topics in stream query languages, new requirements and challenges in query processing, and algorithmic issues.

Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insufficiently expressive while low-level tools like MPI and Pthreads leave ML experts repeatedly solving the same design challenges. By targeting common patterns in ML, we developed GraphLab, which improves upon abstractions like MapReduce by compactly expressing asynchronous iterative algorithms with sparse computational dependencies while ensuring data consistency and achieving a high degree of parallel performance. We demonstrate the expressiveness of the GraphLab framework by designing and implementing parallel versions of belief propagation, Gibbs sampling, Co-EM, Lasso and Compressed Sensing. We show that using GraphLab we can achieve excellent parallel performance on large scale real-world problems.