Unnamed: 0.1 int64 0 41k | Unnamed: 0 int64 0 41k | author stringlengths 9 1.39k | id stringlengths 11 18 | summary stringlengths 25 3.66k | title stringlengths 4 258 | year int64 1.99k 2.02k | arxiv_url stringlengths 32 39 | info stringlengths 523 3.18k | embeddings stringlengths 16.9k 17.1k |
|---|---|---|---|---|---|---|---|---|---|
40,700 | 40,700 | ['Valentina Zantedeschi', 'Rémi Emonet', 'Marc Sebban'] | 1604.01376v1 | Many theoretical results in the machine learning domain stand only for
functions that are Lipschitz continuous. Lipschitz continuity is a strong form
of continuity that linearly bounds the variations of a function. In this paper,
we derive tight Lipschitz constants for two families of metrics: Mahalanobis
distances and... | Lipschitz Continuity of Mahalanobis Distances and Bilinear Forms | 2,016 | http://arxiv.org/pdf/1604.01376v1 | Title Lipschitz Continuity Mahalanobis Distances Bilinear Forms Summary Many theoretical result machine learning domain stand function Lipschitz continuous Lipschitz continuity strong form continuity linearly bound variation function paper derive tight Lipschitz constant two family metric Mahalanobis distance boundedsp... | [-0.062174610793590546, -0.00512247858569026, -0.0324493944644928, 0.005279574543237686, -0.030366845428943634, -0.01709362491965294, 0.008429797366261482, 0.052457332611083984, -0.011634309776127338, 0.01522090658545494, -0.0009347890736535192, -0.03699999302625656, 0.004076810088008642, 0.024385539814829826, -0.00038... |
40,701 | 40,701 | ['Mikhail Kolmogorov', 'Eamonn Kennedy', 'Zhuxin Dong', 'Gregory Timp', 'Pavel Pevzner'] | 1604.02270v2 | Recent advances in top-down mass spectrometry enabled identification of
intact proteins, but this technology still faces challenges. For example,
top-down mass spectrometry suffers from a lack of sensitivity since the ion
counts for a single fragmentation event are often low. In contrast, nanopore
technology is exquisi... | Single-Molecule Protein Identification by Sub-Nanopore Sensors | 2,016 | http://arxiv.org/pdf/1604.02270v2 | Title SingleMolecule Protein Identification SubNanopore Sensors Summary Recent advance topdown mass spectrometry enabled identification intact protein technology still face challenge example topdown mass spectrometry suffers lack sensitivity since ion count single fragmentation event often low contrast nanopore technol... | [0.04107718542218208, -0.01693800278007984, -0.0010070267599076033, -0.006566056050360203, -0.028861355036497116, 0.014015627093613148, 0.04537901654839516, 0.03637571260333061, 0.05919956788420677, -0.02454831823706627, 0.01972126215696335, 0.010610583238303661, 0.016596872359514236, 0.043599583208560944, 0.0361105203... |
40,702 | 40,702 | ['Dezhi Fang', 'Duen Horng Chau'] | 1604.03034v1 | To process data that do not fit in RAM, conventional wisdom would suggest
using distributed approaches. However, recent research has demonstrated virtual
memory's strong potential in scaling up graph mining algorithms on a single
machine. We propose to use a similar approach for general machine learning. We
contribute:... | M3: Scaling Up Machine Learning via Memory Mapping | 2,016 | http://arxiv.org/pdf/1604.03034v1 | Title M3 Scaling Machine Learning via Memory Mapping Summary process data fit RAM conventional wisdom would suggest using distributed approach However recent research demonstrated virtual memory strong potential scaling graph mining algorithm single machine propose use similar approach general machine learning contribu... | [-0.0012309930752962828, -0.01963106170296669, -0.03541968762874603, 0.006173100788146257, 0.010170439258217812, 0.012029695324599743, 0.014827153645455837, 0.006141554564237595, 0.045960232615470886, 0.0124385179951787, 0.011542982421815395, -0.006442982237786055, -0.029768619686365128, 0.07875073701143265, -0.0094174... |
40,703 | 40,703 | ['Jamie Morgenstern', 'Tim Roughgarden'] | 1604.03171v1 | We present a general framework for proving polynomial sample complexity
bounds for the problem of learning from samples the best auction in a class of
"simple" auctions. Our framework captures all of the most prominent examples of
"simple" auctions, including anonymous and non-anonymous item and bundle
pricings, with e... | Learning Simple Auctions | 2,016 | http://arxiv.org/pdf/1604.03171v1 | Title Learning Simple Auctions Summary present general framework proving polynomial sample complexity bound problem learning sample best auction class simple auction framework capture prominent example simple auction including anonymous nonanonymous item bundle pricing either single multiple buyer technique propose bre... | [-0.015656188130378723, 0.057997871190309525, 0.004479135386645794, 0.004249954596161842, -0.02147083356976509, -0.023067956790328026, 0.012895049527287483, 0.0009872923837974668, -0.0014760055346414447, -0.0330054946243763, 0.030572524294257164, 0.03181769698858261, 0.00037701247492805123, 0.05865255743265152, -0.0074... |
40,704 | 40,704 | ['Alireza Hajibagheri', 'Gita Sukthankar', 'Kiran Lakkaraju'] | 1604.03221v1 | The aim of link prediction is to forecast connections that are most likely to
occur in the future, based on examples of previously observed links. A key
insight is that it is useful to explicitly model network dynamics, how
frequently links are created or destroyed when doing link prediction. In this
paper, we introduc... | Leveraging Network Dynamics for Improved Link Prediction | 2,016 | http://arxiv.org/pdf/1604.03221v1 | Title Leveraging Network Dynamics Improved Link Prediction Summary aim link prediction forecast connection likely occur future based example previously observed link key insight useful explicitly model network dynamic frequently link created destroyed link prediction paper introduce new supervised link prediction frame... | [-0.028287021443247795, 0.009154113940894604, -0.055406197905540466, -0.024403385818004608, -0.021003421396017075, -0.060051947832107544, 0.0069195847027003765, -0.027979839593172073, 0.012210655957460403, -0.016551803797483444, 0.04451907053589821, 0.013082948513329029, 0.00047319746227003634, 0.05541427433490753, 0.0... |
40,705 | 40,705 | ['Mallory Sheth', 'Roy Welsch', 'Natasha Markuzon'] | 1604.03248v1 | In many data classification problems, there is no linear relationship between
an explanatory and the dependent variables. Instead, there may be ranges of the
input variable for which the observed outcome is signficantly more or less
likely. This paper describes an algorithm for automatic detection of such
thresholds, c... | The Univariate Flagging Algorithm (UFA): a Fully-Automated Approach for
Identifying Optimal Thresholds in Data | 2,016 | http://arxiv.org/pdf/1604.03248v1 | Title Univariate Flagging Algorithm UFA FullyAutomated Approach Identifying Optimal Thresholds Data Summary many data classification problem linear relationship explanatory dependent variable Instead may range input variable observed outcome signficantly le likely paper describes algorithm automatic detection threshold... | [-0.005047440994530916, 0.03361004963517189, -0.02029774896800518, -0.029717547819018364, 0.01463885698467493, 0.011494719423353672, 0.057105161249637604, 0.024525683373212814, -0.012788082472980022, -0.02563946135342121, 0.07162503153085709, 0.05136286839842796, -0.025343304499983788, 0.059940800070762634, -0.08690842... |
40,706 | 40,706 | ['Raef Bassily', 'Yoav Freund'] | 1604.03336v2 | In this paper, we introduce a notion of algorithmic stability called typical
stability. When our goal is to release real-valued queries (statistics)
computed over a dataset, this notion does not require the queries to be of
bounded sensitivity -- a condition that is generally assumed under differential
privacy [DMNS06,... | Typical Stability | 2,016 | http://arxiv.org/pdf/1604.03336v2 | Title Typical Stability Summary paper introduce notion algorithmic stability called typical stability goal release realvalued query statistic computed dataset notion require query bounded sensitivity condition generally assumed differential privacy DMNS06 Dwork06 used notion algorithmic stability DFHPRR15a DFHPRR15b BN... | [-0.054249875247478485, 0.016651146113872528, -0.03212488815188408, -0.00514144916087389, -0.01952306367456913, -0.05295916274189949, 0.03172573074698448, -0.009962119162082672, -0.01768527925014496, 0.03529801592230797, 0.03961118683218956, 0.009695113636553288, 0.02589876390993595, 0.054536134004592896, -0.0322155617... |
40,707 | 40,707 | ['Liangjie Hong', 'Adnan Boz'] | 1604.03506v1 | One of missions for personalization systems and recommender systems is to
show content items according to users' personal interests. In order to achieve
such goal, these systems are learning user interests over time and trying to
present content items tailoring to user profiles. Recommending items according
to users' p... | An Unbiased Data Collection and Content Exploitation/Exploration
Strategy for Personalization | 2,016 | http://arxiv.org/pdf/1604.03506v1 | Title Unbiased Data Collection Content ExploitationExploration Strategy Personalization Summary One mission personalization system recommender system show content item according user personal interest order achieve goal system learning user interest time trying present content item tailoring user profile Recommending i... | [0.04140830785036087, 0.02017679251730442, -0.030529554933309555, -0.020657040178775787, 0.018662558868527412, -0.017331065610051155, 0.052798498421907425, -0.02211630716919899, 0.025332922115921974, -0.03997150808572769, -0.0121995247900486, 0.05336872488260269, -0.009509779512882233, 0.060040444135665894, -0.02691035... |
40,708 | 40,708 | ['Zhouyuan Huo', 'Heng Huang'] | 1604.03584v4 | We provide the first theoretical analysis on the convergence rate of the
asynchronous stochastic variance reduced gradient (SVRG) descent algorithm on
non-convex optimization. Recent studies have shown that the asynchronous
stochastic gradient descent (SGD) based algorithms with variance reduction
converge with a linea... | Asynchronous Stochastic Gradient Descent with Variance Reduction for
Non-Convex Optimization | 2,016 | http://arxiv.org/pdf/1604.03584v4 | Title Asynchronous Stochastic Gradient Descent Variance Reduction NonConvex Optimization Summary provide first theoretical analysis convergence rate asynchronous stochastic variance reduced gradient SVRG descent algorithm nonconvex optimization Recent study shown asynchronous stochastic gradient descent SGD based algor... | [-0.011296496726572514, 0.002201996510848403, -0.01778237521648407, 0.00019756263645831496, 0.0015289639122784138, -0.008500665426254272, 0.0064323665574193, -0.005723471753299236, -0.040177199989557266, 0.052204400300979614, -0.007449306081980467, 0.00011076969531131908, 0.0072547937743365765, 0.014119441621005535, -0... |
40,709 | 40,709 | ['Dylan Hutchison'] | 1604.04639v1 | Data scientists engage in model construction to discover machine learning
models that well explain a dataset, in terms of predictiveness,
understandability and generalization across domains. Questions such as "what if
we model common cause Z" and "what if Y's dependence on X reverses" inspire
many candidate models to c... | ModelWizard: Toward Interactive Model Construction | 2,016 | http://arxiv.org/pdf/1604.04639v1 | Title ModelWizard Toward Interactive Model Construction Summary Data scientist engage model construction discover machine learning model well explain dataset term predictiveness understandability generalization across domain Questions model common cause Z Ys dependence X revers inspire many candidate model consider com... | [0.0012544478522613645, 0.03426983207464218, -0.04677397757768631, -0.029425544664263725, -0.016331570222973824, -0.002292812103405595, 0.029231049120426178, -0.014060514979064465, -0.015061337500810623, -0.01203982625156641, 0.0526433028280735, 0.03149932622909546, 0.007553128059953451, 0.11196689307689667, 0.00060602... |
40,710 | 40,710 | ['Fouad Khan'] | 1604.04893v1 | K-means is one of the most widely used clustering algorithms in various
disciplines, especially for large datasets. However the method is known to be
highly sensitive to initial seed selection of cluster centers. K-means++ has
been proposed to overcome this problem and has been shown to have better
accuracy and computa... | An Initial Seed Selection Algorithm for K-means Clustering of
Georeferenced Data to Improve Replicability of Cluster Assignments for
Mapping Application | 2,016 | http://arxiv.org/pdf/1604.04893v1 | Title Initial Seed Selection Algorithm Kmeans Clustering Georeferenced Data Improve Replicability Cluster Assignments Mapping Application Summary Kmeans one widely used clustering algorithm various discipline especially large datasets However method known highly sensitive initial seed selection cluster center Kmeans pr... | [0.000496017630212009, -0.013037786819040775, -0.05418940633535385, -0.005972982384264469, -0.03471314534544945, -0.0040442729368805885, 0.05937478691339493, 0.023566069081425667, 0.026333743706345558, -0.0040121315978467464, 0.05707211047410965, 0.0737181082367897, 0.0519954077899456, 0.020977167412638664, 0.006734739... |
40,711 | 40,711 | ['Fereshteh Asgari', 'Alexis Sultan', 'Haoyi Xiong', 'Vincent Gauthier', 'Mounim El-Yacoubi'] | 1604.06577v1 | Mobile phone data have recently become an attractive source of information
about mobility behavior. Since cell phone data can be captured in a passive way
for a large user population, they can be harnessed to collect well-sampled
mobility information. In this paper, we propose CT-Mapper, an unsupervised
algorithm that ... | CT-Mapper: Mapping Sparse Multimodal Cellular Trajectories using a
Multilayer Transportation Network | 2,016 | http://arxiv.org/pdf/1604.06577v1 | Title CTMapper Mapping Sparse Multimodal Cellular Trajectories using Multilayer Transportation Network Summary Mobile phone data recently become attractive source information mobility behavior Since cell phone data captured passive way large user population harnessed collect wellsampled mobility information paper propo... | [-0.02901574783027172, 0.03271016478538513, -0.02427433244884014, -0.034110378473997116, -0.021575668826699257, 0.002133465837687254, 0.0019319785060361028, -0.05395480990409851, -0.07706627994775772, -0.010389124043285847, 0.058887116611003876, 0.019363462924957275, 0.002426695777103305, -0.00796755962073803, 0.037573... |
40,712 | 40,712 | ['Steffen Staab', 'Sophie Stalla-Bourdillon', 'Laura Carmichael'] | 1604.07180v1 | The research question this report addresses is: how, and to what extent,
those directly involved with the design, development and employment of a
specific black box algorithm can be certain that it is not unlawfully
discriminating (directly and/or indirectly) against particular persons with
protected characteristics (e... | Observing and Recommending from a Social Web with Biases | 2,016 | http://arxiv.org/pdf/1604.07180v1 | Title Observing Recommending Social Web Biases Summary research question report address extent directly involved design development employment specific black box algorithm certain unlawfully discriminating directly andor indirectly particular person protected characteristic eg gender race ethnicity Authors 0 Ahmed Osma... | [0.06716877967119217, 0.05273514986038208, -0.0263375137001276, -0.04989923536777496, 0.0019260896369814873, 0.025750726461410522, 0.11552417278289795, 0.006351069081574678, 0.07233654707670212, -0.06414575129747391, -0.013621588237583637, -0.005945500452071428, 0.0429675318300724, 0.03633635863661766, -0.0315633602440... |
40,713 | 40,713 | ['Tobias Schnabel', 'Adith Swaminathan', 'Peter Frazier', 'Thorsten Joachims'] | 1604.07209v1 | Eliciting relevance judgments for ranking evaluation is labor-intensive and
costly, motivating careful selection of which documents to judge. Unlike
traditional approaches that make this selection deterministically,
probabilistic sampling has shown intriguing promise since it enables the design
of estimators that are p... | Unbiased Comparative Evaluation of Ranking Functions | 2,016 | http://arxiv.org/pdf/1604.07209v1 | Title Unbiased Comparative Evaluation Ranking Functions Summary Eliciting relevance judgment ranking evaluation laborintensive costly motivating careful selection document judge Unlike traditional approach make selection deterministically probabilistic sampling shown intriguing promise since enables design estimator pr... | [0.0045379395596683025, 0.027504775673151016, -0.04304656758904457, -0.038364607840776443, -0.007093917112797499, -0.0303067434579134, 0.09254908561706543, 0.005464222747832537, -0.0011169335339218378, -0.025533653795719147, 0.021620050072669983, 0.022377707064151764, 0.0512755885720253, 0.01449557300657034, -0.0026176... |
40,714 | 40,714 | ['Edip Demirbilek', 'Jean-Charles Grégoire'] | 1604.07211v1 | We have developed reduced reference parametric models for estimating
perceived quality in audiovisual multimedia services. We have created 144
unique configurations for audiovisual content including various application and
network parameters such as bitrates and distortions in terms of bandwidth,
packet loss rate and j... | Towards Reduced Reference Parametric Models for Estimating Audiovisual
Quality in Multimedia Services | 2,016 | http://arxiv.org/pdf/1604.07211v1 | Title Towards Reduced Reference Parametric Models Estimating Audiovisual Quality Multimedia Services Summary developed reduced reference parametric model estimating perceived quality audiovisual multimedia service created 144 unique configuration audiovisual content including various application network parameter bitra... | [-0.008521097712218761, -0.01335259061306715, -0.010822056792676449, -0.05868326500058174, -0.02701452188193798, -0.0311459731310606, 0.017298247665166855, 0.01732136681675911, -0.1071043610572815, -0.049301546066999435, -0.03917001932859421, -0.021798649802803993, 0.03773368149995804, 0.051910944283008575, 0.010794548... |
40,715 | 40,715 | ['Bert J. Claessens', 'Peter Vrancx', 'Frederik Ruelens'] | 1604.08382v2 | Direct load control of a heterogeneous cluster of residential demand
flexibility sources is a high-dimensional control problem with partial
observability. This work proposes a novel approach that uses a convolutional
neural network to extract hidden state-time features to mitigate the curse of
partial observability. Mo... | Convolutional Neural Networks For Automatic State-Time Feature
Extraction in Reinforcement Learning Applied to Residential Load Control | 2,016 | http://arxiv.org/pdf/1604.08382v2 | Title Convolutional Neural Networks Automatic StateTime Feature Extraction Reinforcement Learning Applied Residential Load Control Summary Direct load control heterogeneous cluster residential demand flexibility source highdimensional control problem partial observability work proposes novel approach us convolutional n... | [-0.09044639021158218, 0.019755905494093895, -0.026237109676003456, 0.05187235027551651, 0.015311677008867264, -0.013032575137913227, 0.07185986638069153, -0.0036249635741114616, 0.05736318603157997, 0.020829737186431885, -0.00842383410781622, 0.09831138700246811, -0.007240816485136747, 0.052204422652721405, 0.05242062... |
40,716 | 40,716 | ['Z. Roshan Zamir'] | 1604.08500v1 | An epileptic seizure is a transient event of abnormal excessive neuronal
discharge in the brain. This unwanted event can be obstructed by detection of
electrical changes in the brain that happen before the seizure takes place. The
automatic detection of seizures is necessary since the visual screening of EEG
recordings... | Detection of epileptic seizure in EEG signals using linear least squares
preprocessing | 2,016 | http://arxiv.org/pdf/1604.08500v1 | Title Detection epileptic seizure EEG signal using linear least square preprocessing Summary epileptic seizure transient event abnormal excessive neuronal discharge brain unwanted event obstructed detection electrical change brain happen seizure take place automatic detection seizure necessary since visual screening EE... | [-0.03339968994259834, -0.021695267409086227, -0.004515107721090317, 0.03286716341972351, 0.05442992225289345, 0.026823339983820915, 0.008292420767247677, 0.030850760638713837, 0.013376601971685886, -0.022745415568351746, 0.06477610021829605, -0.010938947089016438, -0.007801992818713188, 0.0546862855553627, 0.006718604... |
40,717 | 40,717 | ['Eric Makita', 'Artem Lenskiy'] | 1604.08608v1 | Movie ratings play an important role both in determining the likelihood of a
potential viewer to watch the movie and in reflecting the current viewer
satisfaction with the movie. They are available in several sources like the
television guide, best-selling reference books, newspaper columns, and
television programs. Fu... | A movie genre prediction based on Multivariate Bernoulli model and genre
correlations | 2,016 | http://arxiv.org/pdf/1604.08608v1 | Title movie genre prediction based Multivariate Bernoulli model genre correlation Summary Movie rating play important role determining likelihood potential viewer watch movie reflecting current viewer satisfaction movie available several source like television guide bestselling reference book newspaper column televisio... | [0.017057694494724274, 0.04370942711830139, -0.010268927551805973, -0.021790558472275734, 0.010173025541007519, 0.025658629834651947, 0.04486249014735222, 0.027125606313347816, -0.025045033544301987, -0.044421881437301636, -0.022357182577252388, -0.0214445311576128, -0.010712104849517345, 0.07706337422132492, 0.0033709... |
40,718 | 40,718 | ['Bob L. Sturm', 'João Felipe Santos', 'Oded Ben-Tal', 'Iryna Korshunova'] | 1604.08723v1 | We apply deep learning methods, specifically long short-term memory (LSTM)
networks, to music transcription modelling and composition. We build and train
LSTM networks using approximately 23,000 music transcriptions expressed with a
high-level vocabulary (ABC notation), and use them to generate new
transcriptions. Our ... | Music transcription modelling and composition using deep learning | 2,016 | http://arxiv.org/pdf/1604.08723v1 | Title Music transcription modelling composition using deep learning Summary apply deep learning method specifically long shortterm memory LSTM network music transcription modelling composition build train LSTM network using approximately 23000 music transcription expressed highlevel vocabulary ABC notation use generate... | [-0.0036442435812205076, 0.012267385609447956, 0.0007205932051874697, 0.032521460205316544, -0.025205954909324646, -0.029513472691178322, 0.03501760587096214, -0.019323060289025307, -0.05945684760808945, 0.05854586884379387, -0.07319192588329315, 0.00225464953109622, 0.042766816914081573, 0.02350153960287571, 0.0175049... |
40,719 | 40,719 | ['Jeroen Zegers', 'Hugo Van hamme'] | 1604.08852v1 | Non-negative Matrix Factorization (NMF) has already been applied to learn
speaker characterizations from single or non-simultaneous speech for speaker
recognition applications. It is also known for its good performance in (blind)
source separation for simultaneous speech. This paper explains how NMF can be
used to join... | Joint Sound Source Separation and Speaker Recognition | 2,016 | http://arxiv.org/pdf/1604.08852v1 | Title Joint Sound Source Separation Speaker Recognition Summary Nonnegative Matrix Factorization NMF already applied learn speaker characterization single nonsimultaneous speech speaker recognition application also known good performance blind source separation simultaneous speech paper explains NMF used jointly solve ... | [-0.017832355573773384, 0.027346964925527573, 0.021736089140176773, 0.04325137287378311, 0.005243368446826935, 0.005074044689536095, 0.04822973534464836, 0.022519132122397423, -0.04074070602655411, 0.00022293538495432585, -0.0782584697008133, 0.0037565501406788826, 0.04855675250291824, -0.01533531118184328, -0.01017344... |
40,720 | 40,720 | ["Vladimir V. V'yugin"] | 0808.3746v2 | Using the game-theoretic framework for probability, Vovk and Shafer. have
shown that it is always possible, using randomization, to make sequential
probability forecasts that pass any countable set of well-behaved statistical
tests. This result generalizes work by other authors, who consider only tests
of calbration.
... | A game-theoretic version of Oakes' example for randomized forecasting | 2,008 | http://arxiv.org/pdf/0808.3746v2 | Title gametheoretic version Oakes example randomized forecasting Summary Using gametheoretic framework probability Vovk Shafer shown always possible using randomization make sequential probability forecast pas countable set wellbehaved statistical test result generalizes work author consider test calbration complement ... | [0.009307678788900375, 0.08061213046312332, -0.02927653305232525, -0.05330027639865875, -0.044240083545446396, -0.02568724751472473, 0.044855907559394836, -0.013353520072996616, -0.00896246824413538, 0.034967150539159775, 0.06552116572856903, -0.007073864806443453, 0.033514443784952164, 0.06340785324573517, -0.02250099... |
40,721 | 40,721 | ['Maxime Berar', 'Françoise Tilotta', 'Joan Alexis Glaunès', 'Yves Rozenholc'] | 1202.2703v1 | In this paper, we present a computer-assisted method for facial
reconstruction. This method provides an estimation of the facial shape
associated with unidentified skeletal remains. Current computer-assisted
methods using a statistical framework rely on a common set of extracted points
located on the bone and soft-tiss... | Craniofacial reconstruction as a prediction problem using a Latent Root
Regression model | 2,012 | http://arxiv.org/pdf/1202.2703v1 | Title Craniofacial reconstruction prediction problem using Latent Root Regression model Summary paper present computerassisted method facial reconstruction method provides estimation facial shape associated unidentified skeletal remains Current computerassisted method using statistical framework rely common set extract... | [0.050829529762268066, 0.07017198950052261, 0.011398705653846264, -0.03701702132821083, -0.007550832349807024, 0.009295189753174782, 0.02518782950937748, 0.013986041769385338, -0.051686130464076996, 0.025699570775032043, 0.05752156674861908, -0.06104416772723198, 0.0872795432806015, 0.022359659895300865, 0.049822814762... |
40,722 | 40,722 | ['Christos Boutsidis', 'Petros Drineas', 'Malik Magdon-Ismail'] | 1202.3505v2 | We study (constrained) least-squares regression as well as multiple response
least-squares regression and ask the question of whether a subset of the data,
a coreset, suffices to compute a good approximate solution to the regression.
We give deterministic, low order polynomial-time algorithms to construct such
coresets... | Near-optimal Coresets For Least-Squares Regression | 2,012 | http://arxiv.org/pdf/1202.3505v2 | Title Nearoptimal Coresets LeastSquares Regression Summary study constrained leastsquares regression well multiple response leastsquares regression ask question whether subset data coreset suffices compute good approximate solution regression give deterministic low order polynomialtime algorithm construct coresets appr... | [-0.09559793770313263, 0.040990930050611496, -0.035592224448919296, 0.022185558453202248, -0.021693408489227295, 0.0096115842461586, 0.027966661378741264, 0.06428822875022888, 0.05069325864315033, 0.0680544450879097, 0.020115725696086884, 0.03903823345899582, 0.007383772637695074, 0.021059252321720123, 0.00738239008933... |
40,723 | 40,723 | ['Karthekeyan Chandrasekaran', 'Richard Karp'] | 1202.3639v3 | We study the problem of learning a most biased coin among a set of coins by
tossing the coins adaptively. The goal is to minimize the number of tosses
until we identify a coin i* whose posterior probability of being most biased is
at least 1-delta for a given delta. Under a particular probabilistic model, we
give an op... | Finding a most biased coin with fewest flips | 2,012 | http://arxiv.org/pdf/1202.3639v3 | Title Finding biased coin fewest flip Summary study problem learning biased coin among set coin tossing coin adaptively goal minimize number toss identify coin whose posterior probability biased least 1delta given delta particular probabilistic model give optimal algorithm ie algorithm minimizes expected number future ... | [-0.026408016681671143, 0.010458852164447308, -0.01841268688440323, -0.013991071842610836, -0.039093535393476486, 0.0035663903690874577, -0.027442235499620438, 0.020405545830726624, -0.0040392219088971615, 0.005208107642829418, 0.04285596311092377, 0.03724159672856331, -0.0044845654629170895, 0.0014963611029088497, 0.0... |
40,724 | 40,724 | ['Brendan P. W. Ames'] | 1202.3663v6 | Identifying clusters of similar objects in data plays a significant role in a
wide range of applications. As a model problem for clustering, we consider the
densest k-disjoint-clique problem, whose goal is to identify the collection of
k disjoint cliques of a given weighted complete graph maximizing the sum of the
dens... | Guaranteed clustering and biclustering via semidefinite programming | 2,012 | http://arxiv.org/pdf/1202.3663v6 | Title Guaranteed clustering biclustering via semidefinite programming Summary Identifying cluster similar object data play significant role wide range application model problem clustering consider densest kdisjointclique problem whose goal identify collection k disjoint clique given weighted complete graph maximizing s... | [-0.044730715453624725, -0.03239334002137184, -0.028770793229341507, 0.05684628337621689, -0.009751170873641968, -0.0061421883292496204, -0.0032242550514638424, 0.052673887461423874, 0.07725294679403305, 0.0294498223811388, 0.04248255863785744, 0.024617835879325867, -0.04884261637926102, 0.015968428924679756, -0.014463... |
40,725 | 40,725 | ['Sebastien Bubeck', 'Aleksandrs Slivkins'] | 1202.4473v1 | We present a new bandit algorithm, SAO (Stochastic and Adversarial Optimal),
whose regret is, essentially, optimal both for adversarial rewards and for
stochastic rewards. Specifically, SAO combines the square-root worst-case
regret of Exp3 (Auer et al., SIAM J. on Computing 2002) and the
(poly)logarithmic regret of UC... | The best of both worlds: stochastic and adversarial bandits | 2,012 | http://arxiv.org/pdf/1202.4473v1 | Title best world stochastic adversarial bandit Summary present new bandit algorithm SAO Stochastic Adversarial Optimal whose regret essentially optimal adversarial reward stochastic reward Specifically SAO combine squareroot worstcase regret Exp3 Auer et al SIAM J Computing 2002 polylogarithmic regret UCB1 Auer et al M... | [0.025592071935534477, 0.0625394657254219, 0.009916736744344234, 0.0014394497266039252, -0.008748810738325119, -0.004512563813477755, 0.034062083810567856, 0.02077368274331093, 0.004028845112770796, -0.009761612862348557, 0.0018038142006844282, -0.019352180883288383, -0.03964770585298538, 0.025637609884142876, 0.050051... |
40,726 | 40,726 | ['Raphael Fonteneau', 'Damien Ernst', 'Bernard Boigelot', 'Quentin Louveaux'] | 1202.5298v2 | We study the minmax optimization problem introduced in [22] for computing
policies for batch mode reinforcement learning in a deterministic setting.
First, we show that this problem is NP-hard. In the two-stage case, we provide
two relaxation schemes. The first relaxation scheme works by dropping some
constraints in or... | Min Max Generalization for Two-stage Deterministic Batch Mode
Reinforcement Learning: Relaxation Schemes | 2,012 | http://arxiv.org/pdf/1202.5298v2 | Title Min Max Generalization Twostage Deterministic Batch Mode Reinforcement Learning Relaxation Schemes Summary study minmax optimization problem introduced 22 computing policy batch mode reinforcement learning deterministic setting First show problem NPhard twostage case provide two relaxation scheme first relaxation... | [-0.014716713689267635, 0.04630972072482109, 0.014563373290002346, -0.009890136308968067, -0.009013772010803223, -0.014736122451722622, -0.015212956815958023, 0.050778962671756744, -0.04390718787908554, 0.007943768054246902, 0.03391517326235771, -0.0067374203354120255, -0.008447987958788872, -0.018297037109732628, -0.0... |
40,727 | 40,727 | ['Dimitrios Giannakis', 'Andrew J. Majda'] | 1202.6103v2 | We present a technique for spatiotemporal data analysis called nonlinear
Laplacian spectral analysis (NLSA), which generalizes singular spectrum
analysis (SSA) to take into account the nonlinear manifold structure of complex
data sets. The key principle underlying NLSA is that the functions used to
represent temporal p... | Nonlinear Laplacian spectral analysis: Capturing intermittent and
low-frequency spatiotemporal patterns in high-dimensional data | 2,012 | http://arxiv.org/pdf/1202.6103v2 | Title Nonlinear Laplacian spectral analysis Capturing intermittent lowfrequency spatiotemporal pattern highdimensional data Summary present technique spatiotemporal data analysis called nonlinear Laplacian spectral analysis NLSA generalizes singular spectrum analysis SSA take account nonlinear manifold structure comple... | [-0.04992062598466873, -0.010343367233872414, -0.016453415155410767, 0.07195935398340225, 0.02260953187942505, -0.018110007047653198, 0.013880670070648193, 0.020548325031995773, -0.012847513891756535, -0.0065917675383389, 0.05674199014902115, -1.4577401088899933e-05, 0.009870771318674088, 0.05578305199742317, 0.0168700... |
40,728 | 40,728 | ['Nicolas Le Roux', 'Mark Schmidt', 'Francis Bach'] | 1202.6258v4 | We propose a new stochastic gradient method for optimizing the sum of a
finite set of smooth functions, where the sum is strongly convex. While
standard stochastic gradient methods converge at sublinear rates for this
problem, the proposed method incorporates a memory of previous gradient values
in order to achieve a l... | A Stochastic Gradient Method with an Exponential Convergence Rate for
Finite Training Sets | 2,012 | http://arxiv.org/pdf/1202.6258v4 | Title Stochastic Gradient Method Exponential Convergence Rate Finite Training Sets Summary propose new stochastic gradient method optimizing sum finite set smooth function sum strongly convex standard stochastic gradient method converge sublinear rate problem proposed method incorporates memory previous gradient value ... | [-0.00827428512275219, 0.020969711244106293, 0.020426489412784576, 0.024367380887269974, -0.010071290656924248, 0.0072745224460959435, -0.023152384907007217, -0.046456389129161835, 0.0009225066169165075, 0.02530648559331894, 0.028122184798121452, -0.029187345877289772, 0.028655463829636574, 0.033644650131464005, 0.0273... |
40,729 | 40,729 | ['Nima Hatami', 'Camelia Chira', 'Giuliano Armano'] | 1206.0335v1 | Hierarchical Text Categorization (HTC) is becoming increasingly important
with the rapidly growing amount of text data available in the World Wide Web.
Among the different strategies proposed to cope with HTC, the Local Classifier
per Node (LCN) approach attains good performance by mirroring the underlying
class hierar... | A Route Confidence Evaluation Method for Reliable Hierarchical Text
Categorization | 2,012 | http://arxiv.org/pdf/1206.0335v1 | Title Route Confidence Evaluation Method Reliable Hierarchical Text Categorization Summary Hierarchical Text Categorization HTC becoming increasingly important rapidly growing amount text data available World Wide Web Among different strategy proposed cope HTC Local Classifier per Node LCN approach attains good perform... | [0.0619773343205452, 0.03294936195015907, -0.011368357576429844, 0.0074493298307061195, -0.035081710666418076, 0.022727120667696, 0.01940731517970562, 0.0545775331556797, 0.057567279785871506, -0.10004162043333054, -0.018456047400832176, -0.0041920896619558334, -0.0035351496189832687, -1.3673979083250742e-05, -0.052967... |
40,730 | 40,730 | ['Mohamed Elarnaoty', 'Samir AbdelRahman', 'Aly Fahmy'] | 1206.1011v1 | Opinion mining aims at extracting useful subjective information from reliable
amounts of text. Opinion mining holder recognition is a task that has not been
considered yet in Arabic Language. This task essentially requires deep
understanding of clauses structures. Unfortunately, the lack of a robust,
publicly available... | A Machine Learning Approach For Opinion Holder Extraction In Arabic
Language | 2,012 | http://arxiv.org/pdf/1206.1011v1 | Title Machine Learning Approach Opinion Holder Extraction Arabic Language Summary Opinion mining aim extracting useful subjective information reliable amount text Opinion mining holder recognition task considered yet Arabic Language task essentially requires deep understanding clause structure Unfortunately lack robust... | [0.051405150443315506, 0.05111338570713997, 0.008856154046952724, 0.05659771338105202, -0.058939963579177856, 0.022157752886414528, 0.02627495490014553, -0.005804526619613171, -0.0028557584155350924, -0.046420641243457794, 0.001924547366797924, -0.030572574585676193, 0.005856658332049847, 0.027715357020497322, -0.05685... |
40,731 | 40,731 | ['Jia Zeng', 'Zhi-Qiang Liu', 'Xiao-Qin Cao'] | 1206.1147v2 | As one of the simplest probabilistic topic modeling techniques, latent
Dirichlet allocation (LDA) has found many important applications in text
mining, computer vision and computational biology. Recent training algorithms
for LDA can be interpreted within a unified message passing framework. However,
message passing re... | Memory-Efficient Topic Modeling | 2,012 | http://arxiv.org/pdf/1206.1147v2 | Title MemoryEfficient Topic Modeling Summary one simplest probabilistic topic modeling technique latent Dirichlet allocation LDA found many important application text mining computer vision computational biology Recent training algorithm LDA interpreted within unified message passing framework However message passing r... | [0.06376732140779495, 0.01401518750935793, 0.007114027161151171, 0.012869127094745636, -0.01643451675772667, 0.01838749274611473, -0.018147092312574387, 0.0035076874773949385, -0.04639777913689613, -0.0606553889811039, 0.010713323950767517, 0.009091626852750778, -0.007852904498577118, 0.03914189711213112, -0.0238844733... |
40,732 | 40,732 | ['Francesco Orabona', 'Andreas Argyriou', 'Nathan Srebro'] | 1206.2372v2 | Motivated by learning problems including max-norm regularized matrix
completion and clustering, robust PCA and sparse inverse covariance selection,
we propose a novel optimization algorithm for minimizing a convex objective
which decomposes into three parts: a smooth part, a simple non-smooth Lipschitz
part, and a simp... | PRISMA: PRoximal Iterative SMoothing Algorithm | 2,012 | http://arxiv.org/pdf/1206.2372v2 | Title PRISMA PRoximal Iterative SMoothing Algorithm Summary Motivated learning problem including maxnorm regularized matrix completion clustering robust PCA sparse inverse covariance selection propose novel optimization algorithm minimizing convex objective decomposes three part smooth part simple nonsmooth Lipschitz p... | [0.00560735072940588, 0.019757550209760666, 0.011579503305256367, 0.0012100511230528355, 0.015959836542606354, 0.00693553825840354, -0.05266667157411575, 0.01287410780787468, 0.009558608755469322, 0.05738084763288498, 0.06444376707077026, -0.005453641526401043, 0.01822603866457939, 0.027247097343206406, 0.0072137387469... |
40,733 | 40,733 | ['Paolo Di Lorenzo', 'Ali H. Sayed'] | 1206.3099v2 | This article proposes diffusion LMS strategies for distributed estimation
over adaptive networks that are able to exploit sparsity in the underlying
system model. The approach relies on convex regularization, common in
compressive sensing, to enhance the detection of sparsity via a diffusive
process over the network. T... | Sparse Distributed Learning Based on Diffusion Adaptation | 2,012 | http://arxiv.org/pdf/1206.3099v2 | Title Sparse Distributed Learning Based Diffusion Adaptation Summary article proposes diffusion LMS strategy distributed estimation adaptive network able exploit sparsity underlying system model approach relies convex regularization common compressive sensing enhance detection sparsity via diffusive process network res... | [-0.02507280558347702, 0.03188308700919151, -0.0022652570623904467, -0.0008785325335338712, 0.04222222790122032, -0.01032005064189434, 0.00030438200337812304, 0.0501880943775177, -0.023654960095882416, 0.039701562374830246, 0.030993090942502022, -0.0034217520151287317, 0.00147496466524899, -0.011308166198432446, 0.0085... |
40,734 | 40,734 | ['Pranjal Awasthi', 'Or Sheffet'] | 1206.3204v2 | Aiming to unify known results about clustering mixtures of distributions
under separation conditions, Kumar and Kannan[2010] introduced a deterministic
condition for clustering datasets. They showed that this single deterministic
condition encompasses many previously studied clustering assumptions. More
specifically, t... | Improved Spectral-Norm Bounds for Clustering | 2,012 | http://arxiv.org/pdf/1206.3204v2 | Title Improved SpectralNorm Bounds Clustering Summary Aiming unify known result clustering mixture distribution separation condition Kumar Kannan2010 introduced deterministic condition clustering datasets showed single deterministic condition encompasses many previously studied clustering assumption specifically proxim... | [-0.018541967496275902, -0.03669000789523125, -0.025297053158283234, 0.01402619481086731, -0.03805197775363922, -0.03710717335343361, 0.03378254175186157, 0.03534521907567978, -0.009650642052292824, 0.01760811358690262, -0.007600985933095217, 0.024735024198889732, 0.057502515614032745, -0.003031831933185458, -0.0052835... |
40,735 | 40,735 | ['Saurabh Sarkar', 'Prateek Malhotra', 'Virender Guman'] | 1206.3509v1 | The idea of this project is to study the protein structure and sequence
relationship using the hidden markov model and artificial neural network. In
this context we have assumed two hidden markov models. In first model we have
taken protein secondary structures as hidden and protein sequences as observed.
In second mod... | A Novel Approach for Protein Structure Prediction | 2,012 | http://arxiv.org/pdf/1206.3509v1 | Title Novel Approach Protein Structure Prediction Summary idea project study protein structure sequence relationship using hidden markov model artificial neural network context assumed two hidden markov model first model taken protein secondary structure hidden protein sequence observed second model taken protein seque... | [0.01838711090385914, 0.026679471135139465, -0.004050067160278559, -0.004913358483463526, -0.02182084135711193, -0.022608622908592224, -0.03912850096821785, 0.027435390278697014, 0.011451302096247673, -0.006600531283766031, 0.016494881361722946, -0.012174826115369797, 0.05589022487401962, 0.030094608664512634, 0.010616... |
40,736 | 40,736 | ['Tayfun Gürel', 'Carsten Mehring'] | 1206.3666v1 | The performance of neural decoders can degrade over time due to
nonstationarities in the relationship between neuronal activity and behavior.
In this case, brain-machine interfaces (BMI) require adaptation of their
decoders to maintain high performance across time. One way to achieve this is
by use of periodical calibr... | Unsupervised adaptation of brain machine interface decoders | 2,012 | http://arxiv.org/pdf/1206.3666v1 | Title Unsupervised adaptation brain machine interface decoder Summary performance neural decoder degrade time due nonstationarities relationship neuronal activity behavior case brainmachine interface BMI require adaptation decoder maintain high performance across time One way achieve use periodical calibration phase BM... | [-0.003103862749412656, 0.01334115955978632, -0.014355485327541828, -0.006731083150953054, 0.034039031714200974, 0.0343453511595726, 0.003353464649990201, 0.04754302278161049, -0.01666431874036789, 0.018156545236706734, -0.027520759031176567, 0.01937975361943245, 0.06013055145740509, 0.06032735854387283, 0.022615725174... |
40,737 | 40,737 | ['Truyen T. Tran', 'Duc Son Pham'] | 1206.4110v1 | We propose a new data mining approach in ranking documents based on the
concept of cone-based generalized inequalities between vectors. A partial
ordering between two vectors is made with respect to a proper cone and thus
learning the preferences is formulated as learning proper cones. A pairwise
learning-to-rank algor... | ConeRANK: Ranking as Learning Generalized Inequalities | 2,012 | http://arxiv.org/pdf/1206.4110v1 | Title ConeRANK Ranking Learning Generalized Inequalities Summary propose new data mining approach ranking document based concept conebased generalized inequality vector partial ordering two vector made respect proper cone thus learning preference formulated learning proper cone pairwise learningtorank algorithm ConeRan... | [-0.031192472204566002, 0.015477515757083893, -0.03223806247115135, 0.03891593590378761, 0.0018668549600988626, -0.0012175246374681592, -0.02656860463321209, 0.026169080287218094, -0.03710814565420151, -0.03888426721096039, 0.002084981417283416, 0.009120646864175797, -0.005115026608109474, -0.021435827016830444, -0.023... |
40,738 | 40,738 | ['M. Fauvel', 'A. Villa', 'J. Chanussot', 'J. A. Benediktsson'] | 1206.4481v2 | The classification of high dimensional data with kernel methods is considered
in this article. Exploit- ing the emptiness property of high dimensional
spaces, a kernel based on the Mahalanobis distance is proposed. The computation
of the Mahalanobis distance requires the inversion of a covariance matrix. In
high dimens... | Parsimonious Mahalanobis Kernel for the Classification of High
Dimensional Data | 2,012 | http://arxiv.org/pdf/1206.4481v2 | Title Parsimonious Mahalanobis Kernel Classification High Dimensional Data Summary classification high dimensional data kernel method considered article Exploit ing emptiness property high dimensional space kernel based Mahalanobis distance proposed computation Mahalanobis distance requires inversion covariance matrix ... | [-0.038560900837183, -0.032875560224056244, -0.034856200218200684, 0.0356142558157444, 0.00118716387078166, 0.012616604566574097, 0.04123619571328163, 0.05087288096547127, 0.019785329699516296, 0.009697537869215012, -0.00125721818767488, 0.030180973932147026, 8.260575123131275e-05, 0.03025691583752632, 0.01534024253487... |
40,739 | 40,739 | ['Elad Hazan', 'Satyen Kale'] | 1206.4657v1 | The computational bottleneck in applying online learning to massive data sets
is usually the projection step. We present efficient online learning algorithms
that eschew projections in favor of much more efficient linear optimization
steps using the Frank-Wolfe technique. We obtain a range of regret bounds for
online c... | Projection-free Online Learning | 2,012 | http://arxiv.org/pdf/1206.4657v1 | Title Projectionfree Online Learning Summary computational bottleneck applying online learning massive data set usually projection step present efficient online learning algorithm eschew projection favor much efficient linear optimization step using FrankWolfe technique obtain range regret bound online convex optimizat... | [-0.040699802339076996, 0.07614393532276154, -0.00592581182718277, -0.008099240250885487, -0.015378925018012524, 0.0018427150789648294, 0.03405725955963135, 0.005123643204569817, -0.028440317139029503, -0.00027435991796664894, 0.02447696402668953, 0.007107550278306007, 0.009734504856169224, 0.06414944678544998, -0.0143... |
40,740 | 40,740 | ['Sanjeev Arora', 'Rong Ge', 'Ankur Moitra', 'Sushant Sachdeva'] | 1206.5349v2 | We present a new algorithm for Independent Component Analysis (ICA) which has
provable performance guarantees. In particular, suppose we are given samples of
the form $y = Ax + \eta$ where $A$ is an unknown $n \times n$ matrix and $x$ is
a random variable whose components are independent and have a fourth moment
strict... | Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian
Mixtures and Autoencoders | 2,012 | http://arxiv.org/pdf/1206.5349v2 | Title Provable ICA Unknown Gaussian Noise Implications Gaussian Mixtures Autoencoders Summary present new algorithm Independent Component Analysis ICA provable performance guarantee particular suppose given sample form Ax eta unknown n time n matrix x random variable whose component independent fourth moment strictly l... | [-0.015556919388473034, 0.0677202045917511, 0.0013297570403665304, 0.09801431745290756, 0.021335741505026817, 0.015658937394618988, 0.05631428584456444, 0.03125451132655144, 0.003295156406238675, 0.034231603145599365, 0.006459851283580065, 0.011376420967280865, 0.02920609340071678, 0.048263825476169586, 0.0081153865903... |
40,741 | 40,741 | ['Pierre-François Marteau', 'Nicolas Bonnel', 'Gilbas Ménier'] | 1206.6196v1 | This paper proposes a framework dedicated to the construction of what we call
discrete elastic inner product allowing one to embed sets of non-uniformly
sampled multivariate time series or sequences of varying lengths into inner
product space structures. This framework is based on a recursive definition
that covers the... | Discrete Elastic Inner Vector Spaces with Application in Time Series and
Sequence Mining | 2,012 | http://arxiv.org/pdf/1206.6196v1 | Title Discrete Elastic Inner Vector Spaces Application Time Series Sequence Mining Summary paper proposes framework dedicated construction call discrete elastic inner product allowing one embed set nonuniformly sampled multivariate time series sequence varying length inner product space structure framework based recurs... | [-0.06303804367780685, 0.05267355591058731, -0.061134956777095795, 0.0010639370884746313, -0.006786917801946402, 0.04177102446556091, 0.02916567213833332, 0.03502098098397255, -0.005986991338431835, 0.006148139014840126, 0.08487411588430405, 0.0032025608234107494, -0.020162852481007576, 0.011798912659287453, 0.01348603... |
40,742 | 40,742 | ['Guy Lebanon'] | 1206.6858v1 | The popular bag of words assumption represents a document as a histogram of
word occurrences. While computationally efficient, such a representation is
unable to maintain any sequential information. We present a continuous and
differentiable sequential document representation that goes beyond the bag of
words assumptio... | Sequential Document Representations and Simplicial Curves | 2,012 | http://arxiv.org/pdf/1206.6858v1 | Title Sequential Document Representations Simplicial Curves Summary popular bag word assumption represents document histogram word occurrence computationally efficient representation unable maintain sequential information present continuous differentiable sequential document representation go beyond bag word assumption... | [0.015401527285575867, 0.016077682375907898, -0.01316965650767088, 0.03996576368808746, -0.057235293090343475, 0.01861460693180561, 0.028477970510721207, 0.05515775457024574, -0.003781169420108199, -0.037801966071128845, 0.03465668857097626, 0.001212308299727738, -0.002086876193061471, 0.03812525048851967, -0.031965423... |
40,743 | 40,743 | ['Chunxiao Jiang', 'Yan Chen', 'K. J. Ray Liu'] | 1212.1245v2 | Distributed adaptive filtering has been considered as an effective approach
for data processing and estimation over distributed networks. Most existing
distributed adaptive filtering algorithms focus on designing different
information diffusion rules, regardless of the nature evolutionary
characteristic of a distribute... | Distributed Adaptive Networks: A Graphical Evolutionary Game-Theoretic
View | 2,012 | http://arxiv.org/pdf/1212.1245v2 | Title Distributed Adaptive Networks Graphical Evolutionary GameTheoretic View Summary Distributed adaptive filtering considered effective approach data processing estimation distributed network existing distributed adaptive filtering algorithm focus designing different information diffusion rule regardless nature evolu... | [-0.026787932962179184, -0.020158153027296066, -0.01999885030090809, -0.036404140293598175, -0.012417173013091087, -0.036921177059412, 0.03650304675102234, -0.012925592251121998, 0.011567372828722, 0.012604085728526115, 0.004656721372157335, 0.03015720658004284, 0.022845223546028137, 0.010832652449607849, -0.0013786056... |
40,744 | 40,744 | ['Yuval Rabani', 'Leonard Schulman', 'Chaitanya Swamy'] | 1212.1527v3 | We give an algorithm for learning a mixture of {\em unstructured}
distributions. This problem arises in various unsupervised learning scenarios,
for example in learning {\em topic models} from a corpus of documents spanning
several topics. We show how to learn the constituents of a mixture of $k$
arbitrary distribution... | Learning Mixtures of Arbitrary Distributions over Large Discrete Domains | 2,012 | http://arxiv.org/pdf/1212.1527v3 | Title Learning Mixtures Arbitrary Distributions Large Discrete Domains Summary give algorithm learning mixture em unstructured distribution problem arises various unsupervised learning scenario example learning em topic model corpus document spanning several topic show learn constituent mixture k arbitrary distribution... | [0.007280575577169657, -0.0005570410285145044, -0.014140112325549126, 0.017895173281431198, -0.013171542435884476, 0.014481115154922009, -6.987225788179785e-05, 0.02938157133758068, -0.054329484701156616, -0.026383230462670326, 0.003652044804766774, 0.0234866701066494, -0.010905670002102852, 0.007164869923144579, 0.011... |
40,745 | 40,745 | ['Maher Salem', 'Ulrich Buehler'] | 1212.2414v1 | In intrusion detection systems, classifiers still suffer from several
drawbacks such as data dimensionality and dominance, different network feature
types, and data impact on the classification. In this paper two significant
enhancements are presented to solve these drawbacks. The first enhancement is
an improved featu... | Mining Techniques in Network Security to Enhance Intrusion Detection
Systems | 2,012 | http://arxiv.org/pdf/1212.2414v1 | Title Mining Techniques Network Security Enhance Intrusion Detection Systems Summary intrusion detection system classifier still suffer several drawback data dimensionality dominance different network feature type data impact classification paper two significant enhancement presented solve drawback first enhancement im... | [0.010694855824112892, 0.01289962325245142, -0.02200631983578205, 0.04416825622320175, -0.04733153060078621, -0.04085034877061844, 0.04067566618323326, 0.0008969876216724515, 0.03506622090935707, -0.030060384422540665, 0.025059208273887634, -0.0008643663604743779, -0.010369261726737022, 0.04680173099040985, -0.02980120... |
40,746 | 40,746 | ['Gregory Lawrence', 'Noah Cowan', 'Stuart Russell'] | 1212.2475v1 | The task of estimating the gradient of a function in the presence of noise is
central to several forms of reinforcement learning, including policy search
methods. We present two techniques for reducing gradient estimation errors in
the presence of observable input noise applied to the control signal. The first
method e... | Efficient Gradient Estimation for Motor Control Learning | 2,012 | http://arxiv.org/pdf/1212.2475v1 | Title Efficient Gradient Estimation Motor Control Learning Summary task estimating gradient function presence noise central several form reinforcement learning including policy search method present two technique reducing gradient estimation error presence observable input noise applied control signal first method exte... | [-0.0012196259340271354, -0.010438837110996246, -0.0014591384679079056, -0.00038575372309423983, 0.026463791728019714, -0.018245398998260498, -0.029572971165180206, 0.021115966141223907, -0.01647784747183323, 0.003600427648052573, -0.057980090379714966, 0.023918692022562027, 0.014457684941589832, -2.7942545784753747e-0... |
40,747 | 40,747 | ['Anirban Majumder', 'Nisheeth Shrivastava'] | 1212.3390v1 | Online service platforms (OSPs), such as search engines, news-websites,
ad-providers, etc., serve highly pe rsonalized content to the user, based on
the profile extracted from his history with the OSP. Although personalization
(generally) leads to a better user experience, it also raises privacy concerns
for the user--... | Know Your Personalization: Learning Topic level Personalization in
Online Services | 2,012 | http://arxiv.org/pdf/1212.3390v1 | Title Know Personalization Learning Topic level Personalization Online Services Summary Online service platform OSPs search engine newswebsites adproviders etc serve highly pe rsonalized content user based profile extracted history OSP Although personalization generally lead better user experience also raise privacy co... | [0.06459541618824005, 0.029003649950027466, -0.04012618958950043, 0.013461176306009293, -0.012808429077267647, -0.030821193009614944, 0.03935445100069046, -0.01081411074846983, 0.005793794058263302, -0.042772077023983, 0.00182656932156533, 0.025651760399341583, -0.01771838217973709, 0.07426923513412476, -0.041367609053... |
40,748 | 40,748 | ['Gabriele Modena'] | 1212.3669v2 | Vulnerability discovery and exploits detection are two wide areas of study in
software engineering. This preliminary work tries to combine existing methods
with machine learning techniques to define a metric classification of
vulnerable computer programs. First a feature set has been defined and later
two models have b... | A metric for software vulnerabilities classification | 2,012 | http://arxiv.org/pdf/1212.3669v2 | Title metric software vulnerability classification Summary Vulnerability discovery exploit detection two wide area study software engineering preliminary work try combine existing method machine learning technique define metric classification vulnerable computer program First feature set defined later two model tested ... | [-0.016892386600375175, 0.005302961450070143, -0.026362594217061996, 0.011461537331342697, -0.006743795704096556, -0.03558594360947609, -0.004740458447486162, -0.0002486725279595703, 0.05267222970724106, -0.06352784484624863, 0.050547223538160324, 0.050190333276987076, 0.008705818094313145, 0.06414631009101868, 0.03202... |
40,749 | 40,749 | ['Elaine Tsiang'] | 1212.5091v1 | We formulate the problem of perception in the framework of information
theory, and prove that categorical perception is equivalent to the existence of
an observable that has the maximum possible information on the target of
perception. We call such an observable maximally informative. Regardless
whether categorical per... | Maximally Informative Observables and Categorical Perception | 2,012 | http://arxiv.org/pdf/1212.5091v1 | Title Maximally Informative Observables Categorical Perception Summary formulate problem perception framework information theory prove categorical perception equivalent existence observable maximum possible information target perception call observable maximally informative Regardless whether categorical perception rea... | [-0.008705663494765759, 0.048764459788799286, -0.016352394595742226, 0.02692909725010395, -0.007745063863694668, 0.0017692823894321918, -0.033808380365371704, 0.060409460216760635, -0.04559836536645889, -0.02242821827530861, -0.054986897855997086, 0.011729065328836441, -0.015742698684334755, -0.010122780688107014, 0.00... |
40,750 | 40,750 | ['K. Dhanalakshmi', 'H. Hannah Inbarani'] | 1212.5359v1 | Clustering is one of the widely used data mining techniques for medical
diagnosis. Clustering can be considered as the most important unsupervised
learning technique. Most of the clustering methods group data based on distance
and few methods cluster data based on similarity. The clustering algorithms
classify gene exp... | Fuzzy soft rough K-Means clustering approach for gene expression data | 2,012 | http://arxiv.org/pdf/1212.5359v1 | Title Fuzzy soft rough KMeans clustering approach gene expression data Summary Clustering one widely used data mining technique medical diagnosis Clustering considered important unsupervised learning technique clustering method group data based distance method cluster data based similarity clustering algorithm classify... | [-0.015309467911720276, -0.015365765430033207, -0.06365137547254562, -0.01609174720942974, 0.01800129935145378, 0.019789697602391243, 0.041180361062288284, 0.07750619202852249, -0.004956546239554882, 0.004681665450334549, 0.03730899840593338, 0.018867071717977524, 0.009532786905765533, 0.038073763251304626, -0.00012819... |
40,751 | 40,751 | ['G. Jothi', 'H. Hannah Inbarani'] | 1212.5391v1 | Lung cancer is the deadliest type of cancer for both men and women. Feature
selection plays a vital role in cancer classification. This paper investigates
the feature selection process in Computed Tomographic (CT) lung cancer images
using soft set theory. We propose a new soft set based unsupervised feature
selection a... | Soft Set Based Feature Selection Approach for Lung Cancer Images | 2,012 | http://arxiv.org/pdf/1212.5391v1 | Title Soft Set Based Feature Selection Approach Lung Cancer Images Summary Lung cancer deadliest type cancer men woman Feature selection play vital role cancer classification paper investigates feature selection process Computed Tomographic CT lung cancer image using soft set theory propose new soft set based unsupervi... | [-0.041185908019542694, -0.005432871636003256, -0.051971834152936935, -0.024186445400118828, -0.009373980574309826, 0.07036839425563812, 0.04865609109401703, 0.015852896496653557, -0.010408642701804638, 0.024665703997015953, 0.021352307870984077, -0.006262725684791803, 0.0339340977370739, 0.039282508194446564, 0.000230... |
40,752 | 40,752 | ['Olivier Sprangers', 'Gabriel A. D. Lopes', 'Robert Babuska'] | 1212.5524v2 | Passivity-based control (PBC) for port-Hamiltonian systems provides an
intuitive way of achieving stabilization by rendering a system passive with
respect to a desired storage function. However, in most instances the control
law is obtained without any performance considerations and it has to be
calculated by solving a... | Reinforcement learning for port-Hamiltonian systems | 2,012 | http://arxiv.org/pdf/1212.5524v2 | Title Reinforcement learning portHamiltonian system Summary Passivitybased control PBC portHamiltonian system provides intuitive way achieving stabilization rendering system passive respect desired storage function However instance control law obtained without performance consideration calculated solving complex partia... | [-0.03969322890043259, -0.010734173469245434, -0.018514255061745644, 0.023849038407206535, 0.02245585434138775, -0.025613076984882355, -0.015609513968229294, 0.031138690188527107, -0.030542820692062378, 0.000796826439909637, -0.0194886215031147, 0.021667158231139183, -0.029536550864577293, 0.043385379016399384, 0.00991... |
40,753 | 40,753 | ['Farid Beninel', 'Waad Bouaguel', 'Ghazi Belmufti'] | 1212.6167v1 | The credit scoring risk management is a fast growing field due to consumer's
credit requests. Credit requests, of new and existing customers, are often
evaluated by classical discrimination rules based on customers information.
However, these kinds of strategies have serious limits and don't take into
account the chara... | Transfer Learning Using Logistic Regression in Credit Scoring | 2,012 | http://arxiv.org/pdf/1212.6167v1 | Title Transfer Learning Using Logistic Regression Credit Scoring Summary credit scoring risk management fast growing field due consumer credit request Credit request new existing customer often evaluated classical discrimination rule based customer information However kind strategy serious limit dont take account chara... | [0.005685362499207258, 0.06497889757156372, -0.02461809478700161, -0.02646719478070736, 0.026342609897255898, 0.05330488458275795, 0.060300860553979874, 0.04384007304906845, 0.014535575173795223, -0.02516884356737137, -0.006618023384362459, -0.053027406334877014, 0.026856781914830208, 0.03391644358634949, -0.0044456091... |
40,754 | 40,754 | ['Geoffrey J. Gordon'] | 1212.6958v1 | We present a new interior-point potential-reduction algorithm for solving
monotone linear complementarity problems (LCPs) that have a particular special
structure: their matrix $M\in{\mathbb R}^{n\times n}$ can be decomposed as
$M=\Phi U + \Pi_0$, where the rank of $\Phi$ is $k<n$, and $\Pi_0$ denotes
Euclidean project... | Fast Solutions to Projective Monotone Linear Complementarity Problems | 2,012 | http://arxiv.org/pdf/1212.6958v1 | Title Fast Solutions Projective Monotone Linear Complementarity Problems Summary present new interiorpoint potentialreduction algorithm solving monotone linear complementarity problem LCPs particular special structure matrix Minmathbb Rntimes n decomposed MPhi U Pi0 rank Phi kn Pi0 denotes Euclidean projection onto nul... | [-0.04336011782288551, 0.028920181095600128, -0.0079445019364357, 0.018053486943244934, -0.08390683680772781, -0.0350223034620285, -0.023664021864533424, 0.03730517625808716, -0.016077537089586258, -0.011217656545341015, 0.057939790189266205, 0.056402090936899185, 0.009005350060760975, -0.03925344720482826, 0.003894467... |
40,755 | 40,755 | ['Ankur Moitra', 'Michael Saks'] | 1302.1515v2 | We give a polynomial time algorithm for the lossy population recovery
problem. In this problem, the goal is to approximately learn an unknown
distribution on binary strings of length $n$ from lossy samples: for some
parameter $\mu$ each coordinate of the sample is preserved with probability
$\mu$ and otherwise is repla... | A Polynomial Time Algorithm for Lossy Population Recovery | 2,013 | http://arxiv.org/pdf/1302.1515v2 | Title Polynomial Time Algorithm Lossy Population Recovery Summary give polynomial time algorithm lossy population recovery problem problem goal approximately learn unknown distribution binary string length n lossy sample parameter mu coordinate sample preserved probability mu otherwise replaced running time number samp... | [0.008139933459460735, 0.08294190466403961, -0.006523034535348415, 0.004406788852065802, -0.012195287272334099, -0.020927580073475838, -0.028986576944589615, 0.05296475440263748, -0.046328116208314896, 0.037264127284288406, 0.0806245282292366, -0.0044210441410541534, 0.006243383977562189, 0.030934443697333336, 0.038927... |
40,756 | 40,756 | ['Kai-Yang Chiang', 'Cho-Jui Hsieh', 'Nagarajan Natarajan', 'Ambuj Tewari', 'Inderjit S. Dhillon'] | 1302.5145v2 | The study of social networks is a burgeoning research area. However, most
existing work deals with networks that simply encode whether relationships
exist or not. In contrast, relationships in signed networks can be positive
("like", "trust") or negative ("dislike", "distrust"). The theory of social
balance shows that ... | Prediction and Clustering in Signed Networks: A Local to Global
Perspective | 2,013 | http://arxiv.org/pdf/1302.5145v2 | Title Prediction Clustering Signed Networks Local Global Perspective Summary study social network burgeoning research area However existing work deal network simply encode whether relationship exist contrast relationship signed network positive like trust negative dislike distrust theory social balance show signed netw... | [-0.018302787095308304, -0.014881270006299019, -0.03775974363088608, -0.0028266655281186104, -0.00972268357872963, -0.02919156663119793, -0.00971949938684702, 0.006380169186741114, 0.11969161033630371, 0.0064453971572220325, -0.015133911743760109, -0.01286481972783804, 0.012197379022836685, 0.04028139263391495, 0.01758... |
40,757 | 40,757 | ['Mohammed El Anbari', 'Abdallah Mkhadri'] | 1302.6390v1 | We consider the problem of variables selection and estimation in linear
regression model in situations where the number of parameters diverges with the
sample size. We propose the adaptive Generalized Ridge-Lasso (\mbox{AdaGril})
which is an extension of the the adaptive Elastic Net. AdaGril incorporates
information re... | The adaptive Gril estimator with a diverging number of parameters | 2,013 | http://arxiv.org/pdf/1302.6390v1 | Title adaptive Gril estimator diverging number parameter Summary consider problem variable selection estimation linear regression model situation number parameter diverges sample size propose adaptive Generalized RidgeLasso mboxAdaGril extension adaptive Elastic Net AdaGril incorporates information redundancy among cor... | [-0.02800752967596054, 0.05801106244325638, -0.028368467465043068, -0.012728462927043438, 0.031293317675590515, 0.021327709779143333, 0.07747331261634827, 0.012708493508398533, 0.027218785136938095, 0.04184013977646828, 0.024207377806305885, 0.05397256463766098, 0.013556001707911491, 4.0731101762503386e-05, 0.069846257... |
40,758 | 40,758 | ['Jónathan Heras', 'Ekaterina Komendantskaya'] | 1302.6421v3 | ML4PG is a machine-learning extension that provides statistical proof hints
during the process of Coq/SSReflect proof development. In this paper, we use
ML4PG to find proof patterns in the CoqEAL library -- a library that was
devised to verify the correctness of Computer Algebra algorithms. In
particular, we use ML4PG ... | ML4PG in Computer Algebra verification | 2,013 | http://arxiv.org/pdf/1302.6421v3 | Title ML4PG Computer Algebra verification Summary ML4PG machinelearning extension provides statistical proof hint process CoqSSReflect proof development paper use ML4PG find proof pattern CoqEAL library library devised verify correctness Computer Algebra algorithm particular use ML4PG help u formalisation efficient alg... | [-0.01857442408800125, -0.04760809242725372, -0.0238863043487072, 0.02675640396773815, -0.015686359256505966, -0.0061528002843260765, 0.0271734818816185, 0.004549364559352398, 0.021696489304304123, -0.018448742106556892, 0.03166976198554039, 0.07598837465047836, 0.009210856631398201, 0.015135811641812325, 0.04285298660... |
40,759 | 40,759 | ['Emad M. Grais', 'Hakan Erdogan'] | 1302.7283v1 | We propose a new method to enforce priors on the solution of the nonnegative
matrix factorization (NMF). The proposed algorithm can be used for denoising or
single-channel source separation (SCSS) applications. The NMF solution is
guided to follow the Minimum Mean Square Error (MMSE) estimates under Gaussian
mixture pr... | Source Separation using Regularized NMF with MMSE Estimates under GMM
Priors with Online Learning for The Uncertainties | 2,013 | http://arxiv.org/pdf/1302.7283v1 | Title Source Separation using Regularized NMF MMSE Estimates GMM Priors Online Learning Uncertainties Summary propose new method enforce prior solution nonnegative matrix factorization NMF proposed algorithm used denoising singlechannel source separation SCSS application NMF solution guided follow Minimum Mean Square E... | [0.0182354636490345, 0.04698843136429787, 0.010780141688883305, 0.00808739010244608, 0.05170631781220436, -0.038233086466789246, 0.03760913386940956, 0.04141865670681, -0.06561922281980515, -0.0036247018724679947, -0.026902563869953156, 0.03622301667928696, 0.008255423977971077, -0.0027204526122659445, 0.01005328726023... |
40,760 | 40,760 | ['Shafigh Parsazad', 'Ehsan Saboori', 'Amin Allahyar'] | 1305.2388v1 | In the most intrusion detection systems (IDS), a system tries to learn
characteristics of different type of attacks by analyzing packets that sent or
received in network. These packets have a lot of features. But not all of them
is required to be analyzed to detect that specific type of attack. Detection
speed and comp... | Fast Feature Reduction in intrusion detection datasets | 2,013 | http://arxiv.org/pdf/1305.2388v1 | Title Fast Feature Reduction intrusion detection datasets Summary intrusion detection system IDS system try learn characteristic different type attack analyzing packet sent received network packet lot feature required analyzed detect specific type attack Detection speed computational cost another vital matter type prob... | [-0.04138384386897087, -0.009275500662624836, -0.0299786776304245, 0.04195195809006691, -0.06028420850634575, -0.014267221093177795, 0.07615303248167038, 0.013218099251389503, 0.030329516157507896, -0.027706192806363106, 0.03114135190844536, 0.02593553625047207, 0.013898496516048908, 0.09561406821012497, -0.02428448572... |
40,761 | 40,761 | ['Ashwinkumar Badanidiyuru', 'Robert Kleinberg', 'Aleksandrs Slivkins'] | 1305.2545v8 | Multi-armed bandit problems are the predominant theoretical model of
exploration-exploitation tradeoffs in learning, and they have countless
applications ranging from medical trials, to communication networks, to Web
search and advertising. In many of these application domains the learner may be
constrained by one or m... | Bandits with Knapsacks | 2,013 | http://arxiv.org/pdf/1305.2545v8 | Title Bandits Knapsacks Summary Multiarmed bandit problem predominant theoretical model explorationexploitation tradeoff learning countless application ranging medical trial communication network Web search advertising many application domain learner may constrained one supply budget limit addition customary limitation... | [0.037161316722631454, 0.05644448474049568, -0.015572826378047466, -0.0565476194024086, -0.010808642953634262, -0.020381564274430275, 0.03030708245933056, 0.02322951704263687, -0.03522719070315361, -0.032463520765304565, 0.00985922571271658, 0.014184950850903988, -0.03275603801012039, 0.05980987846851349, 0.01352542825... |
40,762 | 40,762 | ['Fabian Pedregosa', 'Michael Eickenberg', 'Bertrand Thirion', 'Alexandre Gramfort'] | 1305.2788v1 | Extracting activation patterns from functional Magnetic Resonance Images
(fMRI) datasets remains challenging in rapid-event designs due to the inherent
delay of blood oxygen level-dependent (BOLD) signal. The general linear model
(GLM) allows to estimate the activation from a design matrix and a fixed
hemodynamic respo... | HRF estimation improves sensitivity of fMRI encoding and decoding models | 2,013 | http://arxiv.org/pdf/1305.2788v1 | Title HRF estimation improves sensitivity fMRI encoding decoding model Summary Extracting activation pattern functional Magnetic Resonance Images fMRI datasets remains challenging rapidevent design due inherent delay blood oxygen leveldependent BOLD signal general linear model GLM allows estimate activation design matr... | [-0.019836314022541046, 0.03579607978463173, -0.018655018880963326, 0.00684982817620039, 0.011454648338258266, 0.029941964894533157, 0.027283674106001854, 0.08468989282846451, 0.03735656663775444, 0.019732432439923286, -0.05029069632291794, -0.0556279756128788, 0.06845329701900482, 0.03579476475715637, 0.03370018675923... |
40,763 | 40,763 | ['Kuang-Chih Lee', 'Ali Jalali', 'Ali Dasdan'] | 1305.3011v1 | Today, billions of display ad impressions are purchased on a daily basis
through a public auction hosted by real time bidding (RTB) exchanges. A
decision has to be made for advertisers to submit a bid for each selected RTB
ad request in milliseconds. Restricted by the budget, the goal is to buy a set
of ad impressions ... | Real Time Bid Optimization with Smooth Budget Delivery in Online
Advertising | 2,013 | http://arxiv.org/pdf/1305.3011v1 | Title Real Time Bid Optimization Smooth Budget Delivery Online Advertising Summary Today billion display ad impression purchased daily basis public auction hosted real time bidding RTB exchange decision made advertiser submit bid selected RTB ad request millisecond Restricted budget goal buy set ad impression reach man... | [0.07785237580537796, 0.028655359521508217, -0.03451156243681908, -0.05659424886107445, -0.011497131548821926, -0.03385933116078377, 0.020923320204019547, -0.0011330408742651343, -0.05761895701289177, -0.06000596657395363, -0.04220873862504959, -0.06761900335550308, 0.02234136499464512, 0.13113738596439362, -0.01643118... |
40,764 | 40,764 | ['Ali Jalali', 'Santanu Kolay', 'Peter Foldes', 'Ali Dasdan'] | 1305.3014v1 | Online advertising has been introduced as one of the most efficient methods
of advertising throughout the recent years. Yet, advertisers are concerned
about the efficiency of their online advertising campaigns and consequently,
would like to restrict their ad impressions to certain websites and/or certain
groups of aud... | Scalable Audience Reach Estimation in Real-time Online Advertising | 2,013 | http://arxiv.org/pdf/1305.3014v1 | Title Scalable Audience Reach Estimation Realtime Online Advertising Summary Online advertising introduced one efficient method advertising throughout recent year Yet advertiser concerned efficiency online advertising campaign consequently would like restrict ad impression certain website andor certain group audience r... | [0.009138742461800575, 0.03396238014101982, -0.06712191551923752, -0.08605373650789261, -0.004468315280973911, -0.034344423562288284, 0.057514630258083344, -0.017312970012426376, 0.022039273753762245, -0.039002835750579834, -0.006297084968537092, -0.0870608389377594, -0.007051997818052769, 0.09217078983783722, 0.001731... |
40,765 | 40,765 | ['Xiao-Bo Jin', 'Qiang Lu', 'Feng Wang', 'Quan-gong Huo'] | 1305.3149v1 | The study focused on the machine learning analysis approaches to identify the
adulteration of 9 kinds of edible oil qualitatively and answered the following
three questions: Is the oil sample adulterant? How does it constitute? What is
the main ingredient of the adulteration oil? After extracting the
high-performance l... | Qualitative detection of oil adulteration with machine learning
approaches | 2,013 | http://arxiv.org/pdf/1305.3149v1 | Title Qualitative detection oil adulteration machine learning approach Summary study focused machine learning analysis approach identify adulteration 9 kind edible oil qualitatively answered following three question oil sample adulterant constitute main ingredient adulteration oil extracting highperformance liquid chro... | [0.03646443411707878, 0.035078227519989014, -0.04072501137852669, 0.018008684739470482, 0.008638706058263779, 0.021276872605085373, 0.008872238919138908, 0.05695314332842827, 0.004953477997332811, -0.03303569555282593, 0.05768534541130066, 0.058178361505270004, -0.02081873081624508, 0.045163754373788834, 0.000284802750... |
40,766 | 40,766 | ['Naseem Biadsy', 'Lior Rokach', 'Armin Shmilovici'] | 1305.3384v1 | In this paper we present a new approach to content-based transfer learning
for solving the data sparsity problem in cases when the users' preferences in
the target domain are either scarce or unavailable, but the necessary
information on the preferences exists in another domain. We show that training
a system to use su... | Transfer Learning for Content-Based Recommender Systems using Tree
Matching | 2,013 | http://arxiv.org/pdf/1305.3384v1 | Title Transfer Learning ContentBased Recommender Systems using Tree Matching Summary paper present new approach contentbased transfer learning solving data sparsity problem case user preference target domain either scarce unavailable necessary information preference exists another domain show training system use inform... | [-0.0029111746698617935, 0.00988316535949707, -0.011506587266921997, 0.0053254286758601665, -0.01639598235487938, -0.024908769875764847, -0.004988569300621748, 0.014715210534632206, -0.0029665417969226837, -0.02801782265305519, -0.08394666761159897, 0.032944146543741226, -0.006981929764151573, 0.0881030485033989, -0.04... |
40,767 | 40,767 | ['Ali Hadian', 'Behrouz Minaei-Bidgoli'] | 1305.3814v2 | Spam pages are designed to maliciously appear among the top search results by
excessive usage of popular terms. Therefore, spam pages should be removed using
an effective and efficient spam detection system. Previous methods for web spam
classification used several features from various information sources (page
conten... | Multi-View Learning for Web Spam Detection | 2,013 | http://arxiv.org/pdf/1305.3814v2 | Title MultiView Learning Web Spam Detection Summary Spam page designed maliciously appear among top search result excessive usage popular term Therefore spam page removed using effective efficient spam detection system Previous method web spam classification used several feature various information source page content ... | [0.06253720074892044, -0.004458449315279722, -0.009293963201344013, 0.005665684584528208, -0.022415712475776672, 0.014188343659043312, 0.03610511124134064, 0.0177006796002388, 0.05633048713207245, -0.11937170475721359, -0.020006343722343445, -0.006146566942334175, 0.006031522061675787, 0.08362281322479248, -0.024188257... |
40,768 | 40,768 | ['Michiaki Hamada', 'Hisanori Kiryu', 'Wataru Iwasaki', 'Kiyoshi Asai'] | 1305.4339v1 | In a number of estimation problems in bioinformatics, accuracy measures of
the target problem are usually given, and it is important to design estimators
that are suitable to those accuracy measures. However, there is often a
discrepancy between an employed estimator and a given accuracy measure of the
problem. In this... | Generalized Centroid Estimators in Bioinformatics | 2,013 | http://arxiv.org/pdf/1305.4339v1 | Title Generalized Centroid Estimators Bioinformatics Summary number estimation problem bioinformatics accuracy measure target problem usually given important design estimator suitable accuracy measure However often discrepancy employed estimator given accuracy measure problem study introduce general class efficient est... | [-0.011184494011104107, -0.044720593839883804, -0.04200432077050209, -0.040001221001148224, 0.0040039061568677425, -0.011553126387298107, 0.059868574142456055, 0.025659093633294106, -0.014324191026389599, 0.0012195418821647763, 0.031463973224163055, -0.028238333761692047, 0.05363796278834343, -0.0029338307213038206, -0... |
40,769 | 40,769 | ['Miron B. Kursa'] | 1305.4525v3 | Gene selection is an important part of microarray data analysis because it
provides information that can lead to a better mechanistic understanding of an
investigated phenomenon. At the same time, gene selection is very difficult
because of the noisy nature of microarray data. As a consequence, gene
selection is often ... | Robustness of Random Forest-based gene selection methods | 2,013 | http://arxiv.org/pdf/1305.4525v3 | Title Robustness Random Forestbased gene selection method Summary Gene selection important part microarray data analysis provides information lead better mechanistic understanding investigated phenomenon time gene selection difficult noisy nature microarray data consequence gene selection often performed machine learni... | [0.02121998928487301, 0.0014453938929364085, -0.04428623616695404, -0.020652325823903084, -0.01712220348417759, 0.005284056533128023, 0.0755661353468895, 0.02215036004781723, 0.03518638759851456, 0.013084985315799713, 0.07624015212059021, 0.037163540720939636, 0.03161710873246193, 0.026179742068052292, -0.0115009462460... |
40,770 | 40,770 | ['Parasaran Raman', 'Suresh Venkatasubramanian'] | 1305.4757v1 | A clustering is an implicit assignment of labels of points, based on
proximity to other points. It is these labels that are then used for downstream
analysis (either focusing on individual clusters, or identifying
representatives of clusters and so on). Thus, in order to trust a clustering as
a first step in explorator... | Power to the Points: Validating Data Memberships in Clusterings | 2,013 | http://arxiv.org/pdf/1305.4757v1 | Title Power Points Validating Data Memberships Clusterings Summary clustering implicit assignment label point based proximity point label used downstream analysis either focusing individual cluster identifying representative cluster Thus order trust clustering first step exploratory data analysis must trust label assig... | [-0.046151403337717056, -0.06476866453886032, -0.05189483240246773, -0.014674810692667961, 0.004007765091955662, -0.019697945564985275, 0.04081065580248833, 0.0012114556739106774, 0.055166807025671005, 0.026907937601208687, 0.0008642013999633491, 0.05745593458414078, 0.05623753368854523, 0.009403005242347717, 0.0353564... |
40,771 | 40,771 | ['Bruno Ziliotto'] | 1305.4778v4 | Mertens [In Proceedings of the International Congress of Mathematicians
(Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two
general conjectures about repeated games: the first one is that, in any
two-person zero-sum repeated game, the asymptotic value exists, and the second
one is that, when Player... | Zero-sum repeated games: Counterexamples to the existence of the
asymptotic value and the conjecture
$\operatorname{maxmin}=\operatorname{lim}v_n$ | 2,013 | http://arxiv.org/pdf/1305.4778v4 | Title Zerosum repeated game Counterexamples existence asymptotic value conjecture operatornamemaxminoperatornamelimvn Summary Mertens Proceedings International Congress Mathematicians Berkeley Calif 1986 1987 15281577 Amer Math Soc proposed two general conjecture repeated game first one twoperson zerosum repeated game ... | [0.003056693822145462, 0.018019024282693863, -0.017642347142100334, 0.02344895340502262, -0.0505065880715847, -0.06524236500263214, -0.02917751483619213, -0.005684110801666975, -0.022852320224046707, 0.020007511600852013, -0.029666759073734283, 0.029766511172056198, 0.00024765802663750947, 0.04485778510570526, 0.018478... |
40,772 | 40,772 | ['Sidahmed Mokeddem', 'Baghdad Atmani', 'Mostefa Mokaddem'] | 1305.6046v1 | Feature Selection (FS) has become the focus of much research on decision
support systems areas for which data sets with tremendous number of variables
are analyzed. In this paper we present a new method for the diagnosis of
Coronary Artery Diseases (CAD) founded on Genetic Algorithm (GA) wrapped Bayes
Naive (BN) based ... | Supervised Feature Selection for Diagnosis of Coronary Artery Disease
Based on Genetic Algorithm | 2,013 | http://arxiv.org/pdf/1305.6046v1 | Title Supervised Feature Selection Diagnosis Coronary Artery Disease Based Genetic Algorithm Summary Feature Selection FS become focus much research decision support system area data set tremendous number variable analyzed paper present new method diagnosis Coronary Artery Diseases CAD founded Genetic Algorithm GA wrap... | [-0.006475195754319429, 0.0025229083839803934, -0.028864536434412003, -0.025352058932185173, -0.021371880546212196, 0.020603595301508904, 0.021812979131937027, 0.06696011126041412, 0.03908208757638931, 0.010064211674034595, 0.09212013334035873, 0.02420506440103054, 0.046021170914173126, 0.03228612616658211, -0.06670135... |
40,773 | 40,773 | ['Michael Zibulevsky'] | 1401.0159v1 | This is an overview paper written in style of research proposal. In recent
years we introduced a general framework for large-scale unconstrained
optimization -- Sequential Subspace Optimization (SESOP) and demonstrated its
usefulness for sparsity-based signal/image denoising, deconvolution,
compressive sensing, compute... | Speeding-Up Convergence via Sequential Subspace Optimization: Current
State and Future Directions | 2,013 | http://arxiv.org/pdf/1401.0159v1 | Title SpeedingUp Convergence via Sequential Subspace Optimization Current State Future Directions Summary overview paper written style research proposal recent year introduced general framework largescale unconstrained optimization Sequential Subspace Optimization SESOP demonstrated usefulness sparsitybased signalimage... | [-0.028324943035840988, 0.06354746967554092, -0.025476286187767982, 0.034609194844961166, 0.009324838407337666, -0.004553230945020914, 0.03322033956646919, 0.02916734293103218, 0.014160479418933392, 0.04869028180837631, 0.023592771962285042, -0.010412495583295822, 0.05854830890893936, -0.0004943128442391753, -0.0156758... |
40,774 | 40,774 | ['Maria-Florina Balcan', 'Yingyu Liang', 'Pramod Gupta'] | 1401.0247v2 | One of the most widely used techniques for data clustering is agglomerative
clustering. Such algorithms have been long used across many different fields
ranging from computational biology to social sciences to computer vision in
part because their output is easy to interpret. Unfortunately, it is well
known, however, t... | Robust Hierarchical Clustering | 2,014 | http://arxiv.org/pdf/1401.0247v2 | Title Robust Hierarchical Clustering Summary One widely used technique data clustering agglomerative clustering algorithm long used across many different field ranging computational biology social science computer vision part output easy interpret Unfortunately well known however many classic agglomerative clustering a... | [-0.004384721163660288, 0.004667556378990412, -0.03758237510919571, 0.0011085752630606294, -0.017829494550824165, 0.010558963753283024, 0.020380958914756775, 0.012360576540231705, 0.0434715636074543, 0.0012754222843796015, 0.03288419172167778, 0.026324933394789696, 0.03362162783741951, 0.023188218474388123, 0.021036364... |
40,775 | 40,775 | ['Dinesh Govindaraj', 'Tao Wang', 'S. V. N. Vishwanathan'] | 1401.0255v1 | Click models are an important tool for leveraging user feedback, and are used
by commercial search engines for surfacing relevant search results. However,
existing click models are lacking in two aspects. First, they do not share
information across search results when computing attractiveness. Second, they
assume that ... | Modeling Attractiveness and Multiple Clicks in Sponsored Search Results | 2,014 | http://arxiv.org/pdf/1401.0255v1 | Title Modeling Attractiveness Multiple Clicks Sponsored Search Results Summary Click model important tool leveraging user feedback used commercial search engine surfacing relevant search result However existing click model lacking two aspect First share information across search result computing attractiveness Second a... | [0.055399090051651, 0.008134845644235611, -0.017781510949134827, -0.012884088791906834, -0.023470312356948853, -0.02051403746008873, 0.010080951265990734, -0.0012429385678842664, 0.022764386609196663, -0.07197141647338867, -0.06257651001214981, -0.016187194734811783, -0.02061702497303486, 0.10081782937049866, 0.0204739... |
40,776 | 40,776 | ['Warren R. Scott', 'Warren B. Powell', 'Somayeh Moazehi'] | 1401.0843v1 | This paper studies approximate policy iteration (API) methods which use
least-squares Bellman error minimization for policy evaluation. We address
several of its enhancements, namely, Bellman error minimization using
instrumental variables, least-squares projected Bellman error minimization, and
projected Bellman error... | Least Squares Policy Iteration with Instrumental Variables vs. Direct
Policy Search: Comparison Against Optimal Benchmarks Using Energy Storage | 2,014 | http://arxiv.org/pdf/1401.0843v1 | Title Least Squares Policy Iteration Instrumental Variables v Direct Policy Search Comparison Optimal Benchmarks Using Energy Storage Summary paper study approximate policy iteration API method use leastsquares Bellman error minimization policy evaluation address several enhancement namely Bellman error minimization us... | [0.0039984420873224735, 0.04244862496852875, -0.006562928669154644, 0.00914664939045906, 0.042264848947525024, -0.019429760053753853, 0.017078934237360954, 0.002294990699738264, -0.021936118602752686, 0.019864944741129875, 0.04417052119970322, 0.062445688992738724, 0.011693740263581276, 0.019830500707030296, 0.03126795... |
40,777 | 40,777 | ['Pokkuluri Kiran Sree', 'Inamupudi Ramesh Babu', 'SSSN Usha Devi N'] | 1401.2688v1 | Protein Structure Predication from sequences of amino acid has gained a
remarkable attention in recent years. Even though there are some prediction
techniques addressing this problem, the approximate accuracy in predicting the
protein structure is closely 75%. An automated procedure was evolved with MACA
(Multiple Attr... | PSMACA: An Automated Protein Structure Prediction Using MACA (Multiple
Attractor Cellular Automata) | 2,014 | http://arxiv.org/pdf/1401.2688v1 | Title PSMACA Automated Protein Structure Prediction Using MACA Multiple Attractor Cellular Automata Summary Protein Structure Predication sequence amino acid gained remarkable attention recent year Even though prediction technique addressing problem approximate accuracy predicting protein structure closely 75 automated... | [0.0014317762106657028, 0.016116423532366753, -0.027939321473240852, -0.011080785654485226, 0.012876896187663078, 0.010826369747519493, -0.03626824915409088, -0.025493016466498375, -0.03710602596402168, -0.006687600165605545, 0.013573091477155685, -0.01904298923909664, 0.026855414733290672, 0.007283470127731562, 0.0028... |
40,778 | 40,778 | ['Shashank Mouli Satapathy', 'Santanu Kumar Rath'] | 1401.3069v2 | The job of software effort estimation is a critical one in the early stages
of the software development life cycle when the details of requirements are
usually not clearly identified. Various optimization techniques help in
improving the accuracy of effort estimation. The Support Vector Regression
(SVR) is one of sever... | Use Case Point Approach Based Software Effort Estimation using Various
Support Vector Regression Kernel Methods | 2,014 | http://arxiv.org/pdf/1401.3069v2 | Title Use Case Point Approach Based Software Effort Estimation using Various Support Vector Regression Kernel Methods Summary job software effort estimation critical one early stage software development life cycle detail requirement usually clearly identified Various optimization technique help improving accuracy effor... | [0.012590484693646431, -0.023131627589464188, -0.0407552495598793, -0.010899391025304794, 0.018552672117948532, -0.030821558088064194, 0.020167527720332146, -0.03657178580760956, -0.04494677111506462, 0.0005672212573699653, 0.08279842138290405, 0.07278797775506973, 0.03578558564186096, 0.08667786419391632, 0.0019338533... |
40,779 | 40,779 | ['Avneesh Saluja', 'Mahdi Pakdaman', 'Dongzhen Piao', 'Ankur P. Parikh'] | 1401.3413v1 | Rating and recommendation systems have become a popular application area for
applying a suite of machine learning techniques. Current approaches rely
primarily on probabilistic interpretations and extensions of matrix
factorization, which factorizes a user-item ratings matrix into latent user and
item vectors. Most of ... | Infinite Mixed Membership Matrix Factorization | 2,014 | http://arxiv.org/pdf/1401.3413v1 | Title Infinite Mixed Membership Matrix Factorization Summary Rating recommendation system become popular application area applying suite machine learning technique Current approach rely primarily probabilistic interpretation extension matrix factorization factorizes useritem rating matrix latent user item vector method... | [0.014655216597020626, 0.0016639274545013905, -0.011736350134015083, 0.00809055007994175, 0.022580573335289955, 0.023030588403344154, 0.018819713965058327, 0.0345759391784668, -0.019156472757458687, -0.004833172541111708, -0.08143507689237595, 0.012684092856943607, -0.00602626521140337, 0.09456238895654678, -0.03284021... |
40,780 | 40,780 | ['Sherief Abdallah', 'Victor Lesser'] | 1401.3454v1 | Several multiagent reinforcement learning (MARL) algorithms have been
proposed to optimize agents decisions. Due to the complexity of the problem,
the majority of the previously developed MARL algorithms assumed agents either
had some knowledge of the underlying game (such as Nash equilibria) and/or
observed other agen... | A Multiagent Reinforcement Learning Algorithm with Non-linear Dynamics | 2,014 | http://arxiv.org/pdf/1401.3454v1 | Title Multiagent Reinforcement Learning Algorithm Nonlinear Dynamics Summary Several multiagent reinforcement learning MARL algorithm proposed optimize agent decision Due complexity problem majority previously developed MARL algorithm assumed agent either knowledge underlying game Nash equilibrium andor observed agent ... | [0.024061108008027077, -0.028882518410682678, -0.014037826098501682, -0.06513488292694092, -0.020318476483225822, -0.005304432939738035, -0.0013908455148339272, -0.00627412274479866, -0.02276814915239811, 0.015004480257630348, -0.006902511231601238, 0.07255431264638901, -0.011540861800312996, 0.0267686415463686, 0.0159... |
40,781 | 40,781 | ['Amy Greenwald', 'Seong Jae Lee', 'Victor Naroditskiy'] | 1401.3829v1 | In this paper, we describe our autonomous bidding agent, RoxyBot, who emerged
victorious in the travel division of the 2006 Trading Agent Competition in a
photo finish. At a high level, the design of many successful trading agents can
be summarized as follows: (i) price prediction: build a model of market prices;
and (... | RoxyBot-06: Stochastic Prediction and Optimization in TAC Travel | 2,014 | http://arxiv.org/pdf/1401.3829v1 | Title RoxyBot06 Stochastic Prediction Optimization TAC Travel Summary paper describe autonomous bidding agent RoxyBot emerged victorious travel division 2006 Trading Agent Competition photo finish high level design many successful trading agent summarized follows price prediction build model market price ii optimizatio... | [0.03918810933828354, 0.013473479077219963, -0.02647332474589348, -0.043266378343105316, -0.012083487585186958, -0.0480644665658474, 0.019761336967349052, -0.004079832695424557, -0.015351835638284683, -0.01641896367073059, 0.010832998901605606, 0.019161591306328773, -0.02233816869556904, 0.12434093654155731, 0.01378588... |
40,782 | 40,782 | ['Liyue Zhao', 'Yu Zhang', 'Gita Sukthankar'] | 1401.3836v1 | Crowdsourcing platforms offer a practical solution to the problem of
affordably annotating large datasets for training supervised classifiers.
Unfortunately, poor worker performance frequently threatens to compromise
annotation reliability, and requesting multiple labels for every instance can
lead to large cost increa... | An Active Learning Approach for Jointly Estimating Worker Performance
and Annotation Reliability with Crowdsourced Data | 2,014 | http://arxiv.org/pdf/1401.3836v1 | Title Active Learning Approach Jointly Estimating Worker Performance Annotation Reliability Crowdsourced Data Summary Crowdsourcing platform offer practical solution problem affordably annotating large datasets training supervised classifier Unfortunately poor worker performance frequently threatens compromise annotati... | [-0.0055186389945447445, 0.03031683713197708, -0.018285177648067474, -0.020148154348134995, 0.020585743710398674, 0.01776966266334057, 0.06732286512851715, 0.009181655012071133, -0.009655785746872425, -0.04213211312890053, 0.0195729099214077, 0.051923397928476334, -0.012409679591655731, 0.02449650876224041, 0.033896412... |
40,783 | 40,783 | ['Xiaosong Lu', 'Howard M. Schwartz', 'Sidney N. Givigi Jr'] | 1401.3907v1 | We extend the potential-based shaping method from Markov decision processes
to multi-player general-sum stochastic games. We prove that the Nash equilibria
in a stochastic game remains unchanged after potential-based shaping is applied
to the environment. The property of policy invariance provides a possible way
of spe... | Policy Invariance under Reward Transformations for General-Sum
Stochastic Games | 2,014 | http://arxiv.org/pdf/1401.3907v1 | Title Policy Invariance Reward Transformations GeneralSum Stochastic Games Summary extend potentialbased shaping method Markov decision process multiplayer generalsum stochastic game prove Nash equilibrium stochastic game remains unchanged potentialbased shaping applied environment property policy invariance provides p... | [0.012330411933362484, 0.010303500108420849, -0.007802112493664026, -0.0580420196056366, -0.03090853989124298, -0.036868758499622345, -0.025076476857066154, -0.007206040900200605, -0.07783257961273193, 0.015294811688363552, -0.0032058858778327703, 0.011052227579057217, 0.0060667055658996105, 0.0718667134642601, 0.02161... |
40,784 | 40,784 | ['Charles-Henri Cappelaere', 'R. Dubois', 'P. Roussel', 'G. Dreyfus'] | 1401.4128v1 | The purpose of this study is to optimize the selection of prophylactic
cardioverter defibrillator implantation candidates. Currently, the main
criterion for implantation is a low Left Ventricular Ejection Fraction (LVEF)
whose specificity is relatively poor. We designed two classifiers aimed to
predict, from long term ... | Towards the selection of patients requiring ICD implantation by
automatic classification from Holter monitoring indices | 2,014 | http://arxiv.org/pdf/1401.4128v1 | Title Towards selection patient requiring ICD implantation automatic classification Holter monitoring index Summary purpose study optimize selection prophylactic cardioverter defibrillator implantation candidate Currently main criterion implantation low Left Ventricular Ejection Fraction LVEF whose specificity relative... | [-0.018920773640275, -0.03850593790411949, -0.023619642481207848, -0.0048650456592440605, 0.04041318967938423, 0.018475960940122604, 0.05051766708493233, -0.006629271898418665, 0.017325278371572495, 0.024147698655724525, 0.04160416126251221, -0.02008049748837948, 0.04759438335895538, 0.02280777134001255, -0.00840953830... |
40,785 | 40,785 | ['Balázs Hidasi', 'Domonkos Tikk'] | 1401.4529v2 | Context-aware recommendation algorithms focus on refining recommendations by
considering additional information, available to the system. This topic has
gained a lot of attention recently. Among others, several factorization methods
were proposed to solve the problem, although most of them assume explicit
feedback whic... | General factorization framework for context-aware recommendations | 2,014 | http://arxiv.org/pdf/1401.4529v2 | Title General factorization framework contextaware recommendation Summary Contextaware recommendation algorithm focus refining recommendation considering additional information available system topic gained lot attention recently Among others several factorization method proposed solve problem although assume explicit ... | [-0.009666632860898972, -0.008485202677547932, 0.0020051696337759495, -0.005266155581921339, 0.029174929484725, -0.013981504365801811, 0.05003528669476509, -0.0018511617090553045, -0.02739035151898861, -0.01568659581243992, -0.04538194090127945, 0.045614175498485565, -0.0036004800349473953, 0.0650300458073616, -0.02141... |
40,786 | 40,786 | ['Rania Ibrahim', 'Noha A. Yousri', 'Mohamed A. Ismail', 'Nagwa M. El-Makky'] | 1401.4589v1 | miRNA and gene expression profiles have been proved useful for classifying
cancer samples. Efficient classifiers have been recently sought and developed.
A number of attempts to classify cancer samples using miRNA/gene expression
profiles are known in literature. However, the use of semi-supervised learning
models have... | miRNA and Gene Expression based Cancer Classification using Self-
Learning and Co-Training Approaches | 2,014 | http://arxiv.org/pdf/1401.4589v1 | Title miRNA Gene Expression based Cancer Classification using Self Learning CoTraining Approaches Summary miRNA gene expression profile proved useful classifying cancer sample Efficient classifier recently sought developed number attempt classify cancer sample using miRNAgene expression profile known literature However... | [0.0010452247224748135, 0.023351024836301804, -0.030806604772806168, -0.027908354997634888, 0.011988488957285881, 0.04372711107134819, 0.07481369376182556, 0.01222041342407465, 0.0498696006834507, -0.019119802862405777, 0.02654707245528698, 0.0491592176258564, -0.051592063158750534, 0.009004225954413414, -0.01347466371... |
40,787 | 40,787 | ['Pokkuluri Kiran Sree', 'Inampudi Ramesh Babu', 'SSSN Usha Devi N'] | 1401.5364v1 | Human body consists of lot of cells, each cell consist of DeOxaRibo Nucleic
Acid (DNA). Identifying the genes from the DNA sequences is a very difficult
task. But identifying the coding regions is more complex task compared to the
former. Identifying the protein which occupy little place in genes is a really
challengin... | HMACA: Towards Proposing a Cellular Automata Based Tool for Protein
Coding, Promoter Region Identification and Protein Structure Prediction | 2,014 | http://arxiv.org/pdf/1401.5364v1 | Title HMACA Towards Proposing Cellular Automata Based Tool Protein Coding Promoter Region Identification Protein Structure Prediction Summary Human body consists lot cell cell consist DeOxaRibo Nucleic Acid DNA Identifying gene DNA sequence difficult task identifying coding region complex task compared former Identifyi... | [0.031957730650901794, 0.0217808336019516, -0.04391604661941528, -0.0220172218978405, 0.027868978679180145, 0.003802444553002715, 0.003526165382936597, 0.006573591381311417, -0.02960420772433281, -0.014143751934170723, 0.001721972250379622, 0.02788086049258709, 0.01721847429871559, 0.03687681257724762, 0.01456966437399... |
40,788 | 40,788 | ['Cyril Voyant', 'Gilles Notton', 'Christophe Paoli', 'Marie Laure Nivet', 'Marc Muselli', 'Kahina Dahmani'] | 1401.6002v1 | Numerous methods exist and were developed for global radiation forecasting.
The two most popular types are the numerical weather predictions (NWP) and the
predictions using stochastic approaches. We propose to compute a parameter
noted constructed in part from the mutual information which is a quantity that
measures th... | Numerical weather prediction or stochastic modeling: an objective
criterion of choice for the global radiation forecasting | 2,014 | http://arxiv.org/pdf/1401.6002v1 | Title Numerical weather prediction stochastic modeling objective criterion choice global radiation forecasting Summary Numerous method exist developed global radiation forecasting two popular type numerical weather prediction NWP prediction using stochastic approach propose compute parameter noted constructed part mutu... | [0.01718652993440628, 0.017751364037394524, 0.03624192997813225, -0.018270619213581085, 0.0297635979950428, 0.025653904303908348, -0.0065156095661222935, -0.034603238105773926, 0.06210661306977272, 0.027684839442372322, -0.04083174467086792, -0.02814248576760292, 0.001525528496131301, 0.014012591913342476, 0.0121446242... |
40,789 | 40,789 | ['Fabricio Olivetti de Franca'] | 1401.6124v1 | Minhashing is a technique used to estimate the Jaccard Index between two sets
by exploiting the probability of collision in a random permutation. In order to
speed up the computation, a random permutation can be approximated by using an
universal hash function such as the $h_{a,b}$ function proposed by Carter and
Wegma... | Iterative Universal Hash Function Generator for Minhashing | 2,014 | http://arxiv.org/pdf/1401.6124v1 | Title Iterative Universal Hash Function Generator Minhashing Summary Minhashing technique used estimate Jaccard Index two set exploiting probability collision random permutation order speed computation random permutation approximated using universal hash function hab function proposed Carter Wegman better estimate Jacc... | [-0.017153043299913406, -0.013598740100860596, -0.015307098627090454, -0.0011090096086263657, -0.03292590752243996, -0.013295156881213188, 0.050779037177562714, -0.017339713871479034, 0.01943398453295231, 0.017019256949424744, 0.05691045522689819, -0.00020305856014601886, -0.034871067851781845, 0.028119690716266632, -0... |
40,790 | 40,790 | ['Pokkuluri Kiran Sree', 'Inampudi Ramesh Babu'] | 1401.6484v1 | Genes carry the instructions for making proteins that are found in a cell as
a specific sequence of nucleotides that are found in DNA molecules. But, the
regions of these genes that code for proteins may occupy only a small region of
the sequence. Identifying the coding regions play a vital role in understanding
these ... | Identification of Protein Coding Regions in Genomic DNA Using
Unsupervised FMACA Based Pattern Classifier | 2,014 | http://arxiv.org/pdf/1401.6484v1 | Title Identification Protein Coding Regions Genomic DNA Using Unsupervised FMACA Based Pattern Classifier Summary Genes carry instruction making protein found cell specific sequence nucleotide found DNA molecule region gene code protein may occupy small region sequence Identifying coding region play vital role understa... | [0.05465226620435715, 0.05571216717362404, -0.06234829127788544, -0.003486165078356862, 0.03847436234354973, 0.027177754789590836, -0.0007753277313895524, 0.020194489508867264, -0.019965719431638718, -0.014994173310697079, 0.024750888347625732, -0.009197360835969448, 0.04018043726682663, 0.046285487711429596, 0.0018642... |
40,791 | 40,791 | ['Battista Biggio', 'Igino Corona', 'Blaine Nelson', 'Benjamin I. P. Rubinstein', 'Davide Maiorca', 'Giorgio Fumera', 'Giorgio Giacinto', 'and Fabio Roli'] | 1401.7727v1 | Support Vector Machines (SVMs) are among the most popular classification
techniques adopted in security applications like malware detection, intrusion
detection, and spam filtering. However, if SVMs are to be incorporated in
real-world security systems, they must be able to cope with attack patterns
that can either mis... | Security Evaluation of Support Vector Machines in Adversarial
Environments | 2,014 | http://arxiv.org/pdf/1401.7727v1 | Title Security Evaluation Support Vector Machines Adversarial Environments Summary Support Vector Machines SVMs among popular classification technique adopted security application like malware detection intrusion detection spam filtering However SVMs incorporated realworld security system must able cope attack pattern ... | [0.0460398904979229, -0.01719612069427967, -0.02032344415783882, 0.013870248571038246, -0.03908965736627579, -0.02961774170398712, 0.051121536642313004, -0.024792801588773727, 0.04373655095696449, -0.04008975625038147, 0.03824464976787567, 0.023007331416010857, 0.011043652892112732, 0.06383705139160156, 0.0362028218805... |
40,792 | 40,792 | ['Erik Zawadzki', 'Asher Lipson', 'Kevin Leyton-Brown'] | 1401.8074v1 | There exist many algorithms for learning how to play repeated bimatrix games.
Most of these algorithms are justified in terms of some sort of theoretical
guarantee. On the other hand, little is known about the empirical performance
of these algorithms. Most such claims in the literature are based on small
experiments, ... | Empirically Evaluating Multiagent Learning Algorithms | 2,014 | http://arxiv.org/pdf/1401.8074v1 | Title Empirically Evaluating Multiagent Learning Algorithms Summary exist many algorithm learning play repeated bimatrix game algorithm justified term sort theoretical guarantee hand little known empirical performance algorithm claim literature based small experiment hampered understanding well development new multiage... | [0.02561907097697258, 0.008090117946267128, -0.011793098412454128, -0.029700275510549545, -0.04857203736901283, -0.00784502737224102, 0.06821363419294357, 0.02435232698917389, 0.023859048262238503, -0.02665098011493683, -0.015852587297558784, 0.03792216256260872, -0.010031639598309994, 0.025827016681432724, 0.024074766... |
40,793 | 40,793 | ['Franziska Meier', 'Philipp Hennig', 'Stefan Schaal'] | 1402.0645v1 | Locally weighted regression was created as a nonparametric learning method
that is computationally efficient, can learn from very large amounts of data
and add data incrementally. An interesting feature of locally weighted
regression is that it can work with spatially varying length scales, a
beneficial property, for i... | Local Gaussian Regression | 2,014 | http://arxiv.org/pdf/1402.0645v1 | Title Local Gaussian Regression Summary Locally weighted regression created nonparametric learning method computationally efficient learn large amount data add data incrementally interesting feature locally weighted regression work spatially varying length scale beneficial property instance control problem However prov... | [-0.01887545734643936, 0.07433664798736572, -0.015480962581932545, -0.029647961258888245, -0.01330823265016079, -0.0075213722884655, 0.09184826910495758, -0.0017460115486755967, -0.0018838683608919382, 0.0835656225681305, 0.04742762818932533, 0.020412437617778778, 0.017645392566919327, 0.051600996404886246, 0.051076617... |
40,794 | 40,794 | ['Eli A. Meirom', 'Chris Milling', 'Constantine Caramanis', 'Shie Mannor', 'Ariel Orda', 'Sanjay Shakkottai'] | 1402.1263v1 | We consider the problem of detecting an epidemic in a population where
individual diagnoses are extremely noisy. The motivation for this problem is
the plethora of examples (influenza strains in humans, or computer viruses in
smartphones, etc.) where reliable diagnoses are scarce, but noisy data
plentiful. In flu/phone... | Localized epidemic detection in networks with overwhelming noise | 2,014 | http://arxiv.org/pdf/1402.1263v1 | Title Localized epidemic detection network overwhelming noise Summary consider problem detecting epidemic population individual diagnosis extremely noisy motivation problem plethora example influenza strain human computer virus smartphones etc reliable diagnosis scarce noisy data plentiful fluphoneviruses exceedingly i... | [-0.015425793826580048, 0.03522845730185509, -0.01739526353776455, -0.036642443388700485, -0.008390109054744244, -0.0565761923789978, -0.013179666362702847, -0.0271783284842968, 0.028146598488092422, 0.046591367572546005, 0.0774720311164856, 0.025759384036064148, -0.03337184712290764, 0.0880303606390953, 0.011517825536... |
40,795 | 40,795 | ['Jianshu Chen', 'Zaid J. Towfic', 'Ali H. Sayed'] | 1402.1515v2 | In this paper, we consider learning dictionary models over a network of
agents, where each agent is only in charge of a portion of the dictionary
elements. This formulation is relevant in Big Data scenarios where large
dictionary models may be spread over different spatial locations and it is not
feasible to aggregate ... | Dictionary Learning over Distributed Models | 2,014 | http://arxiv.org/pdf/1402.1515v2 | Title Dictionary Learning Distributed Models Summary paper consider learning dictionary model network agent agent charge portion dictionary element formulation relevant Big Data scenario large dictionary model may spread different spatial location feasible aggregate dictionary one location due communication privacy con... | [-0.002968002110719681, 0.020892061293125153, -0.0005802790401503444, -0.01473424956202507, -0.03160270303487778, -0.000884791137650609, 0.07631000876426697, -0.042370811104774475, 0.021008070558309555, -0.0012869936181232333, 0.025067340582609177, 0.033188141882419586, -0.012636867351830006, 0.07105343788862228, 0.004... |
40,796 | 40,796 | ['Amos Beimel', 'Kobbi Nissim', 'Uri Stemmer'] | 1402.2224v1 | In 2008, Kasiviswanathan et al. defined private learning as a combination of
PAC learning and differential privacy. Informally, a private learner is applied
to a collection of labeled individual information and outputs a hypothesis
while preserving the privacy of each individual. Kasiviswanathan et al. gave a
generic c... | Characterizing the Sample Complexity of Private Learners | 2,014 | http://arxiv.org/pdf/1402.2224v1 | Title Characterizing Sample Complexity Private Learners Summary 2008 Kasiviswanathan et al defined private learning combination PAC learning differential privacy Informally private learner applied collection labeled individual information output hypothesis preserving privacy individual Kasiviswanathan et al gave generi... | [-0.03026667982339859, 0.06445037573575974, -0.026514515280723572, -1.121978675655555e-05, -0.047428715974092484, -0.03783894702792168, 0.06562211364507675, -0.015162864699959755, 0.014926719479262829, 0.06316488981246948, 0.024865198880434036, -0.004749660845845938, 0.019854633137583733, 0.02766498737037182, 0.0082454... |
40,797 | 40,797 | ['Moritz Hardt', 'Raghu Meka', 'Prasad Raghavendra', 'Benjamin Weitz'] | 1402.2331v2 | Matrix Completion is the problem of recovering an unknown real-valued
low-rank matrix from a subsample of its entries. Important recent results show
that the problem can be solved efficiently under the assumption that the
unknown matrix is incoherent and the subsample is drawn uniformly at random.
Are these assumptions... | Computational Limits for Matrix Completion | 2,014 | http://arxiv.org/pdf/1402.2331v2 | Title Computational Limits Matrix Completion Summary Matrix Completion problem recovering unknown realvalued lowrank matrix subsample entry Important recent result show problem solved efficiently assumption unknown matrix incoherent subsample drawn uniformly random assumption necessary well known Matrix Completion full... | [0.016797494143247604, 0.08306434005498886, -0.007595382165163755, 0.02152487263083458, 0.016870666295289993, 0.003042366122826934, -0.06483396142721176, 0.03956863656640053, 0.030139056965708733, 0.03640323877334595, 0.031097492203116417, 0.04521111026406288, 0.022121714428067207, -0.042910076677799225, -0.00443864846... |
40,798 | 40,798 | ['P. Chaudhari', 'D. P. Rana', 'R. G. Mehta', 'N. J. Mistry', 'M. M. Raghuwanshi'] | 1402.4283v1 | In real world, the huge amount of temporal data is to be processed in many
application areas such as scientific, financial, network monitoring, sensor
data analysis. Data mining techniques are primarily oriented to handle discrete
features. In the case of temporal data the time plays an important role on the
characteri... | Discretization of Temporal Data: A Survey | 2,014 | http://arxiv.org/pdf/1402.4283v1 | Title Discretization Temporal Data Survey Summary real world huge amount temporal data processed many application area scientific financial network monitoring sensor data analysis Data mining technique primarily oriented handle discrete feature case temporal data time play important role characteristic data consider ef... | [-0.03848325461149216, 0.03579120337963104, -0.04701657220721245, -0.035535190254449844, 0.007648705039173365, -0.017788996919989586, 0.012478316202759743, -0.0019220283720642328, 0.005435439758002758, 0.020121721550822258, 0.09435232728719711, 0.004387122578918934, 0.011880740523338318, 0.07541532814502716, -0.0710425... |
40,799 | 40,799 | ['Jonathan Gelati', 'Sithan Kanna'] | 1402.4845v1 | In this technical report we analyse the performance of diffusion strategies
applied to the Least-Mean-Square adaptive filter. We configure a network of
cooperative agents running adaptive filters and discuss their behaviour when
compared with a non-cooperative agent which represents the average of the
network. The anal... | Diffusion Least Mean Square: Simulations | 2,014 | http://arxiv.org/pdf/1402.4845v1 | Title Diffusion Least Mean Square Simulations Summary technical report analyse performance diffusion strategy applied LeastMeanSquare adaptive filter configure network cooperative agent running adaptive filter discus behaviour compared noncooperative agent represents average network analysis provides condition diversit... | [-0.04929880052804947, -0.06706710159778595, -0.02999134175479412, -0.06187073513865471, -0.014381714165210724, -0.040762949734926224, 0.05892132222652435, -0.010226298123598099, 0.004824117757380009, 0.0010065374663099647, 0.061273034662008286, 0.004941047169268131, 0.0005118674598634243, 0.033199604600667953, -0.0085... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.