Abstract

In this paper we introduce a novel and efficient approach to detect topics in a large corpus of research papers. With rapidly growing size of academic literature, the problem of topic detection has become a very challenging task. We present a unique approach that uses closed frequent keyword-set to form topics. Our approach also provides a natural method to cluster the research papers into hierarchical, overlapping clusters using topic as similarity measure. To rank the research papers in the topic cluster, we devise a modified PageRank algorithm that assigns an authoritative score to each research paper by considering the sub-graph in which the research paper appears. We test our algorithms on the DBLP dataset and experimentally show that our algorithms are fast, effective and scalable.

Abstract

In this paper we propose an efficient method to rank the research papers from various fields of research published in various conferences over the years. This ranking method is based on citation network. The importance of a research paper is captured well by the peer vote, which in this case is the research paper being cited in other research papers. Using a modified version of the PageRank algorithm, we rank the research papers, assigning each of them an authoritative score. Using the scores of the research papers calculated by above mentioned method, we formulate scores for conferences and authors and rank them as well. We have introduced a new metric in the algorithm which takes into account the time factor in ranking the research papers to reduce the bias against the recent papers which get less time for being studied and consequently cited by the researchers as compared to the older papers. Often a researcher is more interested in finding the top conferences in a particular year rather than the overall conference ranking. Considering the year of publication of the papers, in addition to the paper scores we also calculated the year-wise score of each conference by slight improvisation of the above mentioned algorithm.

Abstract

The concept of similarity is fundamentally important in al-most every scientific field. Clustering, distance-based outlier detection,classification, regression and search are major data mining techniques which compute the similarities between instances and hence the choice of a particular similarity measure can turn out to be a major cause of success or failure of the algorithm. The notion of similarity or distance for categorical data is not as straightforward as for continuous data and hence, is a major challenge. This is due to the fact that different values taken by a categorical attribute are not inherently ordered and hence anotion of direct comparison between two categorical values is not pos-sible. In addition, the notion of similarity can differ depending on the particular domain, dataset, or task at hand. In this paper we present anew similarity measure for categorical data DISC - Data-Intensive Simi-larity Measure for Categorical Data. DISC captures the semantics of the data without any help from domain expert for defining the similarity. In addition to these, it is generic and simple to implement. These desirable features make it a very attractive alternative to existing approaches. Our experimental study compares it with 14 other similarity measures on 24standard real datasets, out of which 12 are used for classification and 12for regression, and shows that it is more accurate than all its competitors.

Abstract

Online advertising offers significantly finer granularity, which has been leveraged in state-of-the-art targeting methods, like Behavioral Targeting (BT). Such methods have been fur-ther complemented by recent work in Look-alike Modeling(LAM) which helps in creating models which are customized according to each advertiser’s requirements and each cam-paign’s characteristics, and which show ads to users who are most likely to convert on them, not just click them. In Look-a like Modeling given data about converters and non-converters, obtained from advertisers, we would like to train models automatically for each ad campaign. Such custom models would help target more users who are similar to the set of converters the advertiser provides. The advertisers get more freedom to define their preferred sets of users which should be used as a basis to build custom targeting models.In behavioral data, the number of conversions (positive class) per campaign is very small (conversions per impression for the advertisers in our data set are much less than 10−4),giving rise to a highly skewed training dataset, which has most records pertaining to the negative class. Campaigns with very few conversions are called as tail campaigns, and those with many conversions are called head campaigns.Creation of Look-alike Models for tail campaigns is very challenging and tricky using popular classifiers like Linear SVM and GBDT, because of the very few number of posi-tive class examples such campaigns contain. In this paper,we present an Associative Classification (AC) approach to LAM for tail campaigns. Pairs of features are used to deriverules to build a Rule-based Associative Classifier, with the rules being sorted by frequency-weighted log-likelihood ratio(F-LLR). The top krules, sorted by F-LLR, are then applied to any test record to score it. Individual features can also form rules by themselves, though the number of such rules in the top krules and the whole rule-set is very small. Our algorithm is based on Hadoop, and is thus very efficient in terms of speed.

Abstract

Associative Classification leverages Association Rule Min-ing (ARM) to train Rule-based classifiers. The classifiers are built on high quality Association Rules mined from the given dataset. Associative Classifiers are very accurate be-cause Association Rules encapsulate all the dominant and statistically significant relationships between items in the dataset. They are also very robust as noise in the form of insignificant and low-frequency itemsets are eliminated dur-ing the mining and training stages. Moreover, the rules are easy-to-comprehend, thus making the classifier transparent.Conventional Associative Classification and Association Rule Mining (ARM) algorithms are inherently designed to work only with binary attributes, and expect any quantita-tive attributes to be converted to binary ones using ranges,like “Age = [25, 60]”. In order to mitigate this constraint,Fuzzy logic is used to convert quantitative attributes to fuzzy binary attributes, like “Age = Middle-aged”, so as to elimi-nate any loss of information arising due to sharp partition-ing, especially at partition boundaries, and then generate Fuzzy Association Rules using an appropriate Fuzzy ARM algorithm. These Fuzzy Association Rules can then be used to train a Fuzzy Associative Classifier. In this paper, we also show how Fuzzy Associative Classifiers so built can be used in a wide variety of domains and datasets, like transactional datasets and image datasets.

Abstract

We use text mining mechanisms to analyze Hot days in news feeds. We build upon the earlier work used to detect Hot topics and assume that we have already attained the Hot days. In this paper we identify the most relevant documents of a topic on a Hot day. We construct a similarity based technique for identifying and ranking these documents. Our aim is to automatically detect chains of hot correlated events over time.We develop a scheme using similarity measures like cosine similarity and KL-divergence to find correlation between these Hot days. For the ‘U.S. Presidential Elections’, the presidential debates which spanned over a week was one such event.

Abstract

In this paper, we address the problem of active learning using the notion of in uence sets based on Reverse Nearest Neighbor. Active learning is an area of machine learning which emphasizes on achiev-ing optimal classi cation performance using as few labeled samples as possible. Reverse nearest neighbors have been used in domains such a sclustering and outliers detection in the past e ectively. In this paper, we devise a new sampling method for instances based on the knowledge pro-vided from RNN in uence sets. To demonstrate the eectiveness of our sampling method, we compare its performance against existing sampling methods on few real life datasets. The experimental results show that our technique outperforms existing methods, particularly on multi-class datasets

Abstract

The thermostat control variable in conventional HVAC System is air temprature Ta

Abstract

The study, conducted in composite climate of India, exhibits improvement in energy efficiency of a conditioned building block with the use of energy conservation measures (ECMs) recommended by National Energy Conservation Building Code (ECBC). In first part of it, subject building model was individually applied with five ECMs and two combinations of these ECMs by using constant thermostat settings. Similarly in second part of the study the same was done with adaptive thermostat settings. Sensitivity analysis showed that the effect of ECMs get reduced with increase in building footprint and internal loads. Analysis of thermal comfort in an unconditioned building using same set of ECMs was also carried out to see improvement in comfort hours.

Abstract

This article presents an approach for speeding EnergyPlus simulations. The computing run time of an energy simulation depends on several variables and is directly proportional to the simulation RunPeriod. In the proposed approach, data parallelization is achieved by breaking an annual simulation into several segments of smaller RunPeriod, each handled by a separate computer/processor. The speed gain achieved by running 12 one-month RunPeriod segments in parallel as compared to single simulation of 12 months is between three and six times. Segmentation of simulation has resulted in minor deviations between the results obtained through segmented simulations and annual simulations. Methods for reducing these deviations on annual and monthly basis are presented in this article using 12 benchmark models each simulated for five cities. On annual basis, a maximum deviation of 0.06% was observed …