Query: A Two-Step Method for Clustering Mixed Categroical and Numeric Data

Relevant passages:
A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise <=SEP=> Spatial Databases Require to detect knowledge from great amount of data Need to handle with arbitrary shape Requirements of Clustering in Data Mining • Scalability • Dealing with different types of attributes • Discovery of Clusters with arbitrary shape • Minimal requirements for domain knowledge to determine input parameters • Able to deal with noise and outliers • Insensitive to the order of input data • High dimensionality of data • Interpretability and usability Introduction(cont..)

A k-mean clustering algorithm for mixed numeric and categorical data <=SEP=> Use of traditional k-mean type algorithm is limited to numeric data. This paper presents a clustering algorithm based on k-mean paradigm that works well for data with mixed numeric and categorical features. We propose new cost function and distance measure based on co-occurrence of values. The measures also take into account the significance of an attribute towards the clustering process. We present a modified description of cluster center to overcome the numeric data only limitation of k-mean algorithm and provide a better characterization of clusters. The performance of this algorithm has been studied on real world data sets. Comparisons with other clustering algorithms illustrate the effectiveness of this approach. 2007 Elsevier B.V. All rights reserved.

Finding Groups in Data: An Introduction to Cluster Analysis <=SEP=> Description: The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover volumes, Wiley hopes to extend the lives of these works by making them available to future generations of statisticians, mathematicians, and scientists. "Cluster analysis is the increasingly important and practical subject of finding groupings in data. The authors set out to write a book for the user who does not necessarily have an extensive background in mathematics. They succeed very well." —Mathematical Reviews "Finding Groups in Data [is] a clear, readable, and interesting presentation of a small number of clustering methods. In addition, the book introduced some interesting innovations of applied value to clustering literature." —Journal of Classification "This is a very good, easy-to-read, and practical book. It has many nice features and is highly recommended for students and practitioners in various fields of study." —Technometrics An introduction to the practical application of cluster analysis, this text presents a selection of methods that together can deal with most applications. These methods are chosen for their robustness, consistency, and general applicability. This book discusses various types of data, including interval-scaled and binary variables as well as similarity data, and explains how these can be transformed prior to clustering.

Unsupervised Learning with Mixed Numeric and Nominal Data <=SEP=> ÐThis paper presents a Similarity-Based Agglomerative Clustering (SBAC) algorithm that works well for data with mixed numeric and nominal features. A similarity measure, proposed by Goodall for biological taxonomy [15], that gives greater weight to uncommon feature value matches in similarity computations and makes no assumptions of the underlying distributions of the feature values, is adopted to define the similarity measure between pairs of objects. An agglomerative algorithm is employed to construct a dendrogram and a simple distinctness heuristic is used to extract a partition of the data. The performance of SBAC has been studied on real and artificially generated data sets. Results demonstrate the effectiveness of this algorithm in unsupervised discovery tasks. Comparisons with other clustering schemes illustrate the superior performance of this approach. Index TermsÐAgglomerative clustering, conceptual clustering, feature weighting, interpretation, knowledge discovery, mixed numeric and nominal data, similarity measures, 2 aggregation.

Chameleon: Hierarchical Clustering Using Dynamic Modeling <=SEP=> 68 Computer C lustering is a discovery process in data mining. 1 It groups a set of data in a way that maximizes the similarity within clusters and minimizes the similarity between two different clusters. 1,2 These discovered clusters can help explain the characteristics of the underlying data distribution and serve as the foundation for other data mining and analysis techniques. Clustering is useful in characterizing customer groups based on purchasing patterns, categorizing Web documents, 3 grouping genes and proteins that have similar func-tionality, 4 grouping spatial locations prone to earthquakes based on seismological data, and so on. Most existing clustering algorithms find clusters that fit some static model. Although effective in some cases, these algorithms can break down—that is, cluster the data incorrectly—if the user doesn't select appropriate static-model parameters. Or sometimes the model cannot adequately capture the clusters' characteristics. Most of these algorithms break down when the data contains clusters of diverse shapes, densities , and sizes. Existing algorithms use a static model of the clusters and do not use information about the nature of individual clusters as they are merged. Furthermore, one set of schemes (the CURE algorithm and related schemes) ignores the information about the aggregate interconnectivity of items in two clusters. The other set of schemes (the Rock algorithm, group averaging method, and related schemes) ignores information about the closeness of two clusters as defined by the similarity of the closest items across two clusters. (For more information, see the " Limitations of Traditional Clustering Algorithms " sidebar.) By only considering either interconnectivity or close-ness, these algorithms can easily select and merge the wrong pair of clusters. For instance, an algorithm that focuses only on the closeness of two clusters will incorrectly merge the clusters in Figure 1a over those in Figure 1b. Similarly, an algorithm that focuses only on interconnectivity will, in Figure 2, incorrectly merge the dark-blue with the red cluster rather than the green one. Here, we assume that the aggregate interconnec-tivity between the items in the dark-blue and red clusters is greater than that of the dark-blue and green clusters. However, the border points of the dark-blue cluster are much closer to those of the green cluster than those of the red cluster. Chameleon is a new agglomerative hierarchical clustering algorithm that overcomes the limitations of existing clustering algorithms. Figure 3 (on page 70) provides an overview of the overall approach …

Cortical cores in network dynamics <=SEP=> Spontaneous brain activity at rest is spatially and temporally organized in networks of cortical and subcortical regions specialized for different functional domains. Even though brain networks were first studied individually through functional Magnetic Resonance Imaging, more recent studies focused on their dynamic 'integration'. Integration depends on two fundamental properties: the structural topology of brain networks and the dynamics of functional connectivity. In this scenario, cortical hub regions, that are central regions highly connected with other areas of the brain, play a fundamental role in serving as way stations for network traffic. In this review, we focus on the functional organization of a set of hub areas that we define as the 'dynamic core'. In the resting state, these regions dynamically interact with other regions of the brain linking multiple networks. First, we introduce and compare the statistical measures used for detecting hubs. Second, we discuss their identification based on different methods (functional Magnetic Resonance Imaging, Diffusion Weighted Imaging, Electro/Magneto Encephalography). Third, we show that the degree of interaction between these core regions and the rest of the brain varies over time, indicating that their centrality is not stationary. Moreover, alternating periods of strong and weak centrality of the core relate to periods of strong and weak global efficiency in the brain. These results indicate that information processing in the brain is not stable, but fluctuates and its temporal and spectral properties are discussed. In particular, the hypothesis of 'pulsed' information processing, discovered in the slow temporal scale, is explored for signals at higher temporal resolution.

Machine Learning Approach for Intrusion Detection on Cloud Virtual Machines <=SEP=> Development of the cloud computing in recent years is increasing rapidly and gained great success, its security issues have got more and more attention. Many challenges in cloud computation increase the threat of data and service availability. There is need of many security services in order to improve cloud security for users as well as providers. In this paper, we propose a Anomaly Intrusion Detection System using machine learning approach for virtual machines on cloud computing. Our proposal is feature selection over events from Virtual Machine Monitor to detect anomaly in parallel to training the system so it will learn new threats and update the model. The experiment has been carried out on NSL-KDD'99 datasets using Naïve Bayes Tree (NB Tree) Classifier and hybrid approach of NB Tree and Random Forest.

An Ontology for Secure Socio-Technical Systems <=SEP=> Security is often compromised by exploiting vulnerabilities in the interface between the organization and the information systems that support it. This reveals the necessity of modeling and analyzing information systems together with the organizational setting where they will operate. In this chapter we address this problem by presenting a modeling language tailored to analyze the problem of security at an organizational level. This language proposes a set of concepts founded on the notions of permission, delegation, and trust. The chapter also presents a semantics for these concepts, based on Datalog. A case study from the bank domain is employed to illustrate the proposed language.

Player Profiling with Fallout 3 <=SEP=> In previous research we concluded that a personality profile, based on the Five Factor Model, can be constructed from observations of a player’s behavior in a module that we designed for Neverwinter Nights (Lankveld et al. 2011a). In the present research, we investigate whether we can do the same thing in an actual modern commercial video game, in this case the game Fallout 3. We stored automatic observations on 36 participants who played the introductory stages of Fallout 3. We then correlated these observations with the participants’ personality profiles, expressed by values for five personality traits as measured by the standard NEO-FFI questionnaire. Our analysis shows correlations between all five personality traits and the game observations. These results validate and generalize the results from our previous research (Lankveld et al. 2011a). We may conclude that Fallout 3, and by extension other modern video games, allows players to express their personality, and can therefore be used to create person-

Computational Models of Reading: A Primer <=SEP=> This article brief ly reviews four computational models of reading and the types of empirical findings that they are designed to explain: (1) theDual-Route model of word identification (Coltheart et al., 2001); (2) the SimpleRecurrent Network model of sentence processing (Elman, 1990); (3) the Construction–Integration model of discourse representation (Kintsch, 1988); and (4) the E-Z Reader model of eye-movement control in reading (Reichle et al., 2012). These particular models are reviewed because they provide comprehensive accounts of a large number of empirical findings in each of their respective domains, and because they have advanced our understanding of the cognitive processes involved in reading by motivating new empirical studies. Future models of reading will build upon the success of their predecessors by integrating models from two or more of the aforementioned domains, thereby providing a means to examine the compatibility of their theoretical assumptions and more comprehensive accounts of the cognitive processes involved in reading. The perceptual, cognitive, and motor processes that support skilled reading are numerous, extremely complex, and work together in a highly coordinated manner. For those reasons, any deep understanding of what happens in the mind during reading requires the use of computational models that describe those processes and how they jointly determine both the on-line behavior that is observed during reading (e.g., the patterns of eye movements that readers make) and the products of that behavior (e.g., the mental representations that readers generate to understand the text). As will be discussed in this article, such models provide theoretical frameworks for understanding the mental processes involved in reading, but also advance our understanding by generating novel predictions that can be tested with experiments. In the remainder of this article, I will describe four existing models that have already played important roles in furthering our understanding of the psychology of reading. These models were selected for inclusion in this article because they account for a wide range of empirical phenomena within a broad area of reading research, and because they have motivated a large number of new empirical studies. The models were also selected because they collectively span the range of topics that have traditionally been studied by reading researchers: (1) word identification; (2) sentence processing; (3) the representation of discourse; and (4) how these different processes interact with other cognitive processes (e.g., attention) to determine the patterns of eye movements that are observed during reading. Because one goal of this article is to introduce the models in a way that is accessible to a broad audience, I will describe the models using schematic diagrams rather than their equations; for a more formal description of the models, see either the original articles or Reichle’s review of the models. Word-Identification Models Word-identification models describe how the visual features corresponding to a word on a printed page are used to access that word’s pronunciation and meaning, as well as behavioral deficits that result from impairment of these processes due to developmental delay or brain © 2015 The Author Language and Linguistics Compass © 2015 John Wiley & Sons Ltd

Evaluating operating system vulnerability to memory errors <=SEP=> Reliability is of great concern to the scalability of extreme-scale systems. Of particular concern are soft errors in main memory, which are a leading cause of failures on current systems and are predicted to be the leading cause on future systems. While great effort has gone into designing algorithms and applications that can continue to make progress in the presence of these errors without restarting, the most critical software running on a node, the operating system (OS), is currently left relatively unprotected. OS resiliency is of particular importance because, though this software typically represents a small footprint of a compute node's physical memory, recent studies show more memory errors in this region of memory than the remainder of the system. In this paper, we investigate the soft error vulnerability of two operating systems used in current and future high-performance computing systems: Kitten, the lightweight kernel developed at Sandia National Laboratories, and CLE, a high-performance Linux-based operating system developed by Cray. For each of these platforms, we outline major structures and subsystems that are vulnerable to soft errors and describe methods that could be used to reconstruct damaged state. Our results show the Kitten lightweight operating system may be an easier target to harden against memory errors due to its smaller memory footprint, largely deterministic state, and simpler system structure.

Detection of Human, Legitimate Bot, and Malicious Bot in Online Social Networks Based on Wavelets <=SEP=> Social interactions take place in environments that influence people’s behaviours and perceptions. Nowadays, the users of Online Social Network (OSN) generate a massive amount of content based on social interactions. However, OSNs wide popularity and ease of access created a perfect scenario to practice malicious activities, compromising their reliability. To detect automatic information broadcast in OSN, we developed a wavelet-based model that classifies users as being human, legitimate robot, or malicious robot, as a result of spectral patterns obtained from users’ textual content. We create the feature vector from the Discrete Wavelet Transform along with a weighting scheme called Lexicon-based Coefficient Attenuation. In particular, we induce a classification model using the Random Forest algorithm over two real Twitter datasets. The corresponding results show the developed model achieved an average accuracy of 94.47% considering two different scenarios: single theme and miscellaneous one.

Postmarketing Drug Safety Surveillance Using Publicly Available Health-Consumer-Contributed Content in Social Media <=SEP=> Postmarketing drug safety surveillance is important because many potential adverse drug reactions cannot be identified in the premarketing review process. It is reported that about 5% of hospital admissions are attributed to adverse drug reactions and many deaths are eventually caused, which is a serious concern in public health. Currently, drug safety detection relies heavily on voluntarily reporting system, electronic health records, or relevant databases. There is often a time delay before the reports are filed and only a small portion of adverse drug reactions experienced by health consumers are reported. Given the popularity of social media, many health social media sites are now available for health consumers to discuss any health-related issues, including adverse drug reactions they encounter. There is a large volume of health-consumer-contributed content available, but little effort has been made to harness this information for postmarketing drug safety surveillance to supplement the traditional approach. In this work, we propose the association rule mining approach to identify the association between a drug and an adverse drug reaction. We use the alerts posted by Food and Drug Administration as the gold standard to evaluate the effectiveness of our approach. The result shows that the performance of harnessing health-related social media content to detect adverse drug reaction is good and promising.

ENHANCEMENT STRATEGIES FOR FRAME-TO-FRAME UAS STEREO VISUAL ODOMETRY <=SEP=> Autonomous navigation of indoor unmanned aircraft systems (UAS) requires accurate pose estimations usually obtained from indirect measurements. Navigation based on inertial measurement units (IMU) is known to be affected by high drift rates. The incorporation of cameras provides complementary information due to the different underlying measurement principle. The scale ambiguity problem for monocular cameras is avoided when a light-weight stereo camera setup is used. However, also frame-to-frame stereo visual odometry (VO) approaches are known to accumulate pose estimation errors over time. Several valuable real-time capable techniques for outlier detection and drift reduction in frame-to-frame VO, for example robust relative orientation estimation using random sample consensus (RANSAC) and bundle adjustment, are available. This study addresses the problem of choosing appropriate VO components. We propose a frame-to-frame stereo VO method based on carefully selected components and parameters. This method is evaluated regarding the impact and value of different outlier detection and drift-reduction strategies, for example keyframe selection and sparse bundle adjustment (SBA), using reference benchmark data as well as own real stereo data. The experimental results demonstrate that our VO method is able to estimate quite accurate trajectories. Feature bucketing and keyframe selection are simple but effective strategies which further improve the VO results. Furthermore, introducing the stereo baseline constraint in pose graph optimization (PGO) leads to significant improvements. * Corresponding author

Single inductor three-level boost bridgeless PFC rectifier with nature voltage clamp <=SEP=> A single inductor three-level boost bridgeless PFC rectifier with nature voltage clamp is proposed. In the proposed converter, the operation principle is quite different from other boost bridgeless three-level converters. The charging stage is presented in the low side while the discharging stage in the high side and vice versa. As a result, nature voltage clamp is achieved. And the slow diodes are ‘shared’. They operate not only as rectifying diodes, but also as voltage clamping diodes. Besides, only single inductor is required and the device utilization factor is high. Besides, the common-mode(CM) noise is rather low. First, the operational principle are analyzed in detail. Then the performance evaluation and design consideration are presented. Finally, a 1kW experimental prototype is built. The result shows that the efficiency is above 94% at full load under 90V and the maximum efficiency is 98.4%.

WhatsApp network forensics: Decrypting and understanding the WhatsApp call signaling messages <=SEP=> WhatsApp is a widely adopted mobile messaging application with over 800 million users. Recently, a calling feature was added to the application and no comprehensive digital forensic analysis has been performed with regards to this feature at the time of writing this paper. In this work, we describe how we were able to decrypt the network traffic and obtain forensic artifacts that relate to this new calling feature which included the: a) WhatsApp phone numbers, b) WhatsApp server IPs, c) WhatsApp audio codec (Opus), d) WhatsApp call duration, and e) WhatsApp's call termination. We explain the methods and tools used to decrypt the traffic as well as thoroughly elaborate on our findings with respect to the WhatsApp signaling messages. Furthermore, we also provide the community with a tool that helps in the visualization of the WhatsApp protocol messages. © 2015 Elsevier Ltd. All rights reserved.

A survey of socially interactive robots <=SEP=> This paper reviews “socially interactive robots”: robots for which social human–robot interaction is important. We begin by discussing the context for socially interactive robots, emphasizing the relationship to other research fields and the different forms of “social robots”. We then present a taxonomy of design methods and system components used to build socially interactive robots. Finally, we describe the impact of these robots on humans and discuss open issues. An expanded version of this paper, which contains a survey and taxonomy of current applications, is available as a technical report [T. Fong, I. Nourbakhsh, K. Dautenhahn, A survey of socially interactive robots: concepts, design and applications, Technical Report No. CMU-RI-TR-02-29, Robotics Institute, Carnegie Mellon University, 2002]. © 2003 Elsevier Science B.V. All rights reserved.

Maximum Margin Projection Subspace Learning for Visual Data Analysis <=SEP=> Visual pattern recognition from images often involves dimensionality reduction as a key step to discover a lower dimensional image data representation and obtain a more manageable problem. Contrary to what is commonly practiced today in various recognition applications where dimensionality reduction and classification are independently treated, we propose a novel dimensionality reduction method appropriately combined with a classification algorithm. The proposed method called maximum margin projection pursuit, aims to identify a low dimensional projection subspace, where samples form classes that are better discriminated, i.e., are separated with maximum margin. The proposed method is an iterative alternate optimization algorithm that computes the maximum margin projections exploiting the separating hyperplanes obtained from training a support vector machine classifier in the identified low dimensional space. Experimental results on both artificial data, as well as, on popular databases for facial expression, face and object recognition verified the superiority of the proposed method against various state-of-the-art dimensionality reduction algorithms.

From Motion to Photons in 80 Microseconds: Towards Minimal Latency for Virtual and Augmented Reality <=SEP=> We describe an augmented reality, optical see-through display based on a DMD chip with an extremely fast (16 kHz) binary update rate. We combine the techniques of post-rendering 2-D offsets and just-in-time tracking updates with a novel modulation technique for turning binary pixels into perceived gray scale. These processing elements, implemented in an FPGA, are physically mounted along with the optical display elements in a head tracked rig through which users view synthetic imagery superimposed on their real environment. The combination of mechanical tracking at near-zero latency with reconfigurable display processing has given us a measured average of 80 μs of end-to-end latency (from head motion to change in photons from the display) and also a versatile test platform for extremely-low-latency display systems. We have used it to examine the trade-offs between image quality and cost (i.e. power and logical complexity) and have found that quality can be maintained with a fairly simple display modulation scheme.

Upvoting hurricane Sandy: event-based news production processes on a social news site <=SEP=> This paper uses the case of Hurricane Sandy and reddit's topical community (subreddit) /r/sandy to examine the production and curation of news content around events on a social news site. Through qualitative analysis, we provide a coded topology of produced content and describe how types of networked gatekeeping impact the framing of a crisis situation. This study also examines, through quantitative modeling, what kind of information becomes negotiated and voted as relevant. We suggest that highly scored content shared in a social news setting focused more on human-interest media and perspective-based citizen journalism than professional news reports. We conclude by discussing how the mechanisms of social news sites conflict with the social norms and culture of reddit to produce differing expectations around news.

A comprehensive study of hybrid neural network hidden Markov model for offline handwritten Chinese text recognition <=SEP=> This paper proposes an effective segmentation-free approach using a hybrid neural network hidden Markov model (NN-HMM) for offline handwritten Chinese text recognition (HCTR). In the general Bayesian framework, the handwritten Chinese text line is sequentially modeled by HMMs with each representing one character class, while the NN-based classifier is adopted to calculate the posterior probability of all HMM states. The key issues in feature extraction, character modeling, and language modeling are comprehensively investigated to show the effectiveness of NN-HMM framework for offline HCTR. First, a conventional deep neural network (DNN) architecture is studied with a well-designed feature extractor. As for the training procedure, the label refinement using forced alignment and the sequence training can yield significant gains on top of the frame-level cross-entropy criterion. Second, a deep convolutional neural network (DCNN) with automatically learned discriminative features demonstrates its superiority to DNN in the HMM framework. Moreover, to solve the challenging problem of distinguishing quite confusing classes due to the large vocabulary of Chinese characters, NN-based classifier should output 19900 HMM states as the classification units via a high-resolution modeling within each character. On the ICDAR 2013 competition task of CASIA-HWDB database, DNN-HMM yields a promising character error rate (CER) of 5.24% by making a good trade-off between the computational complexity and recognition accuracy. To the best of our knowledge, DCNN-HMM can achieve a best published CER of 3.53%.

Containerization and the PaaS Cloud <=SEP=> Containerization is widely discussed as a lightweight virtualization solution. Apart from exhibiting benefits over traditional virtual machines in the cloud, containers are especially relevant for platform-as-a-service (PaaS) clouds to manage and orchestrate applications through containers as an application packaging mechanism. This article discusses the requirements that arise from having to facilitate applications through distributed multicloud platforms.

Mobile robot programming using natural language <=SEP=> How will naive users program domestic robots? This paper describes the design of a practical system that uses natural language to teach a vision-based robot how to navigate in a miniature town. To enable unconstrained speech the robot is provided with a set of primitive procedures derived from a corpus of route instructions. When the user refers to a route that is not known to the robot, the system will learn it by combining primitives as instructed by the user. This paper describes the components of the Instruction Based Learning architecture and discusses issues of knowledge representation, the selection of primitives and the conversion of natural language into robot-understandable procedures.

Identifying Opposing Views in Online Discourse <=SEP=> Discourse in online media often takes the form of siloed discussions where unpopular views tend to get drowned out by the majority. This is especially true in platforms such as Reddit, where only the most popular opinions get visibility. In this work, we propose that this problem may be solved by building tools that surface opposing views and I advance a means for automatically identifying disagreeing views on Reddit.

An Active Pixel Sensor Fabricated Using CMOS / CCD Process Technology <=SEP=> Paul P. K. Lee, Russell C. Gee*, R. Michael Guidash, T-H. Lee, and Eric R. Fossum* Microelectronics Technology Division, Eastman Kodak Company 1669 Lake Avenue, Rochester, New York 14650-2008 Tel: (716) 477-2869, Fax: (716) 477-4947, Internet: ppklee@Kodak.COM *Jet Propulsion Laboratory, California Institute of Technology 4800 Oak Grove Drive, Pasadena, CA 91109 Abstract This paper describes the integration of the active pixel sensor (APS) architecture normally fabricated in conventional complementary metal oxide semiconductor (CMOS) technology with a pinned photodiode (PPD) device using a mixed process technology. This new technology allows mix and match of CMOS and high performance charged coupled device (CCD) modules. The PPD [1] becomes the photoactive element in an XYaddressable area array with each pixel containing active devices for the transfer, readout and reset functions. It is a standard photo-sensitive element, available in a high performance true two-phase CCD technology developed previously for CCD-based image sensors [2]. An n-well 2-μm CMOS technology was combined with the CCD process to provide the best features from both. A Design of Experiment approach was used with Technology Computer Aided Design (TCAD) tools to develop and optimize the new mixed process technology without sacrificing any CCD performance while minimizing impact to the CMOS device characteristics [3]. By replacing polysilicon photocapacitor or photogate in conventional APS with the pinned photodiode, deficiencies in poor blue response and high dark current are minimized [4].

Developing criteria for establishing interrater reliability of specific items: applications to assessment of adaptive behavior. <=SEP=> A set of criteria based upon biostatistical considerations for determining the interrater reliability of specific adaptive behavior items in a given setting was presented. The advantages and limitations of extant statistical assessment procedures were discussed. Also, a set of guidelines for differentiating type of adaptive behavior that are statistically reliable from those that are reliable in a clinical or practical sense was delineated. Data sets were presented throughout in order to illustrate the advantages of recommended statistical procedures over other available ones.

COID: A cluster–outlier iterative detection approach to multi-dimensional data analysis <=SEP=> Nowadays, most data mining algorithms focus on clustering methods alone. Also, there are a lot of approaches designed for outlier detection. We observe that, in many situations, clusters and outliers are concepts whose meanings are inseparable to each other, especially for those data sets with noise. Thus, it is necessary to treat both clusters and outliers as concepts of the same importance in data analysis. In this paper, we present our continuous work on the cluster–outlier iterative detection algorithm (Shi in SubCOID: exploring cluster-outlier iterative detection approach to multi-dimensional data analysis in subspace. Auburn, pp. 132–135, 2008; Shi and Zhang in Towards exploring interactive relationship between clusters and outliers in multi-dimensional data analysis. IEEE Computer Society. Tokyo, pp. 518–519, 2005) to detect the clusters and outliers in another perspective for noisy data sets. In this algorithm, clusters are detected and adjusted according to the intra-relationship within clusters and the inter-relationship between clusters and outliers, and vice versa. The adjustment and modification of the clusters and outliers are performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields, such as pattern recognition, data clustering, and signal processing. Experimental results demonstrate the advantages of our approach.

Evaluation: from Precision, Recall and F-measure to ROC, Informedness, Markedness and Correlation <=SEP=> Commonly used evaluation measures including Recall, Precision, F-Measure and Rand Accuracy are biased and should not be used without clear understanding of the biases, and corresponding identification of chance or base case levels of the statistic. Using these measures a system that performs worse in the objective sense of Informedness, can appear to perform better under any of these commonly used measures. We discuss several concepts and measures that reflect the probability that prediction is informed versus chance. Informedness and introduce Markedness as a dual measure for the probability that prediction is marked versus chance. Finally we demonstrate elegant connections between the concepts of Informedness, Markedness, Correlation and Significance as well as their intuitive relationships with Recall and Precision, and outline the extension from the dichotomous case to the general multi-class case.

Contextualized Sarcasm Detection on Twitter <=SEP=> Sarcasm requires some shared knowledge between speaker and audience; it is a profoundly contextual phenomenon. Most computational approaches to sarcasm detection, however, treat it as a purely linguistic matter, using information such as lexical cues and their corresponding sentiment as predictive features. We show that by including extra-linguistic information from the context of an utterance on Twitter – such as properties of the author, the audience and the immediate communicative environment – we are able to achieve gains in accuracy compared to purely linguistic features in the detection of this complex phenomenon, while also shedding light on features of interpersonal interaction that enable sarcasm in conversation.

Metamaterial advances for radar and communications <=SEP=> Metamaterial antennas have progressed considerably in the last few years. Kymeta expects to have its Ku-band metamaterial antenna commercially available in 2017. It is intended for use on vessels anywhere in the world for high speed internet using satellites. Echodyne and PARC, a Xerox Co., have developed a metamaterial array for radar and cell phone usage. The Army Research Laboratory in Adelphi MD has funded the development of a metamaterial 250–505 MHZ antenna with a λ/20 thickness. Complementing this a conventional tightly coupled dipole antenna (TCDA) has been developed which provides a 20∶1 bandwidth with a λ/40 thickness. Target cloaking has been demonstrated at microwaves using metamaterials. With cloaking the electromagnetic wave signal transmitted by a radar goes around the target making it invisible. It has also been demonstrated at L-band with a 50% bandwidth using fractals. Stealthing by absorption using a thin flexible and stretchable metamaterials sheet has been demonstrated to give 6 dB absorption over the band from 8–10 GHz, larger absorption over a narrower band. Using fractals material < 1 mm thick simulation gave a 10 dB reduction in backscatter from 2 to 20 GHz, ∼20 dB reduction from 9 to 15 GHz. Good results were obtained for large incidence angles and both polarizations. Using metamaterial one can focus 6× beyond diffraction limit at 0.38 µm (Moore's Law marches on); 40× diffraction limit, λ/80, at 375 MHz. Has been used in cell phones to provide antennas 5× smaller (1/10th λ) having 700 MHz–2.7 GHz bandwidth. Provided isolation between antennas having 2.5 cm separation equivalent to lm separation. Used for phased array wide angle impedance matching (WAIM). It has been found that n-doped graphene has a negative index of refraction.