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,500 | 40,500 | ['Karthik Sridharan'] | 1204.4145v1 | In this dissertation we study statistical and online learning problems from
an optimization viewpoint.The dissertation is divided into two parts :
I. We first consider the question of learnability for statistical learning
problems in the general learning setting. The question of learnability is well
studied and fully... | Learning From An Optimization Viewpoint | 2,012 | http://arxiv.org/pdf/1204.4145v1 | Title Learning Optimization Viewpoint Summary dissertation study statistical online learning problem optimization viewpointThe dissertation divided two part first consider question learnability statistical learning problem general learning setting question learnability well studied fully characterized binary classifica... | [-0.015704981982707977, -0.02029193937778473, -0.02126367576420307, -0.00420221034437418, -0.013314669951796532, 0.0021343121770769358, 0.05770261958241463, 0.011969279497861862, -0.01591114141047001, -0.02506544068455696, 0.02737111784517765, 0.048550795763731, -0.006957317236810923, 0.03511177375912666, -0.0137525144... |
40,501 | 40,501 | ['Patrick Taillandier', 'Julien Gaffuri'] | 1204.4332v1 | Automated generalisation has known important improvements these last few
years. However, an issue that still deserves more study concerns the automatic
evaluation of generalised data. Indeed, many automated generalisation systems
require the utilisation of an evaluation function to automatically assess
generalisation o... | Designing generalisation evaluation function through human-machine
dialogue | 2,012 | http://arxiv.org/pdf/1204.4332v1 | Title Designing generalisation evaluation function humanmachine dialogue Summary Automated generalisation known important improvement last year However issue still deserves study concern automatic evaluation generalised data Indeed many automated generalisation system require utilisation evaluation function automatical... | [0.06278237700462341, 0.0364791601896286, -0.033244308084249496, 0.004184253979474306, 0.0018737890059128404, 0.006356874015182257, 0.02155269682407379, 0.002999905264005065, -0.02301516756415367, -0.032038524746894836, 0.00280910637229681, -0.051932256668806076, 0.027451615780591965, 0.04261413589119911, -0.0080393459... |
40,502 | 40,502 | ['Dusko Pavlovic'] | 1204.5802v1 | Formal Concept Analysis (FCA) begins from a context, given as a binary
relation between some objects and some attributes, and derives a lattice of
concepts, where each concept is given as a set of objects and a set of
attributes, such that the first set consists of all objects that satisfy all
attributes in the second,... | Quantitative Concept Analysis | 2,012 | http://arxiv.org/pdf/1204.5802v1 | Title Quantitative Concept Analysis Summary Formal Concept Analysis FCA begin context given binary relation object attribute derives lattice concept concept given set object set attribute first set consists object satisfy attribute second vice versa Many application though provide context quantitative information telli... | [-0.013032167218625546, 0.05818217620253563, -0.04255775734782219, 0.029005248099565506, -0.024885203689336777, -0.015375061891973019, -0.008419855497777462, 0.044555436819791794, -0.07594721764326096, -0.03821533918380737, 0.029926009476184845, -0.030976226553320885, 0.026314927265048027, 0.06313207745552063, -0.02273... |
40,503 | 40,503 | ['Marco Molinaro', 'R. Ravi'] | 1204.5810v1 | We consider packing LP's with $m$ rows where all constraint coefficients are
normalized to be in the unit interval. The n columns arrive in random order and
the goal is to set the corresponding decision variables irrevocably when they
arrive so as to obtain a feasible solution maximizing the expected reward.
Previous (... | Geometry of Online Packing Linear Programs | 2,012 | http://arxiv.org/pdf/1204.5810v1 | Title Geometry Online Packing Linear Programs Summary consider packing LPs row constraint coefficient normalized unit interval n column arrive random order goal set corresponding decision variable irrevocably arrive obtain feasible solution maximizing expected reward Previous 1 epsiloncompetitive algorithm require righ... | [-0.036017876118421555, 0.024584461003541946, -0.0266119297593832, -0.0009014165843836963, -0.00993004534393549, -0.03561973571777344, 0.04846342280507088, 0.05225775018334389, -0.011772188358008862, -0.01244701910763979, 0.058236412703990936, 0.037774644792079926, -0.008634802885353565, 0.12393206357955933, -0.0002989... |
40,504 | 40,504 | ['Yucheng Low', 'Joseph Gonzalez', 'Aapo Kyrola', 'Danny Bickson', 'Carlos Guestrin', 'Joseph M. Hellerstein'] | 1204.6078v1 | While high-level data parallel frameworks, like MapReduce, simplify the
design and implementation of large-scale data processing systems, they do not
naturally or efficiently support many important data mining and machine
learning algorithms and can lead to inefficient learning systems. To help fill
this critical void,... | Distributed GraphLab: A Framework for Machine Learning in the Cloud | 2,012 | http://arxiv.org/pdf/1204.6078v1 | Title Distributed GraphLab Framework Machine Learning Cloud Summary highlevel data parallel framework like MapReduce simplify design implementation largescale data processing system naturally efficiently support many important data mining machine learning algorithm lead inefficient learning system help fill critical vo... | [-0.002320626750588417, 0.004208630416542292, -0.01423365343362093, -0.020802568644285202, -0.015649810433387756, 0.016135765239596367, 0.03333500027656555, -0.0171915702521801, 0.09079177677631378, 0.020714541897177696, 0.03173218294978142, 0.0704285204410553, -0.024279169738292694, 0.08498358726501465, -0.02290619723... |
40,505 | 40,505 | ['Abdul Ghani Abro', 'Junita Mohamad Saleh'] | 1204.6250v1 | Essentially, motive behind using control system is to generate suitable
control signal for yielding desired response of a physical process. Control of
synchronous generator has always remained very critical in power system
operation and control. For certain well known reasons power generators are
normally operated well... | Feature Selection for Generator Excitation Neurocontroller Development
Using Filter Technique | 2,011 | http://arxiv.org/pdf/1204.6250v1 | Title Feature Selection Generator Excitation Neurocontroller Development Using Filter Technique Summary Essentially motive behind using control system generate suitable control signal yielding desired response physical process Control synchronous generator always remained critical power system operation control certain... | [-0.04758718982338905, -2.2001544493832625e-05, -0.020478885620832443, 0.01696934923529625, 0.03694278374314308, -0.011308496817946434, -0.0033295308239758015, 0.011999501846730709, 0.0006924428744241595, -0.01967509835958481, 0.02159905806183815, 0.05901823565363884, -0.0130363954231143, 0.06964506208896637, 0.0895794... |
40,506 | 40,506 | ['Konstantinos Chorianopoulos', 'Vassiliki Tsaknaki'] | 1204.6325v2 | We explore the design of a seamless broadcast communication system that
brings together the distributed community of remote secondary education
schools. In contrast to higher education, primary and secondary education
establishments should remain distributed, in order to maintain a balance of
urban and rural life in th... | CELL: Connecting Everyday Life in an archipeLago | 2,012 | http://arxiv.org/pdf/1204.6325v2 | Title CELL Connecting Everyday Life archipeLago Summary explore design seamless broadcast communication system brings together distributed community remote secondary education school contrast higher education primary secondary education establishment remain distributed order maintain balance urban rural life developing... | [0.04373627156019211, -0.0600912906229496, -0.019045038148760796, -0.024999482557177544, 0.0020238952711224556, -0.01411519292742014, 0.04800533130764961, -0.002904413966462016, 0.005391845013946295, 0.003289593616500497, 0.017858287319540977, 0.03048509918153286, 0.023037288337945938, 0.08501437306404114, -0.003679539... |
40,507 | 40,507 | ['Jia Zeng', 'Xiao-Qin Cao', 'Zhi-Qiang Liu'] | 1204.6610v1 | Fast convergence speed is a desired property for training latent Dirichlet
allocation (LDA), especially in online and parallel topic modeling for massive
data sets. This paper presents a novel residual belief propagation (RBP)
algorithm to accelerate the convergence speed for training LDA. The proposed
RBP uses an info... | Residual Belief Propagation for Topic Modeling | 2,012 | http://arxiv.org/pdf/1204.6610v1 | Title Residual Belief Propagation Topic Modeling Summary Fast convergence speed desired property training latent Dirichlet allocation LDA especially online parallel topic modeling massive data set paper present novel residual belief propagation RBP algorithm accelerate convergence speed training LDA proposed RBP us inf... | [0.019131580367684364, 0.040033970028162, 0.022219564765691757, 0.0017610195791348815, -0.04361964017152786, 0.028305072337388992, -0.00770682143047452, -0.007572125177830458, -0.03259881213307381, -0.03659398481249809, 0.02954399585723877, 0.009200505912303925, -0.021230826154351234, 0.01625032350420952, -0.0377598702... |
40,508 | 40,508 | ['L. Chekina', 'D. Mimran', 'L. Rokach', 'Y. Elovici', 'B. Shapira'] | 1208.0564v2 | In this paper a novel system for detecting meaningful deviations in a mobile
application's network behavior is proposed. The main goal of the proposed
system is to protect mobile device users and cellular infrastructure companies
from malicious applications. The new system is capable of: (1) identifying
malicious attac... | Detection of Deviations in Mobile Applications Network Behavior | 2,012 | http://arxiv.org/pdf/1208.0564v2 | Title Detection Deviations Mobile Applications Network Behavior Summary paper novel system detecting meaningful deviation mobile application network behavior proposed main goal proposed system protect mobile device user cellular infrastructure company malicious application new system capable 1 identifying malicious att... | [0.053822051733732224, -0.02677486091852188, -0.039546020328998566, -0.006948825903236866, -0.040933649986982346, -0.027852840721607208, 0.02057725191116333, -0.00654739560559392, -0.019901372492313385, -0.07932005077600479, 0.05333175137639046, 0.011258108541369438, 0.015124429948627949, 0.027059223502874374, 0.008798... |
40,509 | 40,509 | ['Shang Shang', 'Sanjeev R. Kulkarni', 'Paul W. Cuff', 'Pan Hui'] | 1208.0787v2 | Collaborative filtering (CF) is one of the most popular approaches to build a
recommendation system. In this paper, we propose a hybrid collaborative
filtering model based on a Makovian random walk to address the data sparsity
and cold start problems in recommendation systems. More precisely, we construct
a directed gr... | A Random Walk Based Model Incorporating Social Information for
Recommendations | 2,012 | http://arxiv.org/pdf/1208.0787v2 | Title Random Walk Based Model Incorporating Social Information Recommendations Summary Collaborative filtering CF one popular approach build recommendation system paper propose hybrid collaborative filtering model based Makovian random walk address data sparsity cold start problem recommendation system precisely constr... | [0.03977284952998161, -0.013768618926405907, 0.0045171258971095085, -0.03113686479628086, -0.018398769199848175, -0.028498470783233643, -0.012127713300287724, -0.020074328407645226, 0.035360053181648254, -0.011577989906072617, 0.0033016095403581858, 0.02054073102772236, 0.0011517773382365704, 0.06180737912654877, -0.00... |
40,510 | 40,510 | ['Peter Sarlin'] | 1208.1819v1 | This paper adopts and adapts Kohonen's standard Self-Organizing Map (SOM) for
exploratory temporal structure analysis. The Self-Organizing Time Map (SOTM)
implements SOM-type learning to one-dimensional arrays for individual time
units, preserves the orientation with short-term memory and arranges the arrays
in an asce... | Self-Organizing Time Map: An Abstraction of Temporal Multivariate
Patterns | 2,012 | http://arxiv.org/pdf/1208.1819v1 | Title SelfOrganizing Time Map Abstraction Temporal Multivariate Patterns Summary paper adopts adapts Kohonens standard SelfOrganizing Map SOM exploratory temporal structure analysis SelfOrganizing Time Map SOTM implement SOMtype learning onedimensional array individual time unit preserve orientation shortterm memory ar... | [-0.046924907714128494, 0.0448126383125782, -0.056186188012361526, -0.016106417402625084, -0.02442609705030918, -0.003573003225028515, 0.06771527975797653, -0.0052459524013102055, -0.008492781780660152, 0.014870432205498219, 0.04684275761246681, 0.0687222108244896, 0.012016016989946365, 0.09537918120622635, -0.02209159... |
40,511 | 40,511 | ['Sahand Negahban', 'Benjamin I. P. Rubinstein', 'Jim Gemmell'] | 1208.1860v1 | We consider a serious, previously-unexplored challenge facing almost all
approaches to scaling up entity resolution (ER) to multiple data sources: the
prohibitive cost of labeling training data for supervised learning of
similarity scores for each pair of sources. While there exists a rich
literature describing almost ... | Scaling Multiple-Source Entity Resolution using Statistically Efficient
Transfer Learning | 2,012 | http://arxiv.org/pdf/1208.1860v1 | Title Scaling MultipleSource Entity Resolution using Statistically Efficient Transfer Learning Summary consider serious previouslyunexplored challenge facing almost approach scaling entity resolution ER multiple data source prohibitive cost labeling training data supervised learning similarity score pair source exists ... | [-0.015625394880771637, 0.011896106414496899, 0.021129591390490532, -0.022104967385530472, 0.026374321430921555, 0.04109823331236839, 0.030849527567625046, 0.041065700352191925, 0.004682623781263828, -0.004581865854561329, -0.04604577273130417, -0.0012872660299763083, -0.01217725221067667, 0.01691576838493347, -0.01361... |
40,512 | 40,512 | ['Sudarshan Nandy', 'Partha Pratim Sarkar', 'Achintya Das'] | 1208.2808v1 | The growth of world-wide-web (WWW) spreads its wings from an intangible
quantities of web-pages to a gigantic hub of web information which gradually
increases the complexity of crawling process in a search engine. A search
engine handles a lot of queries from various parts of this world, and the
answers of it solely de... | Analysis of a Statistical Hypothesis Based Learning Mechanism for Faster
crawling | 2,012 | http://arxiv.org/pdf/1208.2808v1 | Title Analysis Statistical Hypothesis Based Learning Mechanism Faster crawling Summary growth worldwideweb WWW spread wing intangible quantity webpage gigantic hub web information gradually increase complexity crawling process search engine search engine handle lot query various part world answer solely depend knowledg... | [0.056844018399715424, -0.029567649587988853, -0.03742828592658043, -0.041210878640413284, -0.054200056940317154, -0.04358135536313057, 0.03534575551748276, 0.027581045404076576, 0.03494608402252197, -0.04034874215722084, 0.015665195882320404, 0.006236433517187834, -0.021418705582618713, 0.04168194904923439, -0.0044439... |
40,513 | 40,513 | ['Stijn van Dongen', 'Anton J. Enright'] | 1208.3145v1 | We investigate two classes of transformations of cosine similarity and
Pearson and Spearman correlations into metric distances, utilising the simple
tool of metric-preserving functions. The first class puts anti-correlated
objects maximally far apart. Previously known transforms fall within this
class. The second class... | Metric distances derived from cosine similarity and Pearson and Spearman
correlations | 2,012 | http://arxiv.org/pdf/1208.3145v1 | Title Metric distance derived cosine similarity Pearson Spearman correlation Summary investigate two class transformation cosine similarity Pearson Spearman correlation metric distance utilising simple tool metricpreserving function first class put anticorrelated object maximally far apart Previously known transforms f... | [-0.0017239461885765195, 0.0016298789996653795, -0.007444172631949186, 0.0016079026972875, -0.04940096288919449, -0.001021405216306448, 0.05335332080721855, 0.042682912200689316, -0.03660762682557106, 0.009122248739004135, -0.011908885091543198, 0.04535027593374252, 0.036613091826438904, -0.01772318221628666, -0.040480... |
40,514 | 40,514 | ['Pol Blasco', 'Deniz Gündüz', 'Mischa Dohler'] | 1208.4290v2 | A point-to-point wireless communication system in which the transmitter is
equipped with an energy harvesting device and a rechargeable battery, is
studied. Both the energy and the data arrivals at the transmitter are modeled
as Markov processes. Delay-limited communication is considered assuming that
the underlying ch... | A Learning Theoretic Approach to Energy Harvesting Communication System
Optimization | 2,012 | http://arxiv.org/pdf/1208.4290v2 | Title Learning Theoretic Approach Energy Harvesting Communication System Optimization Summary pointtopoint wireless communication system transmitter equipped energy harvesting device rechargeable battery studied energy data arrival transmitter modeled Markov process Delaylimited communication considered assuming underl... | [-0.005601472686976194, -0.029603902250528336, 0.010226809419691563, 0.009188649244606495, 0.02853233367204666, -0.01689690165221691, -0.0513179711997509, -0.005842909216880798, -0.047250617295503616, 0.02406293712556362, 0.06520339846611023, 0.08819260448217392, 0.014663899317383766, 0.0006909751682542264, 0.015076505... |
40,515 | 40,515 | ['Paul M. B. Vitanyi', 'Nick Chater'] | 1208.5003v3 | We consider the problem of inferring the probability distribution associated
with a language, given data consisting of an infinite sequence of elements of
the languge. We do this under two assumptions on the algorithms concerned: (i)
like a real-life algorothm it has round-off errors, and (ii) it has no
round-off error... | Identification of Probabilities of Languages | 2,012 | http://arxiv.org/pdf/1208.5003v3 | Title Identification Probabilities Languages Summary consider problem inferring probability distribution associated language given data consisting infinite sequence element languge two assumption algorithm concerned like reallife algorothm roundoff error ii roundoff error Assuming consider probability mass function ele... | [0.008780895732343197, 0.056301359087228775, -0.02066374383866787, 0.0206903088837862, -0.060069501399993896, -0.009569229558110237, -0.03387949988245964, 0.032493289560079575, -0.038731999695301056, 0.025766562670469284, 0.06974092125892639, -0.011240189895033836, 0.04230860620737076, 0.05317742004990578, 0.0029381329... |
40,516 | 40,516 | ['B. Mishra', 'G. Meyer', 'S. Bonnabel', 'R. Sepulchre'] | 1209.0430v2 | Motivated by the problem of learning a linear regression model whose
parameter is a large fixed-rank non-symmetric matrix, we consider the
optimization of a smooth cost function defined on the set of fixed-rank
matrices. We adopt the geometric framework of optimization on Riemannian
quotient manifolds. We study the und... | Fixed-rank matrix factorizations and Riemannian low-rank optimization | 2,012 | http://arxiv.org/pdf/1209.0430v2 | Title Fixedrank matrix factorization Riemannian lowrank optimization Summary Motivated problem learning linear regression model whose parameter large fixedrank nonsymmetric matrix consider optimization smooth cost function defined set fixedrank matrix adopt geometric framework optimization Riemannian quotient manifold ... | [-0.0036589698866009712, 0.02617887407541275, -0.012896829284727573, 0.037416890263557434, 0.036850154399871826, 0.010776466690003872, 0.008870267309248447, 0.013994279317557812, 0.05591784790158272, -0.007664703764021397, -0.0007811099058017135, 0.00489497696980834, 0.011627539992332458, 0.021171046420931816, 0.030184... |
40,517 | 40,517 | ['Jan Oksanen', 'Jarmo Lundén', 'Visa Koivunen'] | 1209.1739v1 | Finding an optimal sensing policy for a particular access policy and sensing
scheme is a laborious combinatorial problem that requires the system model
parameters to be known. In practise the parameters or the model itself may not
be completely known making reinforcement learning methods appealing. In this
paper a non-... | Design of Spectrum Sensing Policy for Multi-user Multi-band Cognitive
Radio Network | 2,012 | http://arxiv.org/pdf/1209.1739v1 | Title Design Spectrum Sensing Policy Multiuser Multiband Cognitive Radio Network Summary Finding optimal sensing policy particular access policy sensing scheme laborious combinatorial problem requires system model parameter known practise parameter model may completely known making reinforcement learning method appeali... | [0.0032045890111476183, 0.007365778088569641, -0.033517736941576004, -0.07002975791692734, -0.0451040156185627, -0.07000546902418137, -0.007544105406850576, -0.03902051970362663, 0.002726729027926922, 0.004128263331949711, -0.010601049289107323, 0.03023534268140793, -0.04259691759943962, -0.005154888611286879, -0.04445... |
40,518 | 40,518 | ['Eitan Menahem', 'Alon Schclar', 'Lior Rokach', 'Yuval Elovici'] | 1209.1797v3 | XML transactions are used in many information systems to store data and
interact with other systems. Abnormal transactions, the result of either an
on-going cyber attack or the actions of a benign user, can potentially harm the
interacting systems and therefore they are regarded as a threat. In this paper
we address th... | Securing Your Transactions: Detecting Anomalous Patterns In XML
Documents | 2,012 | http://arxiv.org/pdf/1209.1797v3 | Title Securing Transactions Detecting Anomalous Patterns XML Documents Summary XML transaction used many information system store data interact system Abnormal transaction result either ongoing cyber attack action benign user potentially harm interacting system therefore regarded threat paper address problem anomaly de... | [0.046378567814826965, -0.02422209642827511, -0.019328588619828224, 0.02666659466922283, -0.01743960939347744, -0.017676232382655144, 0.025655873119831085, 0.023858509957790375, 0.017462242394685745, -0.013036949560046196, 0.05389374867081642, 0.02011130005121231, 0.0063597215339541435, 0.06840687990188599, -0.03226562... |
40,519 | 40,519 | ['Barzan Mozafari', 'Purnamrita Sarkar', 'Michael J. Franklin', 'Michael I. Jordan', 'Samuel Madden'] | 1209.3686v4 | Crowd-sourcing has become a popular means of acquiring labeled data for a
wide variety of tasks where humans are more accurate than computers, e.g.,
labeling images, matching objects, or analyzing sentiment. However, relying
solely on the crowd is often impractical even for data sets with thousands of
items, due to tim... | Active Learning for Crowd-Sourced Databases | 2,012 | http://arxiv.org/pdf/1209.3686v4 | Title Active Learning CrowdSourced Databases Summary Crowdsourcing become popular mean acquiring labeled data wide variety task human accurate computer eg labeling image matching object analyzing sentiment However relying solely crowd often impractical even data set thousand item due time cost constraint acquiring huma... | [0.031700119376182556, 0.03322158008813858, -0.007471201475709677, 0.012235318310558796, -0.009067857638001442, 0.02712348662316799, 0.01607501693069935, -0.010255335830152035, 0.013638300821185112, -0.0524890162050724, 0.016345113515853882, 0.003009339328855276, -0.010426532477140427, 0.06727747619152069, 0.0268407016... |
40,520 | 40,520 | ['Kasturi Varadarajan', 'Xin Xiao'] | 1209.4893v2 | In this article, we study shape fitting problems, $\epsilon$-coresets, and
total sensitivity. We focus on the $(j,k)$-projective clustering problems,
including $k$-median/$k$-means, $k$-line clustering, $j$-subspace
approximation, and the integer $(j,k)$-projective clustering problem. We derive
upper bounds of total se... | On the Sensitivity of Shape Fitting Problems | 2,012 | http://arxiv.org/pdf/1209.4893v2 | Title Sensitivity Shape Fitting Problems Summary article study shape fitting problem epsiloncoresets total sensitivity focus jkprojective clustering problem including kmediankmeans kline clustering jsubspace approximation integer jkprojective clustering problem derive upper bound total sensitivity problem obtain epsilo... | [-0.05666789412498474, -0.04563053697347641, -0.047936830669641495, 0.04983086138963699, 0.01749299094080925, -0.023324361070990562, 0.03445558249950409, 0.05444558709859848, 0.012083201669156551, 0.03790907934308052, 0.009918554686009884, 0.006541362497955561, 0.03812752664089203, 0.06130325794219971, -0.0073777078650... |
40,521 | 40,521 | ['Makiko Konoshima', 'Yui Noma'] | 1209.5833v2 | We propose a learning method with feature selection for Locality-Sensitive
Hashing. Locality-Sensitive Hashing converts feature vectors into bit arrays.
These bit arrays can be used to perform similarity searches and personal
authentication. The proposed method uses bit arrays longer than those used in
the end for simi... | Locality-Sensitive Hashing with Margin Based Feature Selection | 2,012 | http://arxiv.org/pdf/1209.5833v2 | Title LocalitySensitive Hashing Margin Based Feature Selection Summary propose learning method feature selection LocalitySensitive Hashing LocalitySensitive Hashing convert feature vector bit array bit array used perform similarity search personal authentication proposed method us bit array longer used end similarity s... | [-0.025564763695001602, 0.008919981308281422, -0.014311829581856728, 0.03544965758919716, -0.037395864725112915, 0.013330638408660889, 0.12088780850172043, 0.03242192417383194, -0.009027518332004547, -0.029070522636175156, 0.03221758455038071, -0.004489467479288578, 0.0018885196186602116, 0.02542285807430744, -0.019689... |
40,522 | 40,522 | ['Pablo Sprechmann', 'Alex M. Bronstein', 'Guillermo Sapiro'] | 1209.6393v1 | In this paper we present a comprehensive framework for learning robust
low-rank representations by combining and extending recent ideas for learning
fast sparse coding regressors with structured non-convex optimization
techniques. This approach connects robust principal component analysis (RPCA)
with dictionary learnin... | Learning Robust Low-Rank Representations | 2,012 | http://arxiv.org/pdf/1209.6393v1 | Title Learning Robust LowRank Representations Summary paper present comprehensive framework learning robust lowrank representation combining extending recent idea learning fast sparse coding regressors structured nonconvex optimization technique approach connects robust principal component analysis RPCA dictionary lear... | [0.005062490701675415, 0.046525292098522186, -0.0085265152156353, 0.0668376237154007, 0.05255812034010887, -0.017110170796513557, -0.004924585577100515, 0.017801199108362198, -0.041474632918834686, -0.0018485027831047773, -0.012961297295987606, 0.009733282960951328, -0.004616088233888149, 0.0393550768494606, 0.02779045... |
40,523 | 40,523 | ['Houtao Deng', 'George Runger'] | 1209.6425v3 | The regularized random forest (RRF) was recently proposed for feature
selection by building only one ensemble. In RRF the features are evaluated on a
part of the training data at each tree node. We derive an upper bound for the
number of distinct Gini information gain values in a node, and show that many
features can s... | Gene selection with guided regularized random forest | 2,012 | http://arxiv.org/pdf/1209.6425v3 | Title Gene selection guided regularized random forest Summary regularized random forest RRF recently proposed feature selection building one ensemble RRF feature evaluated part training data tree node derive upper bound number distinct Gini information gain value node show many feature share information gain node small... | [0.02368643321096897, 0.011692280881106853, -0.050486400723457336, -0.026351409032940865, -0.014464985579252243, -0.006727985572069883, 0.05204164981842041, 0.04182351753115654, 0.016101108863949776, -0.0019776555709540844, 0.06942356377840042, 0.029723137617111206, 0.027660762891173363, 0.026518844068050385, -0.004718... |
40,524 | 40,524 | ['F. Ozgur Catak', 'M. Erdal Balaban'] | 1301.0082v1 | In conventional method, distributed support vector machines (SVM) algorithms
are trained over pre-configured intranet/internet environments to find out an
optimal classifier. These methods are very complicated and costly for large
datasets. Hence, we propose a method that is referred as the Cloud SVM training
mechanism... | CloudSVM : Training an SVM Classifier in Cloud Computing Systems | 2,013 | http://arxiv.org/pdf/1301.0082v1 | Title CloudSVM Training SVM Classifier Cloud Computing Systems Summary conventional method distributed support vector machine SVM algorithm trained preconfigured intranetinternet environment find optimal classifier method complicated costly large datasets Hence propose method referred Cloud SVM training mechanism Cloud... | [0.006209544371813536, -0.00982762686908245, -0.018499057739973068, -0.005178053397685289, -0.003448692848905921, 0.02942487969994545, 0.05858026444911957, -0.006144756451249123, 0.031212763860821724, -0.015909504145383835, 0.04506094753742218, 0.018799154087901115, 0.00515797920525074, 0.03708494454622269, -0.00960042... |
40,525 | 40,525 | ['Hamidreza Chitsaz', 'Elmirasadat Forouzmand', 'Gholamreza Haffari'] | 1301.1590v1 | It has been shown that minimum free energy structure for RNAs and RNA-RNA
interaction is often incorrect due to inaccuracies in the energy parameters and
inherent limitations of the energy model. In contrast, ensemble based
quantities such as melting temperature and equilibrium concentrations can be
more reliably predi... | An Efficient Algorithm for Upper Bound on the Partition Function of
Nucleic Acids | 2,013 | http://arxiv.org/pdf/1301.1590v1 | Title Efficient Algorithm Upper Bound Partition Function Nucleic Acids Summary shown minimum free energy structure RNAs RNARNA interaction often incorrect due inaccuracy energy parameter inherent limitation energy model contrast ensemble based quantity melting temperature equilibrium concentration reliably predicted Ev... | [0.002672175643965602, -0.025067072361707687, 0.016400165855884552, 0.03143899515271187, 0.008016200736165047, -0.008618984371423721, 0.015521989203989506, -0.007015491835772991, 0.02143612690269947, -0.016600433737039566, 0.033112406730651855, -0.03479335457086563, 0.03922487422823906, 0.049285635352134705, 0.01738027... |
40,526 | 40,526 | ['Rita Sharma', 'David L Poole'] | 1301.2309v1 | Collaborative filtering is the process of making recommendations regarding
the potential preference of a user, for example shopping on the Internet, based
on the preference ratings of the user and a number of other users for various
items. This paper considers collaborative filtering based on
explicitmulti-valued ratin... | Symmetric Collaborative Filtering Using the Noisy Sensor Model | 2,013 | http://arxiv.org/pdf/1301.2309v1 | Title Symmetric Collaborative Filtering Using Noisy Sensor Model Summary Collaborative filtering process making recommendation regarding potential preference user example shopping Internet based preference rating user number user various item paper considers collaborative filtering based explicitmultivalued rating eval... | [0.008782458491623402, 0.015500392764806747, -0.003009394509717822, -0.023728370666503906, -0.03332379832863808, -0.00459327083081007, 0.028603585436940193, 0.009473216719925404, -0.007886656560003757, -0.025943433865904808, -0.04060247540473938, 0.008654385805130005, 0.007603995501995087, 0.034851767122745514, -0.0125... |
40,527 | 40,527 | ['Muhammad Rafi', 'Mohammad Shahid Shaikh'] | 1301.2785v1 | Document classification is a task of assigning a new unclassified document to
one of the predefined set of classes. The content based document classification
uses the content of the document with some weighting criteria to assign it to
one of the predefined classes. It is a major task in library science,
electronic doc... | A comparison of SVM and RVM for Document Classification | 2,013 | http://arxiv.org/pdf/1301.2785v1 | Title comparison SVM RVM Document Classification Summary Document classification task assigning new unclassified document one predefined set class content based document classification us content document weighting criterion assign one predefined class major task library science electronic document management system in... | [0.05774236470460892, -0.032632920891046524, 0.004407941363751888, -0.010359959676861763, -0.01884765923023224, 0.020488448441028595, 0.03451387211680412, 0.026344312354922295, -0.012620843015611172, -0.06945031881332397, 0.02125324122607708, 0.025510607287287712, 0.023115264251828194, -0.02499411441385746, -0.03350143... |
40,528 | 40,528 | ['Hugo Van hamme'] | 1301.3389v2 | Non-negative matrix factorization (NMF) has become a popular machine learning
approach to many problems in text mining, speech and image processing,
bio-informatics and seismic data analysis to name a few. In NMF, a matrix of
non-negative data is approximated by the low-rank product of two matrices with
non-negative en... | The Diagonalized Newton Algorithm for Nonnegative Matrix Factorization | 2,013 | http://arxiv.org/pdf/1301.3389v2 | Title Diagonalized Newton Algorithm Nonnegative Matrix Factorization Summary Nonnegative matrix factorization NMF become popular machine learning approach many problem text mining speech image processing bioinformatics seismic data analysis name NMF matrix nonnegative data approximated lowrank product two matrix nonneg... | [-0.04855253919959068, 0.021101033315062523, -0.013566582463681698, 0.03508944436907768, -0.01605318859219551, -0.020591752603650093, -0.005609322339296341, 0.019227951765060425, -0.06961600482463837, -0.0046234456822276115, -0.0023273027036339045, -0.012901190668344498, 0.020082810893654823, 0.015001890249550343, -0.0... |
40,529 | 40,529 | ['Vamsi K. Potluru', 'Sergey M. Plis', 'Jonathan Le Roux', 'Barak A. Pearlmutter', 'Vince D. Calhoun', 'Thomas P. Hayes'] | 1301.3527v2 | Nonnegative matrix factorization (NMF) has become a ubiquitous tool for data
analysis. An important variant is the sparse NMF problem which arises when we
explicitly require the learnt features to be sparse. A natural measure of
sparsity is the L$_0$ norm, however its optimization is NP-hard. Mixed norms,
such as L$_1$... | Block Coordinate Descent for Sparse NMF | 2,013 | http://arxiv.org/pdf/1301.3527v2 | Title Block Coordinate Descent Sparse NMF Summary Nonnegative matrix factorization NMF become ubiquitous tool data analysis important variant sparse NMF problem arises explicitly require learnt feature sparse natural measure sparsity L0 norm however optimization NPhard Mixed norm L1L2 measure shown model sparsity robus... | [-0.06981907784938812, 0.05822659283876419, -0.0006703216349706054, 0.017602402716875076, 0.038129787892103195, -0.017369944602251053, 0.022350875660777092, 0.05252306908369064, -0.014975612051784992, 0.002320698695257306, -9.518376464257017e-05, -0.03089166060090065, 0.0090234549716115, 0.020047631114721298, 0.0004226... |
40,530 | 40,530 | ['Razvan Pascanu', 'Yoshua Bengio'] | 1301.3584v7 | We evaluate natural gradient, an algorithm originally proposed in Amari
(1997), for learning deep models. The contributions of this paper are as
follows. We show the connection between natural gradient and three other
recently proposed methods for training deep models: Hessian-Free (Martens,
2010), Krylov Subspace Desc... | Revisiting Natural Gradient for Deep Networks | 2,013 | http://arxiv.org/pdf/1301.3584v7 | Title Revisiting Natural Gradient Deep Networks Summary evaluate natural gradient algorithm originally proposed Amari 1997 learning deep model contribution paper follows show connection natural gradient three recently proposed method training deep model HessianFree Martens 2010 Krylov Subspace Descent Vinyals Povey 201... | [-0.0025335242971777916, 0.01783045195043087, -0.0031706197187304497, 0.023112652823328972, 0.02420354261994362, -0.016692128032445908, -0.006562164053320885, -0.019774233922362328, 0.016454093158245087, 0.03116763010621071, -0.048457320779561996, 0.018049459904432297, -0.01140065211802721, -0.009460399858653545, 0.056... |
40,531 | 40,531 | ['John S. Breese', 'David Heckerman', 'Carl Kadie'] | 1301.7363v1 | Collaborative filtering or recommender systems use a database about user
preferences to predict additional topics or products a new user might like. In
this paper we describe several algorithms designed for this task, including
techniques based on correlation coefficients, vector-based similarity
calculations, and stat... | Empirical Analysis of Predictive Algorithms for Collaborative Filtering | 2,013 | http://arxiv.org/pdf/1301.7363v1 | Title Empirical Analysis Predictive Algorithms Collaborative Filtering Summary Collaborative filtering recommender system use database user preference predict additional topic product new user might like paper describe several algorithm designed task including technique based correlation coefficient vectorbased similar... | [0.02695382945239544, -0.0007963916286826134, -0.011771568097174168, -0.022246195003390312, -0.040704306215047836, -0.03852296993136406, 0.025240015238523483, 0.023012332618236542, 0.008438303135335445, -0.003246479667723179, -0.029594676569104195, 0.011260870844125748, 0.023833410814404488, 0.05154035985469818, -0.038... |
40,532 | 40,532 | ['Chao Zhang', 'Lei Zhang', 'Jieping Ye'] | 1304.1574v1 | In this paper, we provide a new framework to obtain the generalization bounds
of the learning process for domain adaptation, and then apply the derived
bounds to analyze the asymptotical convergence of the learning process. Without
loss of generality, we consider two kinds of representative domain adaptation:
one is wi... | Generalization Bounds for Domain Adaptation | 2,013 | http://arxiv.org/pdf/1304.1574v1 | Title Generalization Bounds Domain Adaptation Summary paper provide new framework obtain generalization bound learning process domain adaptation apply derived bound analyze asymptotical convergence learning process Without loss generality consider two kind representative domain adaptation one multiple source combining ... | [-0.02683868259191513, -0.013475160114467144, -0.029621655121445656, -0.002311290707439184, -0.02140357345342636, 0.0006741327233612537, 0.014079621061682701, 0.026455461978912354, -0.07217492163181305, 0.006727173458784819, -0.019683586433529854, -0.010879438370466232, -0.021331781521439552, 0.012868561781942844, -0.0... |
40,533 | 40,533 | ['Jialu Liu'] | 1304.5168v1 | This article gives a survey for bag-of-words (BoW) or bag-of-features model
in image retrieval system. In recent years, large-scale image retrieval shows
significant potential in both industry applications and research problems. As
local descriptors like SIFT demonstrate great discriminative power in solving
vision pro... | Image Retrieval based on Bag-of-Words model | 2,013 | http://arxiv.org/pdf/1304.5168v1 | Title Image Retrieval based BagofWords model Summary article give survey bagofwords BoW bagoffeatures model image retrieval system recent year largescale image retrieval show significant potential industry application research problem local descriptor like SIFT demonstrate great discriminative power solving vision prob... | [0.03355765715241432, 0.006209368817508221, 0.015437208116054535, 0.0559346042573452, -0.022280246019363403, 0.008382871747016907, 0.010226242244243622, 0.07734803855419159, 0.02126234769821167, -0.053723689168691635, 0.017564138397574425, 0.008907069452106953, -0.0395185612142086, 0.0575808510184288, -0.01026826724410... |
40,534 | 40,534 | ['Rami Abousleiman', 'Guangzhi Qu', 'Osamah Rawashdeh'] | 1304.7851v2 | The North Atlantic right whale (Eubalaena glacialis) is an endangered
species. These whales continuously suffer from deadly vessel impacts alongside
the eastern coast of North America. There have been countless efforts to save
the remaining 350 - 400 of them. One of the most prominent works is done by
Marinexplore and ... | North Atlantic Right Whale Contact Call Detection | 2,013 | http://arxiv.org/pdf/1304.7851v2 | Title North Atlantic Right Whale Contact Call Detection Summary North Atlantic right whale Eubalaena glacialis endangered specie whale continuously suffer deadly vessel impact alongside eastern coast North America countless effort save remaining 350 400 One prominent work done Marinexplore Cornell University system hyd... | [0.01751120761036873, 0.06920649111270905, -0.028089627623558044, -0.03919942304491997, 0.03211040794849396, 0.038661107420921326, 0.012041755020618439, 0.011163006536662579, -0.04414597153663635, -0.053507328033447266, -0.022613264620304108, 0.02521703951060772, 0.04146800935268402, 0.022461796179413795, -0.0075330748... |
40,535 | 40,535 | ['Aleksandrs Slivkins'] | 1306.0155v1 | We consider an application of multi-armed bandits to internet advertising
(specifically, to dynamic ad allocation in the pay-per-click model, with
uncertainty on the click probabilities). We focus on an important practical
issue that advertisers are constrained in how much money they can spend on
their ad campaigns. Th... | Dynamic Ad Allocation: Bandits with Budgets | 2,013 | http://arxiv.org/pdf/1306.0155v1 | Title Dynamic Ad Allocation Bandits Budgets Summary consider application multiarmed bandit internet advertising specifically dynamic ad allocation payperclick model uncertainty click probability focus important practical issue advertiser constrained much money spend ad campaign issue considered prior work banditbased a... | [0.06592494249343872, 0.042505376040935516, -0.03081665188074112, -0.07167617976665497, 0.008459684439003468, -0.03762124478816986, 0.02816993184387684, -0.012552228756248951, -0.00460441317409277, -0.04229958355426788, -0.028953485190868378, -0.04189458116889, -0.0351698100566864, 0.08391334116458893, 0.00755072478204... |
40,536 | 40,536 | ['Marina Danilevsky', 'Chi Wang', 'Nihit Desai', 'Jingyi Guo', 'Jiawei Han'] | 1306.0271v1 | We introduce KERT (Keyphrase Extraction and Ranking by Topic), a framework
for topical keyphrase generation and ranking. By shifting from the
unigram-centric traditional methods of unsupervised keyphrase extraction to a
phrase-centric approach, we are able to directly compare and rank phrases of
different lengths. We c... | KERT: Automatic Extraction and Ranking of Topical Keyphrases from
Content-Representative Document Titles | 2,013 | http://arxiv.org/pdf/1306.0271v1 | Title KERT Automatic Extraction Ranking Topical Keyphrases ContentRepresentative Document Titles Summary introduce KERT Keyphrase Extraction Ranking Topic framework topical keyphrase generation ranking shifting unigramcentric traditional method unsupervised keyphrase extraction phrasecentric approach able directly comp... | [0.07744073122739792, -0.015339476056396961, -0.022575434297323227, 0.0005857402575202286, -0.03937961533665657, 0.011276140809059143, 0.0292917862534523, 0.023563673719763756, 0.0008438429213128984, -0.04994796961545944, 0.013494095765054226, 0.058537885546684265, 0.0057024587877094746, 0.057303693145513535, -0.003851... |
40,537 | 40,537 | ['Uri Kartoun'] | 1306.0541v1 | The paper presents a time-series-based classification approach to identify
similarities in pairs of simulated human-generated patterns. An example for a
pattern is a time-series representing a heart rate during a specific
time-range, wherein the time-series is a sequence of data points that represent
the changes in the... | Identifying Pairs in Simulated Bio-Medical Time-Series | 2,013 | http://arxiv.org/pdf/1306.0541v1 | Title Identifying Pairs Simulated BioMedical TimeSeries Summary paper present timeseriesbased classification approach identify similarity pair simulated humangenerated pattern example pattern timeseries representing heart rate specific timerange wherein timeseries sequence data point represent change heart rate value b... | [-0.033926818519830704, 0.01321318931877613, -0.04818198084831238, -0.040026113390922546, -0.0336187370121479, 0.008227603510022163, 0.030654489994049072, 0.05741054192185402, -0.0037763018626719713, 0.021910427138209343, 0.033914338797330856, -0.0056370096281170845, 0.02820969931781292, 0.056458353996276855, -0.013969... |
40,538 | 40,538 | ['Munther Abualkibash', 'Ahmed ElSayed', 'Ausif Mahmood'] | 1306.1467v1 | AdaBoost is an important algorithm in machine learning and is being widely
used in object detection. AdaBoost works by iteratively selecting the best
amongst weak classifiers, and then combines several weak classifiers to obtain
a strong classifier. Even though AdaBoost has proven to be very effective, its
learning exe... | Highly Scalable, Parallel and Distributed AdaBoost Algorithm using Light
Weight Threads and Web Services on a Network of Multi-Core Machines | 2,013 | http://arxiv.org/pdf/1306.1467v1 | Title Highly Scalable Parallel Distributed AdaBoost Algorithm using Light Weight Threads Web Services Network MultiCore Machines Summary AdaBoost important algorithm machine learning widely used object detection AdaBoost work iteratively selecting best amongst weak classifier combine several weak classifier obtain stro... | [-0.020577240735292435, -0.01793212629854679, -0.017669038847088814, 0.02355971746146679, 0.0009952974505722523, 0.03504246473312378, 0.04536261782050133, 0.027165869250893593, 0.03911958262324333, -0.04637344181537628, 0.008026575669646263, -0.008088751696050167, -0.001224119565449655, 0.026093121618032455, -0.0167577... |
40,539 | 40,539 | ['Kiyana Zolfaghar', 'Nele Verbiest', 'Jayshree Agarwal', 'Naren Meadem', 'Si-Chi Chin', 'Senjuti Basu Roy', 'Ankur Teredesai', 'David Hazel', 'Paul Amoroso', 'Lester Reed'] | 1306.2094v1 | Mitigating risk-of-readmission of Congestive Heart Failure (CHF) patients
within 30 days of discharge is important because such readmissions are not only
expensive but also critical indicator of provider care and quality of
treatment. Accurately predicting the risk-of-readmission may allow hospitals to
identify high-ri... | Predicting Risk-of-Readmission for Congestive Heart Failure Patients: A
Multi-Layer Approach | 2,013 | http://arxiv.org/pdf/1306.2094v1 | Title Predicting RiskofReadmission Congestive Heart Failure Patients MultiLayer Approach Summary Mitigating riskofreadmission Congestive Heart Failure CHF patient within 30 day discharge important readmission expensive also critical indicator provider care quality treatment Accurately predicting riskofreadmission may a... | [-0.007240136153995991, 0.005292464047670364, -0.023636823520064354, -0.057679470628499985, 0.015010968782007694, 0.009371825493872166, 0.03836749494075775, 0.002671446418389678, 0.02266484871506691, 0.027414459735155106, 0.06402693688869476, -0.024306105449795723, 0.025660984218120575, 0.0320698618888855, -0.006447419... |
40,540 | 40,540 | ['E. N. Sathishkumar', 'K. Thangavel', 'T. Chandrasekhar'] | 1306.2118v1 | We extend the standard rough set-based approach to deal with huge amounts of
numeric attributes versus small amount of available objects. Here, a novel
approach of clustering along with dimensionality reduction; Hybrid Fuzzy C
Means-Quick Reduct (FCMQR) algorithm is proposed for single gene selection.
Gene selection is... | A Novel Approach for Single Gene Selection Using Clustering and
Dimensionality Reduction | 2,013 | http://arxiv.org/pdf/1306.2118v1 | Title Novel Approach Single Gene Selection Using Clustering Dimensionality Reduction Summary extend standard rough setbased approach deal huge amount numeric attribute versus small amount available object novel approach clustering along dimensionality reduction Hybrid Fuzzy C MeansQuick Reduct FCMQR algorithm proposed ... | [-0.015683623030781746, 0.037801798433065414, -0.06341832131147385, -0.015194571577012539, -0.017401203513145447, 0.032554078847169876, 0.08914054930210114, 0.0571579709649086, 0.04462077468633652, 0.01577116921544075, 0.0735616460442543, 0.028621861711144447, 0.015277151949703693, -0.0050374181009829044, 0.00699446210... |
40,541 | 40,541 | ['Guoqiang Zhong', 'Mohamed Cheriet'] | 1306.2663v1 | Other than vector representations, the direct objects of human cognition are
generally high-order tensors, such as 2D images and 3D textures. From this
fact, two interesting questions naturally arise: How does the human brain
represent these tensor perceptions in a "manifold" way, and how can they be
recognized on the ... | Large Margin Low Rank Tensor Analysis | 2,013 | http://arxiv.org/pdf/1306.2663v1 | Title Large Margin Low Rank Tensor Analysis Summary vector representation direct object human cognition generally highorder tensor 2D image 3D texture fact two interesting question naturally arise human brain represent tensor perception manifold way recognized manifold paper present supervised model learn intrinsic str... | [-0.01312856376171112, 0.008436097763478756, -0.026101181283593178, 0.04572521895170212, -0.004310741554945707, 0.06184489652514458, 0.04025770351290703, 0.03099670633673668, 0.03631086274981499, -0.0003798453835770488, -0.030281830579042435, -0.023829851299524307, 0.016241878271102905, -0.002555807586759329, 0.0629407... |
40,542 | 40,542 | ['B. Mishra', 'R. Sepulchre'] | 1306.2672v2 | We exploit the versatile framework of Riemannian optimization on quotient
manifolds to develop R3MC, a nonlinear conjugate-gradient method for low-rank
matrix completion. The underlying search space of fixed-rank matrices is
endowed with a novel Riemannian metric that is tailored to the least-squares
cost. Numerical co... | R3MC: A Riemannian three-factor algorithm for low-rank matrix completion | 2,013 | http://arxiv.org/pdf/1306.2672v2 | Title R3MC Riemannian threefactor algorithm lowrank matrix completion Summary exploit versatile framework Riemannian optimization quotient manifold develop R3MC nonlinear conjugategradient method lowrank matrix completion underlying search space fixedrank matrix endowed novel Riemannian metric tailored leastsquares cos... | [0.03727960214018822, 0.03324487805366516, 0.031223371624946594, 0.018054598942399025, 0.029332399368286133, -0.004496040288358927, -0.05504288896918297, 0.028129201382398605, 0.051877569407224655, 0.027102960273623466, -0.014630625955760479, -0.00028477521846070886, 0.056117668747901917, -0.021774988621473312, -0.0043... |
40,543 | 40,543 | ['Sudipto Guha', 'Kamesh Munagala'] | 1306.3525v2 | In this paper, we consider several finite-horizon Bayesian multi-armed bandit
problems with side constraints which are computationally intractable (NP-Hard)
and for which no optimal (or near optimal) algorithms are known to exist with
sub-exponential running time. All of these problems violate the standard
exchange pro... | Approximation Algorithms for Bayesian Multi-Armed Bandit Problems | 2,013 | http://arxiv.org/pdf/1306.3525v2 | Title Approximation Algorithms Bayesian MultiArmed Bandit Problems Summary paper consider several finitehorizon Bayesian multiarmed bandit problem side constraint computationally intractable NPHard optimal near optimal algorithm known exist subexponential running time problem violate standard exchange property assumes ... | [-0.001519938581623137, 0.024292510002851486, -0.004495494067668915, -0.03787628933787346, -0.025138648226857185, -0.013913615606725216, -0.00709216995164752, 0.03406977280974388, -0.013726779259741306, 0.0014902115799486637, -0.038477085530757904, 0.01106543280184269, -0.04127714782953262, 0.00657456973567605, 0.00780... |
40,544 | 40,544 | ['Huahua Wang', 'Arindam Banerjee'] | 1306.3721v2 | Online optimization has emerged as powerful tool in large scale optimization.
In this pa- per, we introduce efficient online optimization algorithms based on
the alternating direction method (ADM), which can solve online convex
optimization under linear constraints where the objective could be non-smooth.
We introduce ... | Online Alternating Direction Method (longer version) | 2,013 | http://arxiv.org/pdf/1306.3721v2 | Title Online Alternating Direction Method longer version Summary Online optimization emerged powerful tool large scale optimization pa per introduce efficient online optimization algorithm based alternating direction method ADM solve online convex optimization linear constraint objective could nonsmooth introduce new p... | [-0.02695453353226185, 0.051341354846954346, -0.004009578842669725, -0.02091202139854431, -0.015904469415545464, -0.0342288464307785, 0.006778797600418329, -0.023130815476179123, -0.010411330498754978, 0.005700125824660063, 0.0034026051871478558, -0.02853068709373474, -0.003528041299432516, 0.05744919180870056, 0.00485... |
40,545 | 40,545 | ['Peter Sarlin', 'Samuel Rönnqvist'] | 1306.3860v1 | This paper takes an information visualization perspective to visual
representations in the general SOM paradigm. This involves viewing SOM-based
visualizations through the eyes of Bertin's and Tufte's theories on data
graphics. The regular grid shape of the Self-Organizing Map (SOM), while being
a virtue for linking vi... | Cluster coloring of the Self-Organizing Map: An information
visualization perspective | 2,013 | http://arxiv.org/pdf/1306.3860v1 | Title Cluster coloring SelfOrganizing Map information visualization perspective Summary paper take information visualization perspective visual representation general SOM paradigm involves viewing SOMbased visualization eye Bertins Tuftes theory data graphic regular grid shape SelfOrganizing Map SOM virtue linking visu... | [-0.053234390914440155, 0.0032906015403568745, -0.03575795888900757, 0.008676453493535519, 0.002276625484228134, 0.007480278145521879, 0.0495477057993412, 0.0004183838318567723, 0.03684726729989052, 0.031026501208543777, -0.04252233728766441, 0.09190113842487335, 0.01388021744787693, 0.01407534908503294, 0.003388728946... |
40,546 | 40,546 | ['An Bian', 'Xiong Li', 'Yuncai Liu', 'Ming-Hsuan Yang'] | 1306.4080v4 | The recent years have witnessed advances in parallel algorithms for large
scale optimization problems. Notwithstanding demonstrated success, existing
algorithms that parallelize over features are usually limited by divergence
issues under high parallelism or require data preprocessing to alleviate these
problems. In th... | Parallel Coordinate Descent Newton Method for Efficient
$\ell_1$-Regularized Minimization | 2,013 | http://arxiv.org/pdf/1306.4080v4 | Title Parallel Coordinate Descent Newton Method Efficient ell1Regularized Minimization Summary recent year witnessed advance parallel algorithm large scale optimization problem Notwithstanding demonstrated success existing algorithm parallelize feature usually limited divergence issue high parallelism require data prep... | [-0.030086476355791092, 0.04530581086874008, -0.02558824047446251, 0.041539061814546585, -0.00472935801371932, 0.002932616975158453, 0.06619363278150558, -0.01286949310451746, -0.03168097138404846, 0.004646987188607454, 0.043116603046655655, 0.018544789403676987, 0.024947836995124817, -0.01588134653866291, -0.039708886... |
40,547 | 40,547 | ['Sumit Goswami', 'Mayank Singh Shishodia'] | 1306.4633v1 | Fuzzy logic deals with degrees of truth. In this paper, we have shown how to
apply fuzzy logic in text mining in order to perform document clustering. We
took an example of document clustering where the documents had to be clustered
into two categories. The method involved cleaning up the text and stemming of
words. Th... | A Fuzzy Based Approach to Text Mining and Document Clustering | 2,013 | http://arxiv.org/pdf/1306.4633v1 | Title Fuzzy Based Approach Text Mining Document Clustering Summary Fuzzy logic deal degree truth paper shown apply fuzzy logic text mining order perform document clustering took example document clustering document clustered two category method involved cleaning text stemming word chose number feature differ significan... | [0.011140639893710613, -0.030188264325261116, -0.050049979239702225, 0.006859514396637678, -0.02102700248360634, 0.0006738764932379127, -0.012489521875977516, 0.04531959816813469, 0.030933158472180367, -0.03853463754057884, 0.022925982251763344, 0.05258285999298096, 0.047359153628349304, -0.019602209329605103, -0.01315... |
40,548 | 40,548 | ['Radim Belohlavek', 'Martin Trnecka'] | 1306.4905v1 | We present new results on Boolean matrix factorization and a new algorithm
based on these results. The results emphasize the significance of
factorizations that provide from-below approximations of the input matrix.
While the previously proposed algorithms do not consider the possibly different
significance of differen... | From-Below Approximations in Boolean Matrix Factorization: Geometry and
New Algorithm | 2,013 | http://arxiv.org/pdf/1306.4905v1 | Title FromBelow Approximations Boolean Matrix Factorization Geometry New Algorithm Summary present new result Boolean matrix factorization new algorithm based result result emphasize significance factorization provide frombelow approximation input matrix previously proposed algorithm consider possibly different signifi... | [-0.048890747129917145, -0.017493918538093567, -0.04875136911869049, 0.024611975997686386, -0.025318244472146034, -0.011500393971800804, 0.06071304529905319, 0.011198578402400017, -0.023797348141670227, 0.014743614941835403, 0.061896804720163345, 0.06311383843421936, 0.05349346995353699, 0.08246349543333054, -0.0258312... |
40,549 | 40,549 | ['Nir Ailon', 'Mehryar Mohri'] | 0710.2889v2 | This paper describes an efficient reduction of the learning problem of
ranking to binary classification. The reduction guarantees an average pairwise
misranking regret of at most that of the binary classifier regret, improving a
recent result of Balcan et al which only guarantees a factor of 2. Moreover,
our reduction ... | An efficient reduction of ranking to classification | 2,007 | http://arxiv.org/pdf/0710.2889v2 | Title efficient reduction ranking classification Summary paper describes efficient reduction learning problem ranking binary classification reduction guarantee average pairwise misranking regret binary classifier regret improving recent result Balcan et al guarantee factor 2 Moreover reduction applies broader class ran... | [-0.0024763764813542366, 0.030878223478794098, -0.01544097624719143, 0.027395382523536682, -0.005162136163562536, -0.013755304738879204, 0.0027574694249778986, 0.021947966888546944, 0.03966595232486725, -0.04275768995285034, -0.023283904418349266, 0.04110220819711685, -0.004983637016266584, 0.0005360005307011306, -0.04... |
40,550 | 40,550 | ['Dev Rajnarayan', 'David Wolpert'] | 0810.0877v1 | In this paper, we examine the CE method in the broad context of Monte Carlo
Optimization (MCO) and Parametric Learning (PL), a type of machine learning. A
well-known overarching principle used to improve the performance of many PL
algorithms is the bias-variance tradeoff. This tradeoff has been used to
improve PL algor... | Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation
for the CE Method | 2,008 | http://arxiv.org/pdf/0810.0877v1 | Title BiasVariance Techniques Monte Carlo Optimization Crossvalidation CE Method Summary paper examine CE method broad context Monte Carlo Optimization MCO Parametric Learning PL type machine learning wellknown overarching principle used improve performance many PL algorithm biasvariance tradeoff tradeoff used improve ... | [-0.0180228129029274, -0.0007563043036498129, -0.023768780753016472, -0.011033621616661549, 0.019885364919900894, -0.01915842480957508, 0.03705586493015289, 0.038528140634298325, 0.012448343448340893, 0.005005483981221914, 0.008443606086075306, 0.045210957527160645, 0.04688160866498947, -0.04519105702638626, 0.00812187... |
40,551 | 40,551 | ['Omar Mehanna', 'Ahmed Sultan', 'Hesham El Gamal'] | 0810.1430v1 | We consider the design of cognitive Medium Access Control (MAC) protocols
enabling an unlicensed (secondary) transmitter-receiver pair to communicate
over the idle periods of a set of licensed channels, i.e., the primary network.
The objective is to maximize data throughput while maintaining the
synchronization between... | Blind Cognitive MAC Protocols | 2,008 | http://arxiv.org/pdf/0810.1430v1 | Title Blind Cognitive MAC Protocols Summary consider design cognitive Medium Access Control MAC protocol enabling unlicensed secondary transmitterreceiver pair communicate idle period set licensed channel ie primary network objective maximize data throughput maintaining synchronization secondary user avoiding interfere... | [-0.04277150705456734, 0.011317020282149315, 0.009561115875840187, -0.048743076622486115, -0.05371557176113129, -0.022219672799110413, -0.02741030417382717, 0.0031638327054679394, 0.005328529514372349, -0.02505956031382084, -0.025606373324990273, 0.044697754085063934, -0.007434394210577011, 0.024592142552137375, -0.008... |
40,552 | 40,552 | ['Nir Ailon'] | 0810.2764v1 | The LETOR website contains three information retrieval datasets used as a
benchmark for testing machine learning ideas for ranking. Algorithms
participating in the challenge are required to assign score values to search
results for a collection of queries, and are measured using standard IR ranking
measures (NDCG, prec... | A Simple Linear Ranking Algorithm Using Query Dependent Intercept
Variables | 2,008 | http://arxiv.org/pdf/0810.2764v1 | Title Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables Summary LETOR website contains three information retrieval datasets used benchmark testing machine learning idea ranking Algorithms participating challenge required assign score value search result collection query measured using standard I... | [0.015464811585843563, 0.04464423656463623, -0.031032683327794075, -0.01561696082353592, 0.022333424538373947, 0.01567869819700718, 0.014889342710375786, 0.0184719767421484, 0.06474267691373825, -0.06456004828214645, -0.015644965693354607, 0.03018501028418541, -0.008599051274359226, 0.0477600023150444, -0.0178104750812... |
40,553 | 40,553 | ['Barbara Hammer', 'Alexander Hasenfuß', 'Fabrice Rossi'] | 0909.0638v1 | Median clustering extends popular neural data analysis methods such as the
self-organizing map or neural gas to general data structures given by a
dissimilarity matrix only. This offers flexible and robust global data
inspection methods which are particularly suited for a variety of data as
occurs in biomedical domains... | Median topographic maps for biomedical data sets | 2,009 | http://arxiv.org/pdf/0909.0638v1 | Title Median topographic map biomedical data set Summary Median clustering extends popular neural data analysis method selforganizing map neural gas general data structure given dissimilarity matrix offer flexible robust global data inspection method particularly suited variety data occurs biomedical domain chapter giv... | [-0.01303925458341837, -0.025741061195731163, -0.05598577484488487, 0.004705770406872034, 0.013110506348311901, 0.030037209391593933, 0.03153739497065544, 0.030976535752415657, 0.006725549232214689, 0.03527587279677391, 0.013210621662437916, -0.058681029826402664, 0.026022279635071754, -0.002915631514042616, 0.01512225... |
40,554 | 40,554 | ['Laure Berti-Equille', 'Anish Das Sarma', 'Xin', 'Dong', 'Amelie Marian', 'Divesh Srivastava'] | 0909.1776v1 | The Web has enabled the availability of a huge amount of useful information,
but has also eased the ability to spread false information and rumors across
multiple sources, making it hard to distinguish between what is true and what
is not. Recent examples include the premature Steve Jobs obituary, the second
bankruptcy... | Sailing the Information Ocean with Awareness of Currents: Discovery and
Application of Source Dependence | 2,009 | http://arxiv.org/pdf/0909.1776v1 | Title Sailing Information Ocean Awareness Currents Discovery Application Source Dependence Summary Web enabled availability huge amount useful information also eased ability spread false information rumor across multiple source making hard distinguish true Recent example include premature Steve Jobs obituary second ban... | [0.03068949282169342, 0.07921994477510452, -0.019842253997921944, -0.028879866003990173, -0.0487246997654438, -0.01633930578827858, 0.048578131943941116, 0.03289419785141945, 0.006658266298472881, -0.044955167919397354, 0.016412336379289627, 0.02467702142894268, 0.018943561241030693, 0.07999381422996521, -0.04091501608... |
40,555 | 40,555 | ['Vitaly Feldman'] | 0909.2927v1 | We consider the problem of boosting the accuracy of weak learning algorithms
in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992).
Known algorithms for this problem (Ben-David et al., 2001; Gavinsky, 2002;
Kalai et al., 2008) follow the same strategy as boosting algorithms in the PAC
model: th... | Distribution-Specific Agnostic Boosting | 2,009 | http://arxiv.org/pdf/0909.2927v1 | Title DistributionSpecific Agnostic Boosting Summary consider problem boosting accuracy weak learning algorithm agnostic learning framework Haussler 1992 Kearns et al 1992 Known algorithm problem BenDavid et al 2001 Gavinsky 2002 Kalai et al 2008 follow strategy boosting algorithm PAC model weak learner executed target... | [-0.05243123322725296, 0.05108794942498207, 0.0026477654464542866, -0.002771994797512889, -0.009207441471517086, -0.048029303550720215, -0.00439096475020051, 0.02857935056090355, -0.06683926284313202, -0.006493738386780024, 0.029804393649101257, 0.011956808157265186, 0.0057716709561645985, 0.07013380527496338, 0.009599... |
40,556 | 40,556 | ['Prahladh Harsha', 'Adam Klivans', 'Raghu Meka'] | 0909.5175v4 | We give the first non-trivial upper bounds on the average sensitivity and
noise sensitivity of polynomial threshold functions. More specifically, for a
Boolean function f on n variables equal to the sign of a real, multivariate
polynomial of total degree d we prove
1) The average sensitivity of f is at most O(n^{1-1/... | Bounding the Sensitivity of Polynomial Threshold Functions | 2,009 | http://arxiv.org/pdf/0909.5175v4 | Title Bounding Sensitivity Polynomial Threshold Functions Summary give first nontrivial upper bound average sensitivity noise sensitivity polynomial threshold function specifically Boolean function f n variable equal sign real multivariate polynomial total degree prove 1 average sensitivity f On114d6 also give combinat... | [-0.0954098254442215, 0.007409115321934223, -0.02328428626060486, 0.03325900807976723, 0.0005668032681569457, -0.026422793045639992, 0.0239508505910635, -0.014700226485729218, 0.016340024769306183, -0.0098295072093606, 0.026747964322566986, 0.04693956300616264, -0.02410968951880932, 0.06598447263240814, -0.026375308632... |
40,557 | 40,557 | ['Natalia B. Janson', 'Christopher J. Marsden'] | 1107.0674v3 | We propose an alternative approach to construct an artificial learning
system, which naturally learns in an unsupervised manner. Its mathematical
prototype is a dynamical system, which automatically shapes its vector field in
response to the input signal. The vector field converges to a gradient of a
multi-dimensional ... | "Memory foam" approach to unsupervised learning | 2,011 | http://arxiv.org/pdf/1107.0674v3 | Title Memory foam approach unsupervised learning Summary propose alternative approach construct artificial learning system naturally learns unsupervised manner mathematical prototype dynamical system automatically shape vector field response input signal vector field converges gradient multidimensional probability dens... | [-0.04835788905620575, -0.0039457413367927074, -0.035873204469680786, -7.620686665177345e-05, -0.008316803723573685, -0.04124770313501358, 0.01951499655842781, -0.008734975010156631, -0.03990660235285759, 0.04339568316936493, -0.006893483456224203, 0.007636201102286577, -0.006929332390427589, 0.04931671917438507, 0.026... |
40,558 | 40,558 | ['Shalev Ben-David', 'Lev Reyzin'] | 1107.2379v5 | We consider the model introduced by Bilu and Linial (2010), who study
problems for which the optimal clustering does not change when distances are
perturbed. They show that even when a problem is NP-hard, it is sometimes
possible to obtain efficient algorithms for instances resilient to certain
multiplicative perturbat... | Data Stability in Clustering: A Closer Look | 2,011 | http://arxiv.org/pdf/1107.2379v5 | Title Data Stability Clustering Closer Look Summary consider model introduced Bilu Linial 2010 study problem optimal clustering change distance perturbed show even problem NPhard sometimes possible obtain efficient algorithm instance resilient certain multiplicative perturbation eg order Osqrtn maxcut clustering Awasth... | [-0.06040188670158386, -0.010612626560032368, -0.033688731491565704, -0.017667856067419052, 0.004086358938366175, -0.03444294258952141, -0.007579537108540535, 0.019404662773013115, -0.01079876534640789, 0.0032477136701345444, 0.025861529633402824, 0.015340637415647507, -0.022591078653931618, 0.01096390001475811, -0.022... |
40,559 | 40,559 | ['Moritz Hardt', 'Guy N. Rothblum', 'Rocco A. Servedio'] | 1107.2444v1 | This work considers computationally efficient privacy-preserving data
release. We study the task of analyzing a database containing sensitive
information about individual participants. Given a set of statistical queries
on the data, we want to release approximate answers to the queries while also
guaranteeing different... | Private Data Release via Learning Thresholds | 2,011 | http://arxiv.org/pdf/1107.2444v1 | Title Private Data Release via Learning Thresholds Summary work considers computationally efficient privacypreserving data release study task analyzing database containing sensitive information individual participant Given set statistical query data want release approximate answer query also guaranteeing differential p... | [-0.02293570153415203, 0.11268457025289536, -0.04038812592625618, 0.03342091292142868, -0.03727922961115837, -0.0418853722512722, 0.05555300787091255, -0.016690997406840324, 0.005520952399820089, 0.05024070292711258, 0.005215880926698446, 0.013172555714845657, -0.020722955465316772, 0.06755504012107849, -0.049378294497... |
40,560 | 40,560 | ['Cem Tekin', 'Mingyan Liu'] | 1107.4042v3 | In this paper we consider the problem of learning the optimal policy for
uncontrolled restless bandit problems. In an uncontrolled restless bandit
problem, there is a finite set of arms, each of which when pulled yields a
positive reward. There is a player who sequentially selects one of the arms at
each time step. The... | Optimal Adaptive Learning in Uncontrolled Restless Bandit Problems | 2,011 | http://arxiv.org/pdf/1107.4042v3 | Title Optimal Adaptive Learning Uncontrolled Restless Bandit Problems Summary paper consider problem learning optimal policy uncontrolled restless bandit problem uncontrolled restless bandit problem finite set arm pulled yield positive reward player sequentially selects one arm time step goal player maximize undiscount... | [-0.018138518556952477, 0.01950143836438656, -0.00023229478392750025, -0.04689545929431915, 0.009580551646649837, 0.00302061066031456, -0.02586354687809944, 0.030193006619811058, -0.024679509922862053, -0.01024720724672079, 0.009138932451605797, 0.040470190346241, -0.06576757878065109, -0.0034520747140049934, 0.0032911... |
40,561 | 40,561 | ['Cem Tekin', 'Mingyan Liu'] | 1107.4153v1 | We study the problem of allocating multiple users to a set of wireless
channels in a decentralized manner when the channel quali- ties are
time-varying and unknown to the users, and accessing the same channel by
multiple users leads to reduced quality due to interference. In such a setting
the users not only need to le... | Performance and Convergence of Multi-user Online Learning | 2,011 | http://arxiv.org/pdf/1107.4153v1 | Title Performance Convergence Multiuser Online Learning Summary study problem allocating multiple user set wireless channel decentralized manner channel quali tie timevarying unknown user accessing channel multiple user lead reduced quality due interference setting user need learn inherent channel quality time best all... | [0.006412604358047247, -0.00685839680954814, -0.018063856288790703, -0.05273253470659256, -0.02940223552286625, -0.027210433036088943, 0.052487507462501526, -0.031595148146152496, -0.03633590415120125, -0.018512319773435593, -0.0009975646389648318, 0.02545742690563202, -0.023026078939437866, 0.0005301390192471445, -0.0... |
40,562 | 40,562 | ['Bin Yang', 'Manohar Kaul', 'Christian S. Jensen'] | 1308.0484v2 | We are witnessing increasing interests in the effective use of road networks.
For example, to enable effective vehicle routing, weighted-graph models of
transportation networks are used, where the weight of an edge captures some
cost associated with traversing the edge, e.g., greenhouse gas (GHG) emissions
or travel ti... | Using Incomplete Information for Complete Weight Annotation of Road
Networks -- Extended Version | 2,013 | http://arxiv.org/pdf/1308.0484v2 | Title Using Incomplete Information Complete Weight Annotation Road Networks Extended Version Summary witnessing increasing interest effective use road network example enable effective vehicle routing weightedgraph model transportation network used weight edge capture cost associated traversing edge eg greenhouse gas GH... | [0.000518434215337038, 0.07075861841440201, -0.027200251817703247, 0.006896170321851969, -0.020292436704039574, -0.027530454099178314, 0.03619689494371414, 0.0022630393505096436, -0.02496631257236004, -0.04408511519432068, 0.10394570231437683, 0.04095079377293587, -0.008358469232916832, 0.057944077998399734, 0.02893115... |
40,563 | 40,563 | ['Ibrahim Sabek', 'Moustafa Youssef'] | 1308.0768v1 | Device-free (DF) localization is an emerging technology that allows the
detection and tracking of entities that do not carry any devices nor
participate actively in the localization process. Typically, DF systems require
a large number of transmitters and receivers to achieve acceptable accuracy,
which is not available... | MonoStream: A Minimal-Hardware High Accuracy Device-free WLAN
Localization System | 2,013 | http://arxiv.org/pdf/1308.0768v1 | Title MonoStream MinimalHardware High Accuracy Devicefree WLAN Localization System Summary Devicefree DF localization emerging technology allows detection tracking entity carry device participate actively localization process Typically DF system require large number transmitter receiver achieve acceptable accuracy avai... | [-0.01658228039741516, -0.03223137557506561, 0.02454759180545807, -0.05127699300646782, -0.04538963362574577, 0.0006878644344396889, 0.06296417862176895, -0.02067403867840767, -0.00982116349041462, -0.027491485700011253, 0.04349096119403839, 0.019006837159395218, 0.0335182324051857, 0.0243130624294281, 0.00587384495884... |
40,564 | 40,564 | ['Jeff Shrager'] | 1308.1066v1 | Adaptive trials are now mainstream science. Recently, researchers have taken
the adaptive trial concept to its natural conclusion, proposing what we call
"Global Cumulative Treatment Analysis" (GCTA). Similar to the adaptive trial,
decision making and data collection and analysis in the GCTA are continuous and
integrat... | Theoretical Issues for Global Cumulative Treatment Analysis (GCTA) | 2,013 | http://arxiv.org/pdf/1308.1066v1 | Title Theoretical Issues Global Cumulative Treatment Analysis GCTA Summary Adaptive trial mainstream science Recently researcher taken adaptive trial concept natural conclusion proposing call Global Cumulative Treatment Analysis GCTA Similar adaptive trial decision making data collection analysis GCTA continuous integr... | [0.04693889990448952, 0.02756294049322605, -0.019078847020864487, -0.08170562237501144, 0.01304059661924839, 0.015563363209366798, 0.05977760627865791, 0.010161353275179863, 0.014978239312767982, 0.013356964103877544, 0.05380336195230484, -0.03362307697534561, -0.03318587318062782, 0.0481780543923378, 0.006251569371670... |
40,565 | 40,565 | ['Michal Aharon', 'Natalie Aizenberg', 'Edward Bortnikov', 'Ronny Lempel', 'Roi Adadi', 'Tomer Benyamini', 'Liron Levin', 'Ran Roth', 'Ohad Serfaty'] | 1308.1792v1 | One of the most challenging recommendation tasks is recommending to a new,
previously unseen user. This is known as the 'user cold start' problem.
Assuming certain features or attributes of users are known, one approach for
handling new users is to initially model them based on their features.
Motivated by an ad targ... | OFF-Set: One-pass Factorization of Feature Sets for Online
Recommendation in Persistent Cold Start Settings | 2,013 | http://arxiv.org/pdf/1308.1792v1 | Title OFFSet Onepass Factorization Feature Sets Online Recommendation Persistent Cold Start Settings Summary One challenging recommendation task recommending new previously unseen user known user cold start problem Assuming certain feature attribute user known one approach handling new user initially model based featur... | [0.034689273685216904, 0.02178322896361351, -0.0010926139075309038, -0.03879596292972565, 0.02728884108364582, -0.01162137370556593, 0.03814912587404251, -0.01717694103717804, -0.0034535792656242847, -0.03243696317076683, -0.02262166514992714, -0.03502653166651726, -0.01970280520617962, 0.12635721266269684, -0.02539772... |
40,566 | 40,566 | ['Andrew R. Cohen', 'P. M. B. Vitanyi'] | 1308.3177v1 | Normalized Google distance (NGD) is a relative semantic distance based on the
World Wide Web (or any other large electronic database, for instance Wikipedia)
and a search engine that returns aggregate page counts. The earlier NGD between
pairs of search terms (including phrases) is not sufficient for all
applications. ... | Normalized Google Distance of Multisets with Applications | 2,013 | http://arxiv.org/pdf/1308.3177v1 | Title Normalized Google Distance Multisets Applications Summary Normalized Google distance NGD relative semantic distance based World Wide Web large electronic database instance Wikipedia search engine return aggregate page count earlier NGD pair search term including phrase sufficient application propose NGD finite mu... | [-0.003526699496433139, 0.04202672839164734, -0.03809216991066933, 0.009240356273949146, -0.06527110189199448, -0.03365016728639603, 0.0502312034368515, 0.05385586619377136, -0.025409352034330368, -0.03801482915878296, 0.0431826077401638, 0.004843812435865402, -0.0034119109623134136, 0.0006025460315868258, -0.005618500... |
40,567 | 40,567 | ['Leon Wenliang Zhong', 'James T. Kwok'] | 1308.3558v1 | In this paper, we propose a new stochastic alternating direction method of
multipliers (ADMM) algorithm, which incrementally approximates the full
gradient in the linearized ADMM formulation. Besides having a low per-iteration
complexity as existing stochastic ADMM algorithms, the proposed algorithm
improves the conver... | Fast Stochastic Alternating Direction Method of Multipliers | 2,013 | http://arxiv.org/pdf/1308.3558v1 | Title Fast Stochastic Alternating Direction Method Multipliers Summary paper propose new stochastic alternating direction method multiplier ADMM algorithm incrementally approximates full gradient linearized ADMM formulation Besides low periteration complexity existing stochastic ADMM algorithm proposed algorithm improv... | [-0.027536818757653236, 0.021112872287631035, 0.014197850599884987, -0.025315653532743454, 0.01824192702770233, -0.013817127794027328, -0.012790792621672153, -0.04342789575457573, -0.00833034235984087, 0.02939675562083721, 0.015454246662557125, -0.0493474081158638, 0.0063592735677957535, -0.015756849199533463, 0.017452... |
40,568 | 40,568 | ['Lingsong Zhang', 'J. S. Marron', 'Shu Lu'] | 1308.4206v2 | Motivated by the analysis of nonnegative data objects, a novel Nested
Nonnegative Cone Analysis (NNCA) approach is proposed to overcome some
drawbacks of existing methods. The application of traditional PCA/SVD method to
nonnegative data often cause the approximation matrix leave the nonnegative
cone, which leads to no... | Nested Nonnegative Cone Analysis | 2,013 | http://arxiv.org/pdf/1308.4206v2 | Title Nested Nonnegative Cone Analysis Summary Motivated analysis nonnegative data object novel Nested Nonnegative Cone Analysis NNCA approach proposed overcome drawback existing method application traditional PCASVD method nonnegative data often cause approximation matrix leave nonnegative cone lead noninterpretable s... | [-0.05849961191415787, 0.017573051154613495, -0.042856231331825256, 0.06267349421977997, 0.014103725552558899, -0.013568051159381866, 0.02988782338798046, 0.00764035526663065, -0.06103413924574852, 0.010937811806797981, -0.014731330797076225, -0.022790422663092613, 0.013705614022910595, 0.008993546478450298, -0.0188197... |
40,569 | 40,569 | ['Cem Tekin', 'Mihaela van der Schaar'] | 1308.4565v2 | Distributed, online data mining systems have emerged as a result of
applications requiring analysis of large amounts of correlated and
high-dimensional data produced by multiple distributed data sources. We propose
a distributed online data classification framework where data is gathered by
distributed data sources and... | Decentralized Online Big Data Classification - a Bandit Framework | 2,013 | http://arxiv.org/pdf/1308.4565v2 | Title Decentralized Online Big Data Classification Bandit Framework Summary Distributed online data mining system emerged result application requiring analysis large amount correlated highdimensional data produced multiple distributed data source propose distributed online data classification framework data gathered di... | [-0.0075630908831954, 0.06978728622198105, -0.02203996852040291, -0.02756408415734768, -0.005289183463901281, 0.018340175971388817, 0.056203391402959824, 0.004971372429281473, 0.03965851664543152, -0.008860891684889793, -0.002129702130332589, 0.011426125653088093, -0.015925724059343338, 0.061156757175922394, 0.00370151... |
40,570 | 40,570 | ['Babajide Afolabi', 'Odile Thiery'] | cs/0610158v1 | In this paper, our aim is to propose a model that helps in the efficient use
of an information system by users, within the organization represented by the
IS, in order to resolve their decisional problems. In other words we want to
aid the user within an organization in obtaining the information that
corresponds to his... | Considering users' behaviours in improving the responses of an
information base | 2,006 | http://arxiv.org/pdf/cs/0610158v1 | Title Considering user behaviour improving response information base Summary paper aim propose model help efficient use information system user within organization represented order resolve decisional problem word want aid user within organization obtaining information corresponds need informational need result decisio... | [0.06504572927951813, 0.0073564606718719006, -0.031579870730638504, -0.010160064324736595, -0.036304011940956116, -0.025208383798599243, 0.018278708681464195, 0.041172094643116, 0.002647529589012265, -0.05120033770799637, 0.005361950024962425, 0.04227329045534134, -0.02037172205746174, 0.05993805453181267, -0.027524830... |
40,571 | 40,571 | ['David N. Levin'] | cs/0612096v1 | Given a time series of multicomponent measurements of an evolving stimulus,
nonlinear blind source separation (BSS) seeks to find a "source" time series,
comprised of statistically independent combinations of the measured components.
In this paper, we seek a source time series with local velocity cross
correlations tha... | Using state space differential geometry for nonlinear blind source
separation | 2,006 | http://arxiv.org/pdf/cs/0612096v1 | Title Using state space differential geometry nonlinear blind source separation Summary Given time series multicomponent measurement evolving stimulus nonlinear blind source separation BSS seek find source time series comprised statistically independent combination measured component paper seek source time series local... | [-0.03268766775727272, 0.045038748532533646, -0.006858861539512873, 0.03298724442720413, -0.025362053886055946, -0.01331263780593872, 0.03528734669089317, 0.050268203020095825, -0.00559951039031148, 0.004279153887182474, 0.006765918806195259, 0.029945822432637215, 0.031724851578474045, 0.04351959750056267, 0.0028108351... |
40,572 | 40,572 | ['Masahiro Urakami', 'Seiji Miyoshi', 'Masato Okada'] | cs/0612117v1 | In the framework of on-line learning, a learning machine might move around a
teacher due to the differences in structures or output functions between the
teacher and the learning machine. In this paper we analyze the generalization
performance of a new student supervised by a moving machine. A model composed
of a fixed... | Statistical Mechanics of On-line Learning when a Moving Teacher Goes
around an Unlearnable True Teacher | 2,006 | http://arxiv.org/pdf/cs/0612117v1 | Title Statistical Mechanics Online Learning Moving Teacher Goes around Unlearnable True Teacher Summary framework online learning learning machine might move around teacher due difference structure output function teacher learning machine paper analyze generalization performance new student supervised moving machine mo... | [0.03822742775082588, -0.0021037845872342587, -0.03751002624630928, -0.017100714147090912, 0.0017674722475931048, -0.0015050717629492283, 0.027496034279465675, -0.03138023242354393, -0.07028447091579437, -0.006017658859491348, 0.08260170370340347, 0.03726232051849365, -0.01099121943116188, 0.04348098486661911, 0.011345... |
40,573 | 40,573 | ['Bart Kuijpers', 'Vanessa Lemmens', 'Bart Moelans', 'Karl Tuyls'] | 0803.1555v1 | We consider privacy preserving decision tree induction via ID3 in the case
where the training data is horizontally or vertically distributed. Furthermore,
we consider the same problem in the case where the data is both horizontally
and vertically distributed, a situation we refer to as grid partitioned data.
We give an... | Privacy Preserving ID3 over Horizontally, Vertically and Grid
Partitioned Data | 2,008 | http://arxiv.org/pdf/0803.1555v1 | Title Privacy Preserving ID3 Horizontally Vertically Grid Partitioned Data Summary consider privacy preserving decision tree induction via ID3 case training data horizontally vertically distributed Furthermore consider problem case data horizontally vertically distributed situation refer grid partitioned data give algo... | [-0.02186938188970089, 0.06465274840593338, -0.023896807804703712, 0.007932971231639385, -0.04124712198972702, -0.013055076822638512, 0.034486278891563416, -0.027087276801466942, 0.06703199446201324, 0.026384925469756126, -0.01684005744755268, 0.03257887810468674, 0.03094588965177536, 0.004504091572016478, -0.048734888... |
40,574 | 40,574 | ['Stefanie Jegelka', 'Suvrit Sra', 'Arindam Banerjee'] | 0812.0389v4 | In the past few years powerful generalizations to the Euclidean k-means
problem have been made, such as Bregman clustering [7], co-clustering (i.e.,
simultaneous clustering of rows and columns of an input matrix) [9,18], and
tensor clustering [8,34]. Like k-means, these more general problems also suffer
from the NP-har... | Approximation Algorithms for Bregman Co-clustering and Tensor Clustering | 2,008 | http://arxiv.org/pdf/0812.0389v4 | Title Approximation Algorithms Bregman Coclustering Tensor Clustering Summary past year powerful generalization Euclidean kmeans problem made Bregman clustering 7 coclustering ie simultaneous clustering row column input matrix 918 tensor clustering 834 Like kmeans general problem also suffer NPhardness associated optim... | [-0.04563336446881294, -0.0635950043797493, -0.030383793637156487, 0.036995917558670044, -0.055590786039829254, 0.03852684795856476, 0.05106087774038315, 0.05158771201968193, 0.04719838500022888, 0.004513761028647423, 0.01976138725876808, -0.04889467731118202, -0.004500410985201597, 0.007881284691393375, -0.01473907567... |
40,575 | 40,575 | ['Adam Tauman Kalai', 'Shang-Hua Teng'] | 0812.0933v1 | We consider the problem of PAC-learning decision trees, i.e., learning a
decision tree over the n-dimensional hypercube from independent random labeled
examples. Despite significant effort, no polynomial-time algorithm is known for
learning polynomial-sized decision trees (even trees of any super-constant
size), even w... | Decision trees are PAC-learnable from most product distributions: a
smoothed analysis | 2,008 | http://arxiv.org/pdf/0812.0933v1 | Title Decision tree PAClearnable product distribution smoothed analysis Summary consider problem PAClearning decision tree ie learning decision tree ndimensional hypercube independent random labeled example Despite significant effort polynomialtime algorithm known learning polynomialsized decision tree even tree superc... | [-0.021885311231017113, -0.020260335877537727, -0.02572735957801342, 0.020465144887566566, -0.011316363699734211, -0.043275292962789536, -0.007310749031603336, 0.0009893638780340552, -0.05204666405916214, -0.025379491969943047, 0.06287685036659241, 0.028670815750956535, 0.025390159338712692, 0.022948650643229485, -0.01... |
40,576 | 40,576 | ['Alaa Abi-Haidar', 'Jasleen Kaur', 'Ana G. Maguitman', 'Predrag Radivojac', 'Andreas Retchsteiner', 'Karin Verspoor', 'Zhiping Wang', 'Luis M. Rocha'] | 0812.1029v1 | We participated in three of the protein-protein interaction subtasks of the
Second BioCreative Challenge: classification of abstracts relevant for
protein-protein interaction (IAS), discovery of protein pairs (IPS) and text
passages characterizing protein interaction (ISS) in full text documents. We
approached the abst... | Uncovering protein interaction in abstracts and text using a novel
linear model and word proximity networks | 2,008 | http://arxiv.org/pdf/0812.1029v1 | Title Uncovering protein interaction abstract text using novel linear model word proximity network Summary participated three proteinprotein interaction subtasks Second BioCreative Challenge classification abstract relevant proteinprotein interaction IAS discovery protein pair IPS text passage characterizing protein in... | [0.05675117298960686, 0.002017195336520672, 0.0034536204766482115, -0.00861004926264286, -0.03156363591551781, -0.007500193081796169, 0.016156036406755447, 0.032721661031246185, 0.04132937639951706, -0.04392758756875992, -0.00853084959089756, 0.02153579704463482, 0.059303492307662964, 0.08648006618022919, -0.0163223929... |
40,577 | 40,577 | ['Fangwen Fu', 'Mihaela van der Schaar'] | 0812.1244v1 | In this paper, we propose a general cross-layer optimization framework in
which we explicitly consider both the heterogeneous and dynamically changing
characteristics of delay-sensitive applications and the underlying time-varying
network conditions. We consider both the independently decodable data units
(DUs, e.g. pa... | Decomposition Principles and Online Learning in Cross-Layer Optimization
for Delay-Sensitive Applications | 2,008 | http://arxiv.org/pdf/0812.1244v1 | Title Decomposition Principles Online Learning CrossLayer Optimization DelaySensitive Applications Summary paper propose general crosslayer optimization framework explicitly consider heterogeneous dynamically changing characteristic delaysensitive application underlying timevarying network condition consider independen... | [-0.03431332856416702, -0.010286958888173103, -0.041254714131355286, -0.017111582681536674, -0.03525286167860031, -0.03422529250383377, 0.04044858366250992, 0.004746971186250448, -0.015864964574575424, -0.0011924250284209847, 0.035946257412433624, 0.02861829288303852, -0.004508437588810921, 0.04083919897675514, -0.0272... |
40,578 | 40,578 | ['Erik M. Boczko', 'Todd Young', 'Minhui Zie', 'Di Wu'] | 0812.3147v1 | We investigate the performance of a simple signed distance function (SDF)
based method by direct comparison with standard SVM packages, as well as
K-nearest neighbor and RBFN methods. We present experimental results comparing
the SDF approach with other classifiers on both synthetic geometric problems
and five benchmar... | Comparison of Binary Classification Based on Signed Distance Functions
with Support Vector Machines | 2,008 | http://arxiv.org/pdf/0812.3147v1 | Title Comparison Binary Classification Based Signed Distance Functions Support Vector Machines Summary investigate performance simple signed distance function SDF based method direct comparison standard SVM package well Knearest neighbor RBFN method present experimental result comparing SDF approach classifier syntheti... | [-0.004720108583569527, -0.047239091247320175, -0.026977790519595146, -0.026590265333652496, -0.013421121053397655, 0.009956044144928455, 0.09744065254926682, 0.059920988976955414, 0.05282741039991379, 0.0209205225110054, 0.07673874497413635, -0.0033408498857170343, 0.05467444285750389, 0.05597274750471115, -0.02365633... |
40,579 | 40,579 | ['Dmitry Gavinsky'] | 0812.3429v3 | We define a new model of quantum learning that we call Predictive Quantum
(PQ). This is a quantum analogue of PAC, where during the testing phase the
student is only required to answer a polynomial number of testing queries.
We demonstrate a relational concept class that is efficiently learnable in
PQ, while in any "... | Quantum Predictive Learning and Communication Complexity with Single
Input | 2,008 | http://arxiv.org/pdf/0812.3429v3 | Title Quantum Predictive Learning Communication Complexity Single Input Summary define new model quantum learning call Predictive Quantum PQ quantum analogue PAC testing phase student required answer polynomial number testing query demonstrate relational concept class efficiently learnable PQ reasonable classical model... | [-0.007448494900017977, 0.0799742043018341, -0.023016447201371193, 0.02546311914920807, -0.056692346930503845, -0.018815843388438225, -0.02638181857764721, 0.04658270254731178, 0.01739286072552204, -0.00336903496645391, 0.01261874195188284, -0.0198733638972044, -0.011286262422800064, 0.061075083911418915, 0.00632263068... |
40,580 | 40,580 | ['Ke Zhang', 'Marcus Hutter', 'Huidong Jin'] | 0903.3257v1 | Detecting outliers which are grossly different from or inconsistent with the
remaining dataset is a major challenge in real-world KDD applications. Existing
outlier detection methods are ineffective on scattered real-world datasets due
to implicit data patterns and parameter setting issues. We define a novel
"Local Dis... | A New Local Distance-Based Outlier Detection Approach for Scattered
Real-World Data | 2,009 | http://arxiv.org/pdf/0903.3257v1 | Title New Local DistanceBased Outlier Detection Approach Scattered RealWorld Data Summary Detecting outlier grossly different inconsistent remaining dataset major challenge realworld KDD application Existing outlier detection method ineffective scattered realworld datasets due implicit data pattern parameter setting is... | [-0.0020571411587297916, -0.027081776410341263, -0.025228314101696014, 0.03515364229679108, -0.03641258552670479, 0.0019385142950341105, 0.028102371841669083, 0.012422272004187107, -0.04271591082215309, 0.04300258681178093, 0.055509358644485474, 0.05129341036081314, 0.012499885633587837, 0.0433410219848156, -0.03508280... |
40,581 | 40,581 | ['Thomas Bréhard', 'Emmanuel Duflos', 'Philippe Vanheeghe', 'Pierre-Arnaud Coquelin'] | 0903.3329v1 | This paper introduces a new approach to solve sensor management problems.
Classically sensor management problems can be well formalized as
Partially-Observed Markov Decision Processes (POMPD). The original approach
developped here consists in deriving the optimal parameterized policy based on
a stochastic gradient esti... | Optimal Policies Search for Sensor Management | 2,009 | http://arxiv.org/pdf/0903.3329v1 | Title Optimal Policies Search Sensor Management Summary paper introduces new approach solve sensor management problem Classically sensor management problem well formalized PartiallyObserved Markov Decision Processes POMPD original approach developped consists deriving optimal parameterized policy based stochastic gradi... | [-0.004011965822428465, 0.020912781357765198, 0.009859351441264153, -0.03279445692896843, 0.017989538609981537, -0.012120665982365608, 0.06442099064588547, -0.053652361035346985, -0.002512391423806548, -0.011414512060582638, 0.034598637372255325, 0.04922235757112503, 0.004305312409996986, 0.019498711451888084, -0.03124... |
40,582 | 40,582 | ['Yusuke Watanabe', 'Kenji Fukumizu'] | 0903.4527v2 | The Bethe approximation, or loopy belief propagation algorithm is a
successful method for approximating partition functions of probabilistic models
associated with a graph. Chertkov and Chernyak derived an interesting formula
called Loop Series Expansion, which is an expansion of the partition function.
The main term o... | Graph polynomials and approximation of partition functions with Loopy
Belief Propagation | 2,009 | http://arxiv.org/pdf/0903.4527v2 | Title Graph polynomial approximation partition function Loopy Belief Propagation Summary Bethe approximation loopy belief propagation algorithm successful method approximating partition function probabilistic model associated graph Chertkov Chernyak derived interesting formula called Loop Series Expansion expansion par... | [-0.0672140121459961, -0.0003894760156981647, 1.8580265077616787e-06, 0.018500754609704018, -0.04627486318349838, -0.03394502401351929, -0.005249932873994112, -0.08961576968431473, 0.09308241307735443, 0.025672605261206627, 0.06450536102056503, 0.003210430033504963, -0.0008278469904325902, 0.08980850875377655, 0.001037... |
40,583 | 40,583 | ['Daiki Koizumi', 'Toshiyasu Matsushima', 'Shigeichi Hirasawa'] | 0906.3923v4 | Traffic forecasting from past observed traffic data with small calculation
complexity is one of important problems for planning of servers and networks.
Focusing on World Wide Web (WWW) traffic as fundamental investigation, this
paper would deal with Bayesian forecasting of network traffic on the time
varying Poisson m... | Bayesian Forecasting of WWW Traffic on the Time Varying Poisson Model | 2,009 | http://arxiv.org/pdf/0906.3923v4 | Title Bayesian Forecasting WWW Traffic Time Varying Poisson Model Summary Traffic forecasting past observed traffic data small calculation complexity one important problem planning server network Focusing World Wide Web WWW traffic fundamental investigation paper would deal Bayesian forecasting network traffic time var... | [0.015096246264874935, -0.011536497622728348, -0.046419329941272736, -0.04279458895325661, -0.07753831148147583, -0.020055068656802177, 0.02243761718273163, -0.021788857877254486, -0.023257344961166382, -0.05591873824596405, 0.02656463533639908, -0.06583771854639053, -0.0016926690004765987, 0.08179090172052383, -0.0092... |
40,584 | 40,584 | ['Anjana Pandey', 'K. R. Pardasani'] | 0906.4172v1 | In this paper, the mining of hybrid association rules with rough set approach
is investigated as the algorithm RSHAR.The RSHAR algorithm is constituted of
two steps mainly. At first, to join the participant tables into a general table
to generate the rules which is expressing the relationship between two or more
domain... | Rough Set Model for Discovering Hybrid Association Rules | 2,009 | http://arxiv.org/pdf/0906.4172v1 | Title Rough Set Model Discovering Hybrid Association Rules Summary paper mining hybrid association rule rough set approach investigated algorithm RSHARThe RSHAR algorithm constituted two step mainly first join participant table general table generate rule expressing relationship two domain belong several different tabl... | [-0.017824845388531685, -0.03582732751965523, -0.06261902302503586, 0.01001622062176466, -0.014077071100473404, -0.016911715269088745, -0.033608876168727875, 0.04516800493001938, 0.013008534908294678, 0.0033757470082491636, 0.020963769406080246, -0.0077780550345778465, 0.005536691285669804, 0.051231108605861664, -0.047... |
40,585 | 40,585 | ['Michael W. Mahoney', 'Hariharan Narayanan'] | 0906.4539v2 | Two ubiquitous aspects of large-scale data analysis are that the data often
have heavy-tailed properties and that diffusion-based or spectral-based methods
are often used to identify and extract structure of interest. Perhaps
surprisingly, popular distribution-independent methods such as those based on
the VC dimension... | Learning with Spectral Kernels and Heavy-Tailed Data | 2,009 | http://arxiv.org/pdf/0906.4539v2 | Title Learning Spectral Kernels HeavyTailed Data Summary Two ubiquitous aspect largescale data analysis data often heavytailed property diffusionbased spectralbased method often used identify extract structure interest Perhaps surprisingly popular distributionindependent method based VC dimension fail provide nontrivia... | [-0.01529476698487997, -0.020869920030236244, -0.026234326884150505, 0.0217269416898489, -0.01323604118078947, -0.01262324582785368, -0.003040436888113618, 0.01090823020786047, 0.016808170825242996, 0.01965317316353321, 0.024234110489487648, 0.005948793608695269, 0.011132503859698772, 0.0354897640645504, 0.000489734869... |
40,586 | 40,586 | ['Susmit Jha'] | 0906.5110v1 | Security protocols often use randomization to achieve probabilistic
non-determinism. This non-determinism, in turn, is used in obfuscating the
dependence of observable values on secret data. Since the correctness of
security protocols is very important, formal analysis of security protocols has
been widely studied in l... | Statistical Analysis of Privacy and Anonymity Guarantees in Randomized
Security Protocol Implementations | 2,009 | http://arxiv.org/pdf/0906.5110v1 | Title Statistical Analysis Privacy Anonymity Guarantees Randomized Security Protocol Implementations Summary Security protocol often use randomization achieve probabilistic nondeterminism nondeterminism turn used obfuscating dependence observable value secret data Since correctness security protocol important formal an... | [0.03760193660855293, 0.05400317534804344, 0.01567978784441948, 0.02113720029592514, -0.0974990725517273, -0.07174403220415115, 0.07942143827676773, -0.009884009137749672, -0.0013513421872630715, -0.006680652499198914, 0.04271978139877319, 0.04769531637430191, 0.05991615727543831, 0.058318931609392166, 0.00472458777949... |
40,587 | 40,587 | ['Nicholas Mastronarde', 'Mihaela van der Schaar'] | 0906.5325v1 | In our previous work, we proposed a systematic cross-layer framework for
dynamic multimedia systems, which allows each layer to make autonomous and
foresighted decisions that maximize the system's long-term performance, while
meeting the application's real-time delay constraints. The proposed solution
solved the cross-... | Online Reinforcement Learning for Dynamic Multimedia Systems | 2,009 | http://arxiv.org/pdf/0906.5325v1 | Title Online Reinforcement Learning Dynamic Multimedia Systems Summary previous work proposed systematic crosslayer framework dynamic multimedia system allows layer make autonomous foresighted decision maximize system longterm performance meeting application realtime delay constraint proposed solution solved crosslayer... | [0.019158542156219482, -0.031203465536236763, -0.023693520575761795, -0.029850810766220093, -0.010953031480312347, -0.017850598320364952, 0.044847168028354645, 0.012045525945723057, -0.06280073523521423, -0.03129338473081589, -0.016614306718111038, 0.01629253290593624, -0.010995802469551563, 0.06079670041799545, 0.0104... |
40,588 | 40,588 | ['Mikhail Belkin', 'Kaushik Sinha'] | 0907.1054v2 | In this paper we present a method for learning the parameters of a mixture of
$k$ identical spherical Gaussians in $n$-dimensional space with an arbitrarily
small separation between the components. Our algorithm is polynomial in all
parameters other than $k$. The algorithm is based on an appropriate grid search
over th... | Learning Gaussian Mixtures with Arbitrary Separation | 2,009 | http://arxiv.org/pdf/0907.1054v2 | Title Learning Gaussian Mixtures Arbitrary Separation Summary paper present method learning parameter mixture k identical spherical Gaussians ndimensional space arbitrarily small separation component algorithm polynomial parameter k algorithm based appropriate grid search space parameter theoretical analysis algorithm ... | [-0.009492437355220318, 0.002892538206651807, -0.013830075040459633, 0.05537648871541023, 0.007328925654292107, -0.004724267870187759, 0.030971813946962357, 0.014210057444870472, -0.026026485487818718, 0.028949648141860962, 0.013553285971283913, -0.0219118595123291, 0.017657479271292686, 0.015026496723294258, -0.005476... |
40,589 | 40,589 | ['Olivier Bournez', 'Johanne Cohen'] | 0907.1916v1 | We consider a class of fully stochastic and fully distributed algorithms,
that we prove to learn equilibria in games.
Indeed, we consider a family of stochastic distributed dynamics that we prove
to converge weakly (in the sense of weak convergence for probabilistic
processes) towards their mean-field limit, i.e an o... | Learning Equilibria in Games by Stochastic Distributed Algorithms | 2,009 | http://arxiv.org/pdf/0907.1916v1 | Title Learning Equilibria Games Stochastic Distributed Algorithms Summary consider class fully stochastic fully distributed algorithm prove learn equilibrium game Indeed consider family stochastic distributed dynamic prove converge weakly sense weak convergence probabilistic process towards meanfield limit ie ordinary ... | [-0.0017748619429767132, 0.033690471202135086, -0.04115977883338928, -0.015719696879386902, -0.04115026071667671, -0.035663992166519165, -0.009805106557905674, -0.008123403415083885, -0.03405008465051651, 0.046093255281448364, 0.013781813904643059, -0.019432177767157555, -0.020313270390033722, 0.05026637390255928, 0.00... |
40,590 | 40,590 | ['Dilip Krishnaswamy', 'Shanyu Zhao'] | 0907.2222v1 | This paper suggests the use of intelligent network-aware processing agents in
wireless local area network drivers to generate metrics for bandwidth
estimation based on real-time channel statistics to enable wireless multimedia
application adaptation. Various configurations in the wireless digital home are
studied and t... | Network-aware Adaptation with Real-Time Channel Statistics for Wireless
LAN Multimedia Transmissions in the Digital Home | 2,009 | http://arxiv.org/pdf/0907.2222v1 | Title Networkaware Adaptation RealTime Channel Statistics Wireless LAN Multimedia Transmissions Digital Home Summary paper suggests use intelligent networkaware processing agent wireless local area network driver generate metric bandwidth estimation based realtime channel statistic enable wireless multimedia applicatio... | [-0.014558868482708931, -0.022290294989943504, -0.021463194862008095, -0.029481446370482445, -0.04680358245968819, 0.0014375123428180814, 0.009441381320357323, 0.016647551208734512, -0.11258663982152939, -0.06664770096540451, -0.018090946599841118, 0.014460238628089428, 0.014184718951582909, 0.011695180088281631, -0.01... |
40,591 | 40,591 | ['Aleksandrs Slivkins'] | 0907.3986v5 | In a multi-armed bandit (MAB) problem, an online algorithm makes a sequence
of choices. In each round it chooses from a time-invariant set of alternatives
and receives the payoff associated with this alternative. While the case of
small strategy sets is by now well-understood, a lot of recent work has focused
on MAB pr... | Contextual Bandits with Similarity Information | 2,009 | http://arxiv.org/pdf/0907.3986v5 | Title Contextual Bandits Similarity Information Summary multiarmed bandit MAB problem online algorithm make sequence choice round chooses timeinvariant set alternative receives payoff associated alternative case small strategy set wellunderstood lot recent work focused MAB problem exponentially infinitely large strateg... | [-0.003646060125902295, 0.05602133646607399, -0.029970219358801842, 0.0022792676463723183, -0.05265825614333153, -0.012222242541611195, 0.059779874980449677, 0.03904580697417259, -0.031126180663704872, -0.026701753959059715, -0.01191089116036892, 0.01484981644898653, -0.03912053257226944, 0.0311236921697855, 0.01133265... |
40,592 | 40,592 | ['Adhistya Erna Permanasari', 'Dayang Rohaya Awang Rambli', 'Dhanapal Durai Dominic'] | 0910.0820v2 | Zoonosis refers to the transmission of infectious diseases from animal to
human. The increasing number of zoonosis incidence makes the great losses to
lives, including humans and animals, and also the impact in social economic. It
motivates development of a system that can predict the future number of
zoonosis occurren... | Prediction of Zoonosis Incidence in Human using Seasonal Auto Regressive
Integrated Moving Average (SARIMA) | 2,009 | http://arxiv.org/pdf/0910.0820v2 | Title Prediction Zoonosis Incidence Human using Seasonal Auto Regressive Integrated Moving Average SARIMA Summary Zoonosis refers transmission infectious disease animal human increasing number zoonosis incidence make great loss life including human animal also impact social economic motivates development system predict... | [5.425167182693258e-05, 0.03215879201889038, -0.022759003564715385, -0.05324310436844826, 0.027129273861646652, -0.006991364061832428, 0.04751018434762955, -0.007590348366647959, 0.03183417022228241, 0.0034877455327659845, 0.032336413860321045, -0.015062850899994373, 0.02476087585091591, 0.09344718605279922, -0.0233275... |
40,593 | 40,593 | ['Raghunandan H. Keshavan', 'Andrea Montanari', 'Sewoong Oh'] | 0910.0921v2 | We consider a problem of significant practical importance, namely, the
reconstruction of a low-rank data matrix from a small subset of its entries.
This problem appears in many areas such as collaborative filtering, computer
vision and wireless sensor networks. In this paper, we focus on the matrix
completion problem i... | Low-rank Matrix Completion with Noisy Observations: a Quantitative
Comparison | 2,009 | http://arxiv.org/pdf/0910.0921v2 | Title Lowrank Matrix Completion Noisy Observations Quantitative Comparison Summary consider problem significant practical importance namely reconstruction lowrank data matrix small subset entry problem appears many area collaborative filtering computer vision wireless sensor network paper focus matrix completion proble... | [-0.010159709490835667, 0.03778974711894989, 0.006451854482293129, 0.0054736873134970665, 9.295624477090314e-05, -0.014220255427062511, -0.030436091125011444, 0.03407227620482445, 0.012284649536013603, 0.029040003195405006, 0.0324060320854187, 0.031044401228427887, 0.05703485757112503, -0.008886492811143398, 0.00292256... |
40,594 | 40,594 | ['Hugo Zanghi', 'Franck Picard', 'Vincent Miele', 'Christophe Ambroise'] | 0910.2034v2 | In this paper we adapt online estimation strategies to perform model-based
clustering on large networks. Our work focuses on two algorithms, the first
based on the SAEM algorithm, and the second on variational methods. These two
strategies are compared with existing approaches on simulated and real data. We
use the met... | Strategies for online inference of model-based clustering in large and
growing networks | 2,009 | http://arxiv.org/pdf/0910.2034v2 | Title Strategies online inference modelbased clustering large growing network Summary paper adapt online estimation strategy perform modelbased clustering large network work focus two algorithm first based SAEM algorithm second variational method two strategy compared existing approach simulated real data use method de... | [-0.029717423021793365, 0.06034715846180916, -0.03896050527691841, -0.019062520936131477, -0.023394877091050148, -0.03398086130619049, 0.014753274619579315, -0.04419015720486641, 0.027625836431980133, 0.014884169213473797, 0.05155450105667114, -0.0005044295685365796, 0.0011246451176702976, 0.08655693382024765, 0.014013... |
40,595 | 40,595 | ['Brendan Juba'] | 0910.3713v1 | We examine the complexity of learning the distributions produced by
finite-state quantum sources. We show how prior techniques for learning hidden
Markov models can be adapted to the quantum generator model to find that the
analogous state of affairs holds: information-theoretically, a polynomial
number of samples suff... | On Learning Finite-State Quantum Sources | 2,009 | http://arxiv.org/pdf/0910.3713v1 | Title Learning FiniteState Quantum Sources Summary examine complexity learning distribution produced finitestate quantum source show prior technique learning hidden Markov model adapted quantum generator model find analogous state affair hold informationtheoretically polynomial number sample suffice approximately ident... | [-0.04062831401824951, 0.026398353278636932, -0.03489036113023758, 0.0280333012342453, -0.05865168571472168, -0.027205293998122215, -0.04476537927985191, 0.03672144189476967, -0.015081299468874931, -0.011899416334927082, 0.0114328907802701, 0.003227982670068741, -0.019630063325166702, 0.02226361632347107, 0.04119738936... |
40,596 | 40,596 | ['Raghunandan H. Keshavan', 'Sewoong Oh'] | 0910.5260v2 | We consider the problem of reconstructing a low-rank matrix from a small
subset of its entries. In this paper, we describe the implementation of an
efficient algorithm called OptSpace, based on singular value decomposition
followed by local manifold optimization, for solving the low-rank matrix
completion problem. It h... | A Gradient Descent Algorithm on the Grassman Manifold for Matrix
Completion | 2,009 | http://arxiv.org/pdf/0910.5260v2 | Title Gradient Descent Algorithm Grassman Manifold Matrix Completion Summary consider problem reconstructing lowrank matrix small subset entry paper describe implementation efficient algorithm called OptSpace based singular value decomposition followed local manifold optimization solving lowrank matrix completion probl... | [-0.012535160407423973, 0.004797298926860094, 0.0032052230089902878, 0.035979826003313065, 0.01471778191626072, -0.03163836896419525, -0.01252596452832222, 0.04568515345454216, 0.0598321370780468, 0.030912531539797783, -0.0045005097053945065, 0.041569385677576065, 0.03789518028497696, -0.01075640507042408, 0.0031119659... |
40,597 | 40,597 | ['Frederic Thouin', 'Mark Coates', 'Michael Rabbat'] | 1001.1009v1 | Knowing the largest rate at which data can be sent on an end-to-end path such
that the egress rate is equal to the ingress rate with high probability can be
very practical when choosing transmission rates in video streaming or selecting
peers in peer-to-peer applications. We introduce probabilistic available
bandwidth,... | Multi-path Probabilistic Available Bandwidth Estimation through Bayesian
Active Learning | 2,010 | http://arxiv.org/pdf/1001.1009v1 | Title Multipath Probabilistic Available Bandwidth Estimation Bayesian Active Learning Summary Knowing largest rate data sent endtoend path egress rate equal ingres rate high probability practical choosing transmission rate video streaming selecting peer peertopeer application introduce probabilistic available bandwidth... | [-0.011541265062987804, -0.008343292400240898, -0.01341888029128313, -0.03785132244229317, -0.06858315318822861, -0.02429545857012272, 0.015478917397558689, -0.022226354107260704, -0.03355409577488899, -0.0292286928743124, 0.04909469187259674, -0.00710442615672946, -0.012512819841504097, 0.0898139551281929, 0.013935853... |
40,598 | 40,598 | ['Cem Tekin', 'Mingyan Liu'] | 1010.0056v1 | We consider an opportunistic spectrum access (OSA) problem where the
time-varying condition of each channel (e.g., as a result of random fading or
certain primary users' activities) is modeled as an arbitrary finite-state
Markov chain. At each instance of time, a (secondary) user probes a channel and
collects a certain... | Online Learning in Opportunistic Spectrum Access: A Restless Bandit
Approach | 2,010 | http://arxiv.org/pdf/1010.0056v1 | Title Online Learning Opportunistic Spectrum Access Restless Bandit Approach Summary consider opportunistic spectrum access OSA problem timevarying condition channel eg result random fading certain primary user activity modeled arbitrary finitestate Markov chain instance time secondary user probe channel collect certai... | [0.010369249619543552, 0.03464570641517639, 0.005439855623990297, -0.08773569017648697, -0.006326572969555855, -0.02456473372876644, -0.03040509857237339, 0.009271861985325813, -0.06942259520292282, -0.004514485131949186, -0.009591730311512947, 0.01682262495160103, -0.05016084015369415, 0.04604250565171242, -0.04987040... |
40,599 | 40,599 | ['Andri Mirzal'] | 1010.5290v2 | This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix
factorization algorithms with robust convergence proofs. We design the
algorithms based on the work of Lee and Seung [1], and derive the converged
versions by utilizing ideas from the work of Lin [2]. The experimental results
confirm the theoretica... | Converged Algorithms for Orthogonal Nonnegative Matrix Factorizations | 2,010 | http://arxiv.org/pdf/1010.5290v2 | Title Converged Algorithms Orthogonal Nonnegative Matrix Factorizations Summary paper proposes uniorthogonal biorthogonal nonnegative matrix factorization algorithm robust convergence proof design algorithm based work Lee Seung 1 derive converged version utilizing idea work Lin 2 experimental result confirm theoretical... | [-0.06270299851894379, 0.03785886615514755, 0.008544456213712692, -0.001085922122001648, -0.030617473646998405, 0.002046912210062146, -0.02097672037780285, 0.03817601129412651, -0.025350399315357208, -0.004732214380055666, -0.016083573922514915, -0.014950703829526901, 0.01829279027879238, 0.019912149757146835, -0.01736... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.