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,900 | 40,900 | ['Jinsong Tan'] | 0704.2092v2 | We consider inapproximability of the correlation clustering problem defined
as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+"
(similar) or "-" (dissimilar), correlation clustering seeks to partition the
vertices into clusters so that the number of pairs correctly (resp.
incorrectly) classified... | A Note on the Inapproximability of Correlation Clustering | 2,007 | http://arxiv.org/pdf/0704.2092v2 | Title Note Inapproximability Correlation Clustering Summary consider inapproximability correlation clustering problem defined follows Given graph G edge labeled either similar dissimilar correlation clustering seek partition vertex cluster number pair correctly resp incorrectly classified respect label maximized resp m... | [0.0011577343102544546, -0.025677787140011787, -0.015053325332701206, 0.0037077779415994883, -0.018432283774018288, -0.006213461980223656, 0.00026737802545540035, 0.006688297726213932, 0.11437011510133743, 0.05675339326262474, -0.0058283437974750996, 0.09401430189609528, -0.014129099436104298, -0.03529590368270874, -0.... |
40,901 | 40,901 | ['Ulrike von Luxburg'] | 0711.0189v1 | In recent years, spectral clustering has become one of the most popular
modern clustering algorithms. It is simple to implement, can be solved
efficiently by standard linear algebra software, and very often outperforms
traditional clustering algorithms such as the k-means algorithm. On the first
glance spectral cluster... | A Tutorial on Spectral Clustering | 2,007 | http://arxiv.org/pdf/0711.0189v1 | Title Tutorial Spectral Clustering Summary recent year spectral clustering become one popular modern clustering algorithm simple implement solved efficiently standard linear algebra software often outperforms traditional clustering algorithm kmeans algorithm first glance spectral clustering appears slightly mysterious ... | [-0.01050631608814001, -0.05913615599274635, -0.018207091838121414, 0.05927897244691849, -0.03694334998726845, -0.04111059010028839, 0.011327976360917091, 0.001107074087485671, 0.03054085001349449, 0.004193097352981567, -0.019825907424092293, 0.057217277586460114, 0.013553122989833355, 0.017223330214619637, -0.01398631... |
40,902 | 40,902 | ['Xinhua Zhang', 'Ankan Saha', 'S. V. N. Vishwanathan'] | 1003.1354v1 | Structured output prediction is an important machine learning problem both in
theory and practice, and the max-margin Markov network (\mcn) is an effective
approach. All state-of-the-art algorithms for optimizing \mcn\ objectives take
at least $O(1/\epsilon)$ number of iterations to find an $\epsilon$ accurate
solution... | Faster Rates for training Max-Margin Markov Networks | 2,010 | http://arxiv.org/pdf/1003.1354v1 | Title Faster Rates training MaxMargin Markov Networks Summary Structured output prediction important machine learning problem theory practice maxmargin Markov network mcn effective approach stateoftheart algorithm optimizing mcn objective take least O1epsilon number iteration find epsilon accurate solution Recent resul... | [-0.03758031129837036, -0.0234738327562809, 0.021113460883498192, -6.697628850815818e-05, -0.018020784482359886, -0.020769909024238586, -0.018043484538793564, 0.03623637184500694, -0.026522062718868256, -0.0057912832126021385, 0.03583281859755516, 0.022102387621998787, -0.015872498974204063, 0.053398504853248596, 0.018... |
40,903 | 40,903 | ['Mofreh A. Hogo'] | 1003.1499v1 | This paper introduces an evaluation methodologies for the e-learners'
behaviour that will be a feedback to the decision makers in e-learning system.
Learner's profile plays a crucial role in the evaluation process to improve the
e-learning process performance. The work focuses on the clustering of the
e-learners based ... | Evaluation of E-Learners Behaviour using Different Fuzzy Clustering
Models: A Comparative Study | 2,010 | http://arxiv.org/pdf/1003.1499v1 | Title Evaluation ELearners Behaviour using Different Fuzzy Clustering Models Comparative Study Summary paper introduces evaluation methodology elearners behaviour feedback decision maker elearning system Learners profile play crucial role evaluation process improve elearning process performance work focus clustering el... | [0.03822580352425575, -0.04510798305273056, -0.06385034322738647, 0.02018800936639309, 0.012414651922881603, -0.01400833111256361, 0.024859312921762466, 0.004209914244711399, 0.013868636451661587, -0.04781505465507507, 0.029629524797201157, 0.04395906254649162, -0.017901375889778137, 0.005567255429923534, -0.0009228317... |
40,904 | 40,904 | ['Vidhya. K. A', 'G. Aghila'] | 1003.1795v1 | Text Document classification aims in associating one or more predefined
categories based on the likelihood suggested by the training set of labeled
documents. Many machine learning algorithms play a vital role in training the
system with predefined categories among which Na\"ive Bayes has some intriguing
facts that it ... | A Survey of Naïve Bayes Machine Learning approach in Text Document
Classification | 2,010 | http://arxiv.org/pdf/1003.1795v1 | Title Survey Naïve Bayes Machine Learning approach Text Document Classification Summary Text Document classification aim associating one predefined category based likelihood suggested training set labeled document Many machine learning algorithm play vital role training system predefined category among Naive Bayes intr... | [0.010011064819991589, 0.007092305459082127, -0.01750652864575386, -0.01678348332643509, -0.022379141300916672, 0.04113563522696495, 0.05236155912280083, 0.06642119586467743, 0.0022775635588914156, -0.09231659024953842, 0.015915466472506523, 0.028256436809897423, 0.01226793322712183, 0.014047927223145962, -0.0525846779... |
40,905 | 40,905 | ['Blaine Nelson', 'Benjamin I. P. Rubinstein', 'Ling Huang', 'Anthony D. Joseph', 'Shing-hon Lau', 'Steven J. Lee', 'Satish Rao', 'Anthony Tran', 'J. D. Tygar'] | 1003.2751v1 | Classifiers are often used to detect miscreant activities. We study how an
adversary can efficiently query a classifier to elicit information that allows
the adversary to evade detection at near-minimal cost. We generalize results of
Lowd and Meek (2005) to convex-inducing classifiers. We present algorithms that
constr... | Near-Optimal Evasion of Convex-Inducing Classifiers | 2,010 | http://arxiv.org/pdf/1003.2751v1 | Title NearOptimal Evasion ConvexInducing Classifiers Summary Classifiers often used detect miscreant activity study adversary efficiently query classifier elicit information allows adversary evade detection nearminimal cost generalize result Lowd Meek 2005 convexinducing classifier present algorithm construct undetecte... | [-0.0037321739364415407, 0.017511729151010513, -0.01683587208390236, 0.03290044888854027, -0.07088891416788101, -0.017831390723586082, 0.04882604628801346, 0.00933227501809597, -0.013229601085186005, -0.033530209213495255, 0.03400873392820358, 0.03272794559597969, -0.009281860664486885, 0.02568642795085907, 0.014076630... |
40,906 | 40,906 | ['Peter Duersch', 'Joerg Oechssler', 'Burkhard C. Schipper'] | 1003.4274v1 | We show that for many classes of symmetric two-player games, the simple
decision rule "imitate-the-best" can hardly be beaten by any other decision
rule. We provide necessary and sufficient conditions for imitation to be
unbeatable and show that it can only be beaten by much in games that are of the
rock-scissors-paper... | Unbeatable Imitation | 2,010 | http://arxiv.org/pdf/1003.4274v1 | Title Unbeatable Imitation Summary show many class symmetric twoplayer game simple decision rule imitatethebest hardly beaten decision rule provide necessary sufficient condition imitation unbeatable show beaten much game rockscissorspaper variety Thus many interesting example like 2x2 game Cournot duopoly price compet... | [0.020847782492637634, 0.02218683250248432, -0.032507989555597305, 0.03568290174007416, -0.01587836444377899, -0.047685932368040085, -0.004070770461112261, 0.006062055006623268, 0.004060656763613224, 0.0020867029670625925, -0.013964583165943623, 0.035674821585416794, -0.0135569516569376, 0.02855403535068035, 0.02483321... |
40,907 | 40,907 | ['Pawan Kumar', 'Astik Biswas', 'A . N. Mishra', 'Mahesh Chandra'] | 1003.5623v1 | This paper introduces and motivates the use of hybrid robust feature
extraction technique for spoken language identification (LID) system. The
speech recognizers use a parametric form of a signal to get the most important
distinguishable features of speech signal for recognition task. In this paper
Mel-frequency cepstr... | Spoken Language Identification Using Hybrid Feature Extraction Methods | 2,010 | http://arxiv.org/pdf/1003.5623v1 | Title Spoken Language Identification Using Hybrid Feature Extraction Methods Summary paper introduces motivates use hybrid robust feature extraction technique spoken language identification LID system speech recognizers use parametric form signal get important distinguishable feature speech signal recognition task pape... | [0.029035650193691254, -0.0054826075211167336, -0.0025824473705142736, 0.0614747628569603, 0.0005100337439216673, 0.027201246470212936, 0.011307289823889732, 0.02099265530705452, -0.00404139282181859, -0.04693444445729256, -0.03938847780227661, -0.0031607963610440493, 0.06471717357635498, 0.0437919907271862, -0.0361779... |
40,908 | 40,908 | ['Mahmoud I. Abdalla', 'Hanaa S. Ali'] | 1003.5627v1 | To improve the performance of speaker identification systems, an effective
and robust method is proposed to extract speech features, capable of operating
in noisy environment. Based on the time-frequency multi-resolution property of
wavelet transform, the input speech signal is decomposed into various frequency
channel... | Wavelet-Based Mel-Frequency Cepstral Coefficients for Speaker
Identification using Hidden Markov Models | 2,010 | http://arxiv.org/pdf/1003.5627v1 | Title WaveletBased MelFrequency Cepstral Coefficients Speaker Identification using Hidden Markov Models Summary improve performance speaker identification system effective robust method proposed extract speech feature capable operating noisy environment Based timefrequency multiresolution property wavelet transform inp... | [-0.016819922253489494, 0.017649555578827858, 0.017005043104290962, 0.02166128344833851, 0.005869434215128422, 0.038616228848695755, 0.03865883871912956, -0.0011534817749634385, -0.01417008601129055, 0.014999307692050934, 0.0012490134686231613, 0.04235156625509262, 0.050253935158252716, -0.04332530125975609, -0.0108418... |
40,909 | 40,909 | ['Mithun Das Gupta'] | 1007.0380v1 | Non-negative matrix factorization (NMF) has previously been shown to be a
useful decomposition for multivariate data. We interpret the factorization in a
new way and use it to generate missing attributes from test data. We provide a
joint optimization scheme for the missing attributes as well as the NMF
factors. We pro... | Additive Non-negative Matrix Factorization for Missing Data | 2,010 | http://arxiv.org/pdf/1007.0380v1 | Title Additive Nonnegative Matrix Factorization Missing Data Summary Nonnegative matrix factorization NMF previously shown useful decomposition multivariate data interpret factorization new way use generate missing attribute test data provide joint optimization scheme missing attribute well NMF factor prove monotonic c... | [-0.06647840142250061, 0.044687721878290176, -0.00023510683968197554, 0.007232038304209709, 0.0452820360660553, 0.027153152972459793, 0.0359930656850338, 0.006822850555181503, -0.04580993577837944, 0.026827706024050713, 0.01802224852144718, 0.01260789018124342, 0.02309282310307026, 0.06690901517868042, 0.00675704935565... |
40,910 | 40,910 | ['Cem Tekin', 'Mingyan Liu'] | 1007.2238v2 | We consider the classical multi-armed bandit problem with Markovian rewards.
When played an arm changes its state in a Markovian fashion while it remains
frozen when not played. The player receives a state-dependent reward each time
it plays an arm. The number of states and the state transition probabilities of
an arm ... | Online Algorithms for the Multi-Armed Bandit Problem with Markovian
Rewards | 2,010 | http://arxiv.org/pdf/1007.2238v2 | Title Online Algorithms MultiArmed Bandit Problem Markovian Rewards Summary consider classical multiarmed bandit problem Markovian reward played arm change state Markovian fashion remains frozen played player receives statedependent reward time play arm number state state transition probability arm unknown player playe... | [0.012377113103866577, 0.0183816310018301, -0.0073624118231236935, -0.06020834669470787, -0.018455633893609047, -0.016549305990338326, -0.023073796182870865, 0.015336333774030209, -0.02760256454348564, -0.003425497794523835, -0.012016241438686848, 0.027803966775536537, -0.042721036821603775, 0.03490304574370384, 0.0124... |
40,911 | 40,911 | ['Md. Saiful Islam', 'Md. Iftekharul Amin'] | 1008.4669v1 | In this paper, we have proposed an architecture of active learning SVMs with
relevance feedback (RF)for classifying e-mail. This architecture combines both
active learning strategies where instead of using a randomly selected training
set, the learner has access to a pool of unlabeled instances and can request
the labe... | An Architecture of Active Learning SVMs with Relevance Feedback for
Classifying E-mail | 2,010 | http://arxiv.org/pdf/1008.4669v1 | Title Architecture Active Learning SVMs Relevance Feedback Classifying Email Summary paper proposed architecture active learning SVMs relevance feedback RFfor classifying email architecture combine active learning strategy instead using randomly selected training set learner access pool unlabeled instance request label... | [0.06888001412153244, -0.030808985233306885, -0.026927782222628593, 0.015787960961461067, -0.01553189754486084, 0.01967395842075348, 0.05113937705755234, 0.008698501624166965, 0.055897098034620285, -0.0845872163772583, 0.03167968615889549, 0.021547449752688408, -0.05093913525342941, 0.0795050635933876, -0.0150738917291... |
40,912 | 40,912 | ['Vladimir Pestov'] | 1008.5105v5 | Degrading performance of indexing schemes for exact similarity search in high
dimensions has long since been linked to histograms of distributions of
distances and other 1-Lipschitz functions getting concentrated. We discuss this
observation in the framework of the phenomenon of concentration of measure on
the structur... | Indexability, concentration, and VC theory | 2,010 | http://arxiv.org/pdf/1008.5105v5 | Title Indexability concentration VC theory Summary Degrading performance indexing scheme exact similarity search high dimension long since linked histogram distribution distance 1Lipschitz function getting concentrated discus observation framework phenomenon concentration measure structure high dimension VapnikChervone... | [-0.022712241858243942, -0.06395149230957031, -0.02875649370253086, 0.012935196980834007, -0.043645668774843216, -0.022596267983317375, 0.03819127753376961, 0.03375401720404625, -0.03391256928443909, 0.03302682191133499, 0.033797599375247955, -0.04392961040139198, 0.009915799833834171, 0.010939644649624825, -0.02580934... |
40,913 | 40,913 | ['Qihang Lin', 'Xi Chen', 'Javier Pena'] | 1008.5204v2 | We consider the unconstrained optimization problem whose objective function
is composed of a smooth and a non-smooth conponents where the smooth component
is the expectation a random function. This type of problem arises in some
interesting applications in machine learning. We propose a stochastic gradient
descent algo... | A Smoothing Stochastic Gradient Method for Composite Optimization | 2,010 | http://arxiv.org/pdf/1008.5204v2 | Title Smoothing Stochastic Gradient Method Composite Optimization Summary consider unconstrained optimization problem whose objective function composed smooth nonsmooth conponents smooth component expectation random function type problem arises interesting application machine learning propose stochastic gradient descen... | [0.019735125824809074, 0.0689360648393631, 0.01909034140408039, 0.02363540232181549, 0.0337933711707592, -0.015737099573016167, -0.02275468222796917, 0.0007992034079506993, -0.023744869977235794, 0.007942955940961838, 0.03924437239766121, -0.018112361431121826, 0.05223044008016586, -0.003432295983657241, 0.008707505650... |
40,914 | 40,914 | ['Maria Florina Balcan', 'Yingyu Liang'] | 1112.0826v5 | Motivated by the fact that distances between data points in many real-world
clustering instances are often based on heuristic measures, Bilu and
Linial~\cite{BL} proposed analyzing objective based clustering problems under
the assumption that the optimum clustering to the objective is preserved under
small multiplicati... | Clustering under Perturbation Resilience | 2,011 | http://arxiv.org/pdf/1112.0826v5 | Title Clustering Perturbation Resilience Summary Motivated fact distance data point many realworld clustering instance often based heuristic measure Bilu LinialciteBL proposed analyzing objective based clustering problem assumption optimum clustering objective preserved small multiplicative perturbation distance point ... | [-0.04206215590238571, -0.01961979642510414, -0.03798908367753029, -0.0019315957324579358, -0.0027882347349077463, -0.035335611552000046, 0.011156256310641766, 0.047619834542274475, 0.00336897443048656, -0.004103836603462696, 0.01659657619893551, 0.03804117441177368, -0.013861553743481636, -0.012629908509552479, -0.002... |
40,915 | 40,915 | ['Joseph Modayil', 'Adam White', 'Richard S. Sutton'] | 1112.1133v3 | The term "nexting" has been used by psychologists to refer to the propensity
of people and many other animals to continually predict what will happen next
in an immediate, local, and personal sense. The ability to "next" constitutes a
basic kind of awareness and knowledge of one's environment. In this paper we
present ... | Multi-timescale Nexting in a Reinforcement Learning Robot | 2,011 | http://arxiv.org/pdf/1112.1133v3 | Title Multitimescale Nexting Reinforcement Learning Robot Summary term nexting used psychologist refer propensity people many animal continually predict happen next immediate local personal sense ability next constitutes basic kind awareness knowledge one environment paper present result robot learns next real time pre... | [0.007213645614683628, 0.0011933145578950644, -0.004957240074872971, -0.03546614944934845, -0.01452572364360094, -0.0035311889369040728, 0.03549617528915405, -0.00566457724198699, -0.01418200135231018, -0.0041330489329993725, -0.04773714393377304, 0.027910789474844933, -0.009058208204805851, 0.07772424072027206, -0.000... |
40,916 | 40,916 | ['Dominique Barth', 'Boubkeur Boudaoud', 'Thierry Mautor'] | 1112.1615v1 | The new model that we present in this paper is introduced in the context of
guaranteed QoS and resources management in the inter-domain routing framework.
This model, called the stock model, is based on a reverse cascade approach and
is applied in a distributed context. So transit providers have to learn the
right capa... | SLA Establishment with Guaranteed QoS in the Interdomain Network: A
Stock Model | 2,011 | http://arxiv.org/pdf/1112.1615v1 | Title SLA Establishment Guaranteed QoS Interdomain Network Stock Model Summary new model present paper introduced context guaranteed QoS resource management interdomain routing framework model called stock model based reverse cascade approach applied distributed context transit provider learn right capacity buy stock t... | [0.04304363578557968, -0.01942729577422142, -0.04857228696346283, -0.030785126611590385, -0.036739833652973175, -0.054143551737070084, 0.02058599516749382, 0.007440757006406784, -0.036114733666181564, -0.0276635754853487, -0.005859517026692629, -0.022030211985111237, -0.01352616772055626, 0.048934537917375565, -0.00662... |
40,917 | 40,917 | ['Marcos Aurélio Domingues', 'Solange Oliveira Rezende'] | 1112.1734v1 | The Data Mining process enables the end users to analyze, understand and use
the extracted knowledge in an intelligent system or to support in the
decision-making processes. However, many algorithms used in the process
encounter large quantities of patterns, complicating the analysis of the
patterns. This fact occurs w... | Using Taxonomies to Facilitate the Analysis of the Association Rules | 2,011 | http://arxiv.org/pdf/1112.1734v1 | Title Using Taxonomies Facilitate Analysis Association Rules Summary Data Mining process enables end user analyze understand use extracted knowledge intelligent system support decisionmaking process However many algorithm used process encounter large quantity pattern complicating analysis pattern fact occurs associatio... | [0.016646215692162514, 0.0139810461550951, -0.06612619012594223, -0.011165819130837917, -0.005489552393555641, -0.01909910887479782, 0.05324074998497963, 0.010509598068892956, 0.0006391903152689338, -0.024977412074804306, 0.04020914062857628, 0.04012158513069153, 0.050883013755083084, 0.07913249731063843, -0.0293726455... |
40,918 | 40,918 | ['Chih-Yu Wang', 'Yan Chen', 'K. J. Ray Liu'] | 1112.2187v2 | In Part I of this two-part paper [1], we proposed a new game, called Chinese
restaurant game, to analyze the social learning problem with negative network
externality. The best responses of agents in the Chinese restaurant game with
imperfect signals are constructed through a recursive method, and the influence
of both... | Chinese Restaurant Game - Part II: Applications to Wireless Networking,
Cloud Computing, and Online Social Networking | 2,011 | http://arxiv.org/pdf/1112.2187v2 | Title Chinese Restaurant Game Part II Applications Wireless Networking Cloud Computing Online Social Networking Summary Part twopart paper 1 proposed new game called Chinese restaurant game analyze social learning problem negative network externality best response agent Chinese restaurant game imperfect signal construc... | [0.05241009593009949, 0.02028759941458702, -0.038419026881456375, -0.01949353702366352, -0.02286759950220585, -0.02546767331659794, -0.01427423395216465, 0.013816339895129204, 0.02975517325103283, -0.024209342896938324, 0.0029683983884751797, 0.02671251818537712, 0.025802597403526306, 0.06374722719192505, 0.02934771589... |
40,919 | 40,919 | ['Chih-Yu Wang', 'Yan Chen', 'K. J. Ray Liu'] | 1112.2188v3 | In a social network, agents are intelligent and have the capability to make
decisions to maximize their utilities. They can either make wise decisions by
taking advantages of other agents' experiences through learning, or make
decisions earlier to avoid competitions from huge crowds. Both these two
effects, social lear... | Chinese Restaurant Game - Part I: Theory of Learning with Negative
Network Externality | 2,011 | http://arxiv.org/pdf/1112.2188v3 | Title Chinese Restaurant Game Part Theory Learning Negative Network Externality Summary social network agent intelligent capability make decision maximize utility either make wise decision taking advantage agent experience learning make decision earlier avoid competition huge crowd two effect social learning negative n... | [0.028349202126264572, 0.017934951931238174, -0.031123310327529907, -0.019175315275788307, 0.003362043993547559, -0.022629745304584503, -0.008298985660076141, 0.015617424622178078, 0.03010663017630577, -0.012249311432242393, -0.02759460173547268, 0.02604042738676071, 0.02685297094285488, 0.06538679450750351, 0.03871311... |
40,920 | 40,920 | ['B. Mishra', 'G. Meyer', 'F. Bach', 'R. Sepulchre'] | 1112.2318v2 | The paper addresses the problem of low-rank trace norm minimization. We
propose an algorithm that alternates between fixed-rank optimization and
rank-one updates. The fixed-rank optimization is characterized by an efficient
factorization that makes the trace norm differentiable in the search space and
the computation o... | Low-rank optimization with trace norm penalty | 2,011 | http://arxiv.org/pdf/1112.2318v2 | Title Lowrank optimization trace norm penalty Summary paper address problem lowrank trace norm minimization propose algorithm alternate fixedrank optimization rankone update fixedrank optimization characterized efficient factorization make trace norm differentiable search space computation duality gap numerically tract... | [-0.005916376132518053, 0.043126724660396576, -0.013724396005272865, 0.02865004539489746, 0.044932521879673004, -0.019333362579345703, 0.007864621467888355, 0.04228623956441879, 0.07647101581096649, 0.030673712491989136, 0.013771270401775837, -0.013585174456238747, 0.034578803926706314, 0.012741662561893463, 0.01518665... |
40,921 | 40,921 | ['Yohji Akama'] | 1112.2801v3 | By reformulating a learning process of a set system L as a game between
Teacher (presenter of data) and Learner (updater of the abstract independent
set), we define the order type dim L of L to be the order type of the game
tree. The theory of this new order type and continuous, monotone function
between set systems co... | A new order theory of set systems and better quasi-orderings | 2,011 | http://arxiv.org/pdf/1112.2801v3 | Title new order theory set system better quasiorderings Summary reformulating learning process set system L game Teacher presenter data Learner updater abstract independent set define order type dim L L order type game tree theory new order type continuous monotone function set system corresponds theory well quasiorder... | [-0.053304027765989304, 0.038052596151828766, -0.046681664884090424, 0.015307565219700336, 0.006156557705253363, -0.010261528193950653, -0.023599224165081978, -0.01595946028828621, -0.04040701314806938, 0.000575787213165313, 0.028799524530768394, -0.0002126522595062852, 0.004087347071617842, 0.06363745033740997, -0.029... |
40,922 | 40,922 | ['Ziqiang Shi', 'Jiqing Han', 'Tieran Zheng', 'Shiwen Deng'] | 1112.4243v1 | In this paper, a novel framework based on trace norm minimization for audio
segment is proposed. In this framework, both the feature extraction and
classification are obtained by solving corresponding convex optimization
problem with trace norm regularization. For feature extraction, robust
principle component analysis... | Online Learning for Classification of Low-rank Representation Features
and Its Applications in Audio Segment Classification | 2,011 | http://arxiv.org/pdf/1112.4243v1 | Title Online Learning Classification Lowrank Representation Features Applications Audio Segment Classification Summary paper novel framework based trace norm minimization audio segment proposed framework feature extraction classification obtained solving corresponding convex optimization problem trace norm regularizati... | [-0.0283078420907259, -0.00035871798172593117, -0.027246002107858658, 0.03836284205317497, 0.016575409099459648, -0.00018359175010118634, 0.049739301204681396, 0.027234982699155807, -0.02979872189462185, -0.019559450447559357, -0.023783838376402855, -0.011034094728529453, 0.014013136737048626, 0.04534192010760307, -0.0... |
40,923 | 40,923 | ['Giovanni Zappella'] | 1112.4344v1 | We introduce a scalable algorithm, MUCCA, for multiclass node classification
in weighted graphs. Unlike previously proposed methods for the same task, MUCCA
works in time linear in the number of nodes. Our approach is based on a
game-theoretic formulation of the problem in which the test labels are
expressed as a Nash ... | A Scalable Multiclass Algorithm for Node Classification | 2,011 | http://arxiv.org/pdf/1112.4344v1 | Title Scalable Multiclass Algorithm Node Classification Summary introduce scalable algorithm MUCCA multiclass node classification weighted graph Unlike previously proposed method task MUCCA work time linear number node approach based gametheoretic formulation problem test label expressed Nash Equilibrium certain game H... | [-0.018427683040499687, 0.013802907429635525, -0.03204119950532913, 0.024322036653757095, 0.008430048823356628, -0.062042150646448135, -0.010501784272491932, 0.002227488672360778, 0.025071503594517708, -0.02609388343989849, 0.049535416066646576, 0.04498685523867607, 0.009438790380954742, 0.05217565968632698, -0.0230269... |
40,924 | 40,924 | ['Wei Du', 'Yongjun Liao', 'and Pierre Geurts', 'Guy Leduc'] | 1211.0447v1 | This paper addresses the large-scale acquisition of end-to-end network
performance. We made two distinct contributions: ordinal rating of network
performance and inference by matrix completion. The former reduces measurement
costs and unifies various metrics which eases their processing in applications.
The latter enab... | Ordinal Rating of Network Performance and Inference by Matrix Completion | 2,012 | http://arxiv.org/pdf/1211.0447v1 | Title Ordinal Rating Network Performance Inference Matrix Completion Summary paper address largescale acquisition endtoend network performance made two distinct contribution ordinal rating network performance inference matrix completion former reduces measurement cost unifies various metric eas processing application l... | [-0.02864992246031761, 0.055561892688274384, -0.007937630638480186, -0.0008752914727665484, 0.01161841582506895, -0.033593930304050446, 0.025057563558220863, 0.012605246156454086, 0.005862119607627392, 0.0036109555512666702, -0.012211446650326252, 0.05257721245288849, 0.0338481143116951, 0.06894686818122864, -0.0178403... |
40,925 | 40,925 | ['Amit Daniely', 'Nati Linial', 'Shai Shalev-Shwartz'] | 1211.0616v4 | Many popular learning algorithms (E.g. Regression, Fourier-Transform based
algorithms, Kernel SVM and Kernel ridge regression) operate by reducing the
problem to a convex optimization problem over a vector space of functions.
These methods offer the currently best approach to several central problems
such as learning h... | The complexity of learning halfspaces using generalized linear methods | 2,012 | http://arxiv.org/pdf/1211.0616v4 | Title complexity learning halfspaces using generalized linear method Summary Many popular learning algorithm Eg Regression FourierTransform based algorithm Kernel SVM Kernel ridge regression operate reducing problem convex optimization problem vector space function method offer currently best approach several central p... | [-0.002295953454449773, 0.008558807894587517, -0.003343199612572789, 0.054751452058553696, -0.004944844637066126, 0.020687727257609367, 0.0032522145193070173, 0.04871004447340965, -0.014091363176703453, 0.00774019630625844, 0.03831157088279724, -0.046111490577459335, 0.0014452817849814892, 0.004993148613721132, 0.01518... |
40,926 | 40,926 | ['Xiaofei Wang', 'Mingming Zhang', 'Liyong Shen', 'Suixiang Gao'] | 1211.1526v2 | The prevention of dangerous chemical accidents is a primary problem of
industrial manufacturing. In the accidents of dangerous chemicals, the oil gas
explosion plays an important role. The essential task of the explosion
prevention is to estimate the better explosion limit of a given oil gas. In
this paper, Support Vec... | Explosion prediction of oil gas using SVM and Logistic Regression | 2,012 | http://arxiv.org/pdf/1211.1526v2 | Title Explosion prediction oil gas using SVM Logistic Regression Summary prevention dangerous chemical accident primary problem industrial manufacturing accident dangerous chemical oil gas explosion play important role essential task explosion prevention estimate better explosion limit given oil gas paper Support Vecto... | [-0.04047830030322075, 0.010765585117042065, -0.01546332985162735, -0.00977305881679058, 0.008111267350614071, -0.00037309533217921853, 0.04351382330060005, 0.03899355232715607, -0.00355600006878376, -0.007816132158041, 0.07881353050470352, 0.014709604904055595, -0.020366227254271507, 0.08606130629777908, 0.01050810236... |
40,927 | 40,927 | ['H. Brendan McMahan', 'Omkar Muralidharan'] | 1211.3955v1 | Calibration is a basic property for prediction systems, and algorithms for
achieving it are well-studied in both statistics and machine learning. In many
applications, however, the predictions are used to make decisions that select
which observations are made. This makes calibration difficult, as adjusting
predictions ... | On Calibrated Predictions for Auction Selection Mechanisms | 2,012 | http://arxiv.org/pdf/1211.3955v1 | Title Calibrated Predictions Auction Selection Mechanisms Summary Calibration basic property prediction system algorithm achieving wellstudied statistic machine learning many application however prediction used make decision select observation made make calibration difficult adjusting prediction achieve calibration cha... | [-0.018723594024777412, 0.08805260062217712, -0.013896683230996132, -0.0023856391198933125, -0.056178461760282516, -0.023447221145033836, 0.023587875068187714, 0.02153191901743412, -0.02817120961844921, 0.0035967042203992605, 0.0024302054662257433, 0.003082925919443369, 0.05961461365222931, 0.05475778877735138, -0.0028... |
40,928 | 40,928 | ['Frédéric Bastien', 'Pascal Lamblin', 'Razvan Pascanu', 'James Bergstra', 'Ian Goodfellow', 'Arnaud Bergeron', 'Nicolas Bouchard', 'David Warde-Farley', 'Yoshua Bengio'] | 1211.5590v1 | Theano is a linear algebra compiler that optimizes a user's
symbolically-specified mathematical computations to produce efficient low-level
implementations. In this paper, we present new features and efficiency
improvements to Theano, and benchmarks demonstrating Theano's performance
relative to Torch7, a recently intr... | Theano: new features and speed improvements | 2,012 | http://arxiv.org/pdf/1211.5590v1 | Title Theano new feature speed improvement Summary Theano linear algebra compiler optimizes user symbolicallyspecified mathematical computation produce efficient lowlevel implementation paper present new feature efficiency improvement Theano benchmark demonstrating Theanos performance relative Torch7 recently introduce... | [-0.0208754725754261, 0.016560830175876617, -0.04165910556912422, 0.05172696337103844, -0.029833383858203888, 0.009483199566602707, 0.08537965267896652, -0.004914767108857632, -0.02399720437824726, -0.00745485071092844, 0.010925411246716976, 0.004382411018013954, 0.019493069499731064, 0.04936864972114563, -0.0095182228... |
40,929 | 40,929 | ['Mehrdad Mahdavi', 'Tianbao Yang', 'Rong Jin'] | 1211.6013v2 | In this paper we propose a general framework to characterize and solve the
stochastic optimization problems with multiple objectives underlying many real
world learning applications. We first propose a projection based algorithm
which attains an $O(T^{-1/3})$ convergence rate. Then, by leveraging on the
theory of Lagra... | Online Stochastic Optimization with Multiple Objectives | 2,012 | http://arxiv.org/pdf/1211.6013v2 | Title Online Stochastic Optimization Multiple Objectives Summary paper propose general framework characterize solve stochastic optimization problem multiple objective underlying many real world learning application first propose projection based algorithm attains OT13 convergence rate leveraging theory Lagrangian const... | [-0.0032410002313554287, 0.06223427504301071, 0.0035836000461131334, -0.031908825039863586, 0.010287165641784668, -0.031971145421266556, 0.015565989539027214, -0.00874311849474907, -0.039556048810482025, 0.005516089964658022, -0.036824896931648254, -0.014038858003914356, 0.018081985414028168, 0.04555261880159378, 0.016... |
40,930 | 40,930 | ['Patrick Rebentrost', 'Masoud Mohseni', 'Seth Lloyd'] | 1307.0471v3 | Supervised machine learning is the classification of new data based on
already classified training examples. In this work, we show that the support
vector machine, an optimized binary classifier, can be implemented on a quantum
computer, with complexity logarithmic in the size of the vectors and the number
of training ... | Quantum support vector machine for big data classification | 2,013 | http://arxiv.org/pdf/1307.0471v3 | Title Quantum support vector machine big data classification Summary Supervised machine learning classification new data based already classified training example work show support vector machine optimized binary classifier implemented quantum computer complexity logarithmic size vector number training example case cla... | [-0.014572752639651299, 0.017841720953583717, -0.048834219574928284, 0.043825749307870865, 0.0036746293772011995, 0.021135276183485985, -0.023916319012641907, 0.05828232690691948, 0.0007606795406900346, -0.029094276949763298, 0.016977082937955856, -0.020937807857990265, -0.015797872096300125, 0.023123707622289658, 0.02... |
40,931 | 40,931 | ['Jenna Reps', 'Jan Feyereisl', 'Jonathan M. Garibaldi', 'Uwe Aickelin', 'Jack E. Gibson', 'Richard B. Hubbard'] | 1307.1078v1 | Data-mining techniques have frequently been developed for Spontaneous
reporting databases. These techniques aim to find adverse drug events
accurately and efficiently. Spontaneous reporting databases are prone to
missing information, under reporting and incorrect entries. This often results
in a detection lag or preven... | Investigating the Detection of Adverse Drug Events in a UK General
Practice Electronic Health-Care Database | 2,013 | http://arxiv.org/pdf/1307.1078v1 | Title Investigating Detection Adverse Drug Events UK General Practice Electronic HealthCare Database Summary Datamining technique frequently developed Spontaneous reporting database technique aim find adverse drug event accurately efficiently Spontaneous reporting database prone missing information reporting incorrect ... | [0.0034874146804213524, -0.0005281499470584095, -0.012989194132387638, -0.049578629434108734, -0.0014105674345046282, 0.009915286675095558, 0.006728270091116428, 0.013854187913239002, 0.07276028394699097, 0.0158066526055336, 0.1119515672326088, 0.014848712831735611, -0.039146788418293, 0.06883931159973145, -0.025760281... |
40,932 | 40,932 | ['Ian Dent', 'Uwe Aickelin', 'Tom Rodden'] | 1307.1079v1 | This paper takes an approach to clustering domestic electricity load profiles
that has been successfully used with data from Portugal and applies it to UK
data. Clustering techniques are applied and it is found that the preferred
technique in the Portuguese work (a two stage process combining Self Organised
Maps and Km... | Application of a clustering framework to UK domestic electricity data | 2,013 | http://arxiv.org/pdf/1307.1079v1 | Title Application clustering framework UK domestic electricity data Summary paper take approach clustering domestic electricity load profile successfully used data Portugal applies UK data Clustering technique applied found preferred technique Portuguese work two stage process combining Self Organised Maps Kmeans appro... | [-0.07739370316267014, -0.020798690617084503, -0.03232843056321144, 0.002448206301778555, 0.014735938049852848, 0.03858669847249985, 0.06358623504638672, -0.02929244562983513, 0.06208069249987602, 0.02335716038942337, 0.006402941886335611, 0.07766004651784897, 0.0028017344884574413, 0.001373515697196126, 0.031455442309... |
40,933 | 40,933 | ['Ian Dent', 'Christian Wagner', 'Uwe Aickelin', 'Tom Rodden'] | 1307.1385v1 | Changes in the UK electricity market mean that domestic users will be
required to modify their usage behaviour in order that supplies can be
maintained. Clustering allows usage profiles collected at the household level
to be clustered into groups and assigned a stereotypical profile which can be
used to target marketin... | Creating Personalised Energy Plans. From Groups to Individuals using
Fuzzy C Means Clustering | 2,013 | http://arxiv.org/pdf/1307.1385v1 | Title Creating Personalised Energy Plans Groups Individuals using Fuzzy C Means Clustering Summary Changes UK electricity market mean domestic user required modify usage behaviour order supply maintained Clustering allows usage profile collected household level clustered group assigned stereotypical profile used target... | [-0.010037122294306755, 0.005705810151994228, -0.046015601605176926, -0.013943769969046116, 0.020738286897540092, -0.004344355780631304, 0.046069927513599396, -0.01847282610833645, 0.0033055006060749292, -0.025841476395726204, 0.029289141297340393, 0.05260629579424858, 0.005968061275780201, 0.06279467791318893, 0.03832... |
40,934 | 40,934 | ['Hala Helmi', 'Jon M. Garibaldi', 'Uwe Aickelin'] | 1307.1387v1 | Gene expression data sets are used to classify and predict patient diagnostic
categories. As we know, it is extremely difficult and expensive to obtain gene
expression labelled examples. Moreover, conventional supervised approaches
cannot function properly when labelled data (training examples) are
insufficient using S... | Examining the Classification Accuracy of TSVMs with ?Feature Selection
in Comparison with the GLAD Algorithm | 2,013 | http://arxiv.org/pdf/1307.1387v1 | Title Examining Classification Accuracy TSVMs Feature Selection Comparison GLAD Algorithm Summary Gene expression data set used classify predict patient diagnostic category know extremely difficult expensive obtain gene expression labelled example Moreover conventional supervised approach cannot function properly label... | [0.006766381207853556, -0.04397431015968323, -0.044239193201065063, -0.00677415169775486, -0.0014575881650671363, 0.006737569347023964, 0.07565028220415115, 0.05127401277422905, 0.04228689521551132, 0.013127481564879417, 0.02413913980126381, 0.019679320976138115, 0.004065385088324547, 0.06859718263149261, -0.0091502154... |
40,935 | 40,935 | ['Feng Gu', 'Jan Feyereisl', 'Robert Oates', 'Jenna Reps', 'Julie Greensmith', 'Uwe Aickelin'] | 1307.1391v1 | Theoretical analyses of the Dendritic Cell Algorithm (DCA) have yielded
several criticisms about its underlying structure and operation. As a result,
several alterations and fixes have been suggested in the literature to correct
for these findings. A contribution of this work is to investigate the effects
of replacing ... | Quiet in Class: Classification, Noise and the Dendritic Cell Algorithm | 2,013 | http://arxiv.org/pdf/1307.1391v1 | Title Quiet Class Classification Noise Dendritic Cell Algorithm Summary Theoretical analysis Dendritic Cell Algorithm DCA yielded several criticism underlying structure operation result several alteration fix suggested literature correct finding contribution work investigate effect replacing classification stage DCA kn... | [0.01771804690361023, -0.005975037347525358, -0.020305056124925613, -0.013408922590315342, 0.0012088039657101035, 0.003565159859135747, 0.042043473571538925, 0.000560409389436245, 0.016762085258960724, 0.008188695646822453, 0.020078003406524658, 0.01290767453610897, -0.0134668480604887, 0.03669336065649986, -0.01306713... |
40,936 | 40,936 | ['Yihui Liu', 'Uwe Aickelin'] | 1307.1394v1 | Adverse drug reaction (ADR) is widely concerned for public health issue. In
this study we propose an original approach to detect the ADRs using feature
matrix and feature selection. The experiments are carried out on the drug
Simvastatin. Major side effects for the drug are detected and better
performance is achieved c... | Detect adverse drug reactions for drug Alendronate | 2,013 | http://arxiv.org/pdf/1307.1394v1 | Title Detect adverse drug reaction drug Alendronate Summary Adverse drug reaction ADR widely concerned public health issue study propose original approach detect ADRs using feature matrix feature selection experiment carried drug Simvastatin Major side effect drug detected better performance achieved compared computeri... | [-0.020554320886731148, -0.016610929742455482, -0.022700292989611626, -0.03605443239212036, 0.022868774831295013, 0.027514012530446053, 0.047032132744789124, -0.004344179295003414, 0.07495466619729996, 0.02860085479915142, 0.08140437304973602, 0.012108813971281052, -0.03583429381251335, 0.07284868508577347, -0.01211130... |
40,937 | 40,937 | ['Chris Roadknight', 'Uwe Aickelin', 'Alex Ladas', 'Daniele Soria', 'John Scholefield', 'Lindy Durrant'] | 1307.1601v1 | In this paper, we describe a dataset relating to cellular and physical
conditions of patients who are operated upon to remove colorectal tumours. This
data provides a unique insight into immunological status at the point of tumour
removal, tumour classification and post-operative survival. Attempts are made
to cluster ... | Biomarker Clustering of Colorectal Cancer Data to Complement Clinical
Classification | 2,013 | http://arxiv.org/pdf/1307.1601v1 | Title Biomarker Clustering Colorectal Cancer Data Complement Clinical Classification Summary paper describe dataset relating cellular physical condition patient operated upon remove colorectal tumour data provides unique insight immunological status point tumour removal tumour classification postoperative survival Atte... | [0.0014647721545770764, 0.014707548543810844, -0.030687373131513596, -0.030976735055446625, 0.020568471401929855, 0.02639913372695446, 0.06692583113908768, 0.002720748772844672, 0.004855817649513483, 0.006688028108328581, 0.016648555174469948, 0.012128260917961597, -0.010612144134938717, 0.053356025367975235, -0.017302... |
40,938 | 40,938 | ['Wei Chen', 'Dayu Huang', 'Ankur A. Kulkarni', 'Jayakrishnan Unnikrishnan', 'Quanyan Zhu', 'Prashant Mehta', 'Sean Meyn', 'Adam Wierman'] | 1307.1759v2 | Neuro-dynamic programming is a class of powerful techniques for approximating
the solution to dynamic programming equations. In their most computationally
attractive formulations, these techniques provide the approximate solution only
within a prescribed finite-dimensional function class. Thus, the question that
always... | Approximate dynamic programming using fluid and diffusion approximations
with applications to power management | 2,013 | http://arxiv.org/pdf/1307.1759v2 | Title Approximate dynamic programming using fluid diffusion approximation application power management Summary Neurodynamic programming class powerful technique approximating solution dynamic programming equation computationally attractive formulation technique provide approximate solution within prescribed finitedimen... | [-0.02322705090045929, -0.047192782163619995, -0.025683214887976646, 0.010102207772433758, 0.011198441497981548, 0.012306314893066883, -0.012292364612221718, 0.022956961765885353, -0.06953781098127365, 0.003924157936125994, 0.00637594610452652, -0.04540347680449486, 0.04237447306513786, 0.019423330202698708, 0.04697559... |
40,939 | 40,939 | ['Alexandros Ladas', 'Uwe Aickelin', 'Jon Garibaldi', 'Eamonn Ferguson'] | 1307.1998v1 | It has become apparent that models that have been applied widely in
economics, including Machine Learning techniques and Data Mining methods,
should take into consideration principles that derive from the theories of
Personality Psychology in order to discover more comprehensive knowledge
regarding complicated economic... | Using Clustering to extract Personality Information from socio economic
data | 2,013 | http://arxiv.org/pdf/1307.1998v1 | Title Using Clustering extract Personality Information socio economic data Summary become apparent model applied widely economics including Machine Learning technique Data Mining method take consideration principle derive theory Personality Psychology order discover comprehensive knowledge regarding complicated economi... | [0.003758142702281475, 0.05658330023288727, -0.049888063222169876, -0.00897215399891138, 0.00617763539776206, 0.03135949373245239, 0.059001680463552475, -0.015708697959780693, 0.05577370524406433, 0.04016723483800888, -0.010362125933170319, 0.08771204948425293, 0.024240588769316673, -0.0058445711620152, 0.0357631221413... |
40,940 | 40,940 | ['Ian Dent', 'Tony Craig', 'Uwe Aickelin', 'Tom Rodden'] | 1307.2111v1 | Changes in the UK electricity market, particularly with the roll out of smart
meters, will provide greatly increased opportunities for initiatives intended
to change households' electricity usage patterns for the benefit of the overall
system. Users show differences in their regular behaviours and clustering
households... | Finding the creatures of habit; Clustering households based on their
flexibility in using electricity | 2,013 | http://arxiv.org/pdf/1307.2111v1 | Title Finding creature habit Clustering household based flexibility using electricity Summary Changes UK electricity market particularly roll smart meter provide greatly increased opportunity initiative intended change household electricity usage pattern benefit overall system Users show difference regular behaviour cl... | [-0.02241675741970539, 0.016756108030676842, -0.041923243552446365, -0.04543749615550041, 0.006067653186619282, 0.004541017580777407, 0.07044794410467148, -0.014651782810688019, -0.001062196446582675, -0.01968437246978283, 0.020720917731523514, 0.07683153450489044, 0.001220217440277338, 0.02875237539410591, 0.029359845... |
40,941 | 40,941 | ['T. Chandrasekhar', 'K. Thangavel', 'E. Elayaraja', 'E. N. Sathishkumar'] | 1307.3337v1 | Microarrays are made it possible to simultaneously monitor the expression
profiles of thousands of genes under various experimental conditions.
Identification of co-expressed genes and coherent patterns is the central goal
in microarray or gene expression data analysis and is an important task in
bioinformatics researc... | Unsupervised Gene Expression Data using Enhanced Clustering Method | 2,013 | http://arxiv.org/pdf/1307.3337v1 | Title Unsupervised Gene Expression Data using Enhanced Clustering Method Summary Microarrays made possible simultaneously monitor expression profile thousand gene various experimental condition Identification coexpressed gene coherent pattern central goal microarray gene expression data analysis important task bioinfor... | [-0.019599605351686478, -0.004435351584106684, -0.064195416867733, -0.007939603179693222, -0.009141480550169945, 0.030825939029455185, 0.1067407950758934, 0.05928774178028107, 0.03882347419857979, 0.04059026390314102, 0.010108370333909988, 0.06508666276931763, 0.015198986977338791, 0.0809977799654007, 0.005348325707018... |
40,942 | 40,942 | ['T. Chandrasekhar', 'K. Thangavel', 'E. Elayaraja'] | 1307.3549v1 | Microarray technology is a process that allows thousands of genes
simultaneously monitor to various experimental conditions. It is used to
identify the co-expressed genes in specific cells or tissues that are actively
used to make proteins, This method is used to analysis the gene expression, an
important task in bioin... | Performance Analysis of Clustering Algorithms for Gene Expression Data | 2,013 | http://arxiv.org/pdf/1307.3549v1 | Title Performance Analysis Clustering Algorithms Gene Expression Data Summary Microarray technology process allows thousand gene simultaneously monitor various experimental condition used identify coexpressed gene specific cell tissue actively used make protein method used analysis gene expression important task bioinf... | [-0.020510390400886536, -0.04422977939248085, -0.05357768386602402, -0.01776638813316822, -0.030309131368994713, 0.03006821870803833, 0.10004349052906036, 0.0656217485666275, 0.06609673798084259, 0.027606075629591942, 0.04012655094265938, 0.045290976762771606, 0.028080647811293602, 0.06018907204270363, 0.01319848187267... |
40,943 | 40,943 | ['Alexandros Ntoulas', 'Omar Alonso', 'Vasilis Kandylas'] | 1307.3673v1 | As the number of applications that use machine learning algorithms increases,
the need for labeled data useful for training such algorithms intensifies.
Getting labels typically involves employing humans to do the annotation,
which directly translates to training and working costs. Crowdsourcing
platforms have made l... | A Data Management Approach for Dataset Selection Using Human Computation | 2,013 | http://arxiv.org/pdf/1307.3673v1 | Title Data Management Approach Dataset Selection Using Human Computation Summary number application use machine learning algorithm increase need labeled data useful training algorithm intensifies Getting label typically involves employing human annotation directly translates training working cost Crowdsourcing platform... | [0.042136918753385544, 0.050152212381362915, -0.035604480654001236, 0.020803548395633698, -0.010508818551898003, -0.013275242410600185, 0.054957907646894455, 0.027309149503707886, 0.004711483605206013, -0.030976571142673492, -0.0066573829390108585, 0.04373926296830177, -0.021210340782999992, 0.005793533753603697, 0.009... |
40,944 | 40,944 | ['Junzhou Zhao'] | 1307.3687v1 | Constrained connection is the phenomenon that a reviewer can only review a
subset of products/services due to narrow range of interests or limited
attention capacity. In this work, we study how constrained connections can
affect estimation performance in online review systems (ORS). We find that
reviewers' constrained ... | On Analyzing Estimation Errors due to Constrained Connections in Online
Review Systems | 2,013 | http://arxiv.org/pdf/1307.3687v1 | Title Analyzing Estimation Errors due Constrained Connections Online Review Systems Summary Constrained connection phenomenon reviewer review subset productsservices due narrow range interest limited attention capacity work study constrained connection affect estimation performance online review system ORS find reviewe... | [0.028402334079146385, 0.051009826362133026, -0.039456021040678024, -0.0614229179918766, -0.009573481976985931, -0.03421053662896156, 0.055643919855356216, 0.01387146394699812, -0.06743887066841125, -0.02119378186762333, -0.03271622210741043, -0.027623215690255165, 0.05851765349507332, 0.08928249776363373, -0.028147557... |
40,945 | 40,945 | ['Khalid Raza', 'Atif N Hasan'] | 1307.7050v1 | Prostate cancer is among the most common cancer in males and its
heterogeneity is well known. Its early detection helps making therapeutic
decision. There is no standard technique or procedure yet which is full-proof
in predicting cancer class. The genomic level changes can be detected in gene
expression data and those... | A Comprehensive Evaluation of Machine Learning Techniques for Cancer
Class Prediction Based on Microarray Data | 2,013 | http://arxiv.org/pdf/1307.7050v1 | Title Comprehensive Evaluation Machine Learning Techniques Cancer Class Prediction Based Microarray Data Summary Prostate cancer among common cancer male heterogeneity well known early detection help making therapeutic decision standard technique procedure yet fullproof predicting cancer class genomic level change dete... | [0.0033355664927512407, 0.05002362281084061, -0.05030790716409683, -0.03765026852488518, -0.002796438056975603, 0.034871749579906464, 0.10276223719120026, 0.004538004286587238, 0.005652936641126871, 0.031441379338502884, 0.06327695399522781, 0.02082367055118084, 0.008969173766672611, 0.05946820601820946, -0.01274604350... |
40,946 | 40,946 | ['Mehrdad Mahdavi', 'Rong Jin'] | 1307.7192v1 | It is well known that the optimal convergence rate for stochastic
optimization of smooth functions is $O(1/\sqrt{T})$, which is same as
stochastic optimization of Lipschitz continuous convex functions. This is in
contrast to optimizing smooth functions using full gradients, which yields a
convergence rate of $O(1/T^2)$... | MixedGrad: An O(1/T) Convergence Rate Algorithm for Stochastic Smooth
Optimization | 2,013 | http://arxiv.org/pdf/1307.7192v1 | Title MixedGrad O1T Convergence Rate Algorithm Stochastic Smooth Optimization Summary well known optimal convergence rate stochastic optimization smooth function O1sqrtT stochastic optimization Lipschitz continuous convex function contrast optimizing smooth function using full gradient yield convergence rate O1T2 work ... | [-0.015610638074576855, 0.015318035148084164, 0.008014267310500145, 0.02295849844813347, 0.000488869147375226, -0.04797201603651047, -0.00610780343413353, 0.03913624584674835, -0.012003039941191673, 0.019873134791851044, 0.005619429517537355, -0.025122396647930145, 0.03879600763320923, 0.04168173298239708, -0.013990332... |
40,947 | 40,947 | ['Harjinder Kaur', 'Gurpreet Singh', 'Jaspreet Minhas'] | 1307.7286v1 | Intrusion detection is so much popular since the last two decades where
intrusion is attempted to break into or misuse the system. It is mainly of two
types based on the intrusions, first is Misuse or signature based detection and
the other is Anomaly detection. In this paper Machine learning based methods
which are on... | A Review of Machine Learning based Anomaly Detection Techniques | 2,013 | http://arxiv.org/pdf/1307.7286v1 | Title Review Machine Learning based Anomaly Detection Techniques Summary Intrusion detection much popular since last two decade intrusion attempted break misuse system mainly two type based intrusion first Misuse signature based detection Anomaly detection paper Machine learning based method one type Anomaly detection ... | [0.015317779034376144, -0.020651519298553467, 0.009194825775921345, 0.021221185103058815, -0.0441402792930603, -0.036111246794462204, 0.04123101010918617, 0.010614024475216866, 0.03420250117778778, -0.028042377904057503, 0.09553268551826477, 0.027753127738833427, -0.01630905270576477, 0.07726789265871048, 0.00530022196... |
40,948 | 40,948 | ['Amin Babazadeh Sangar', 'Seyyed Reza Khaze', 'Laya Ebrahimi'] | 1307.7429v1 | Anticipating the political behavior of people will be considerable help for
election candidates to assess the possibility of their success and to be
acknowledged about the public motivations to select them. In this paper, we
provide a general schematic of the architecture of participation anticipating
system in preside... | Participation anticipating in elections using data mining methods | 2,013 | http://arxiv.org/pdf/1307.7429v1 | Title Participation anticipating election using data mining method Summary Anticipating political behavior people considerable help election candidate ass possibility success acknowledged public motivation select paper provide general schematic architecture participation anticipating system presidential election using ... | [-0.0023292740806937218, 0.084605373442173, -0.03186110407114029, -0.02069942094385624, -0.004340650048106909, -0.004336951300501823, -0.031320489943027496, 0.0001415714796166867, 0.03191186115145683, -0.009611185640096664, 0.0903376117348671, -0.012765537016093731, -0.013255746103823185, 0.039335425943136215, -0.02004... |
40,949 | 40,949 | ['Farhad Soleimanian Gharehchopogh', 'Seyyed Reza Khaze'] | 1307.7432v1 | Blogs are the recent emerging media which relies on information technology
and technological advance. Since the mass media in some less-developed and
developing countries are in government service and their policies are developed
based on governmental interests, so blogs are provided for ideas and exchanging
opinions. ... | Data mining application for cyber space users tendency in blog writing:
a case study | 2,013 | http://arxiv.org/pdf/1307.7432v1 | Title Data mining application cyber space user tendency blog writing case study Summary Blogs recent emerging medium relies information technology technological advance Since mass medium lessdeveloped developing country government service policy developed based governmental interest blog provided idea exchanging opinio... | [0.040099795907735825, 0.023446211591362953, -0.044055353850126266, -0.048370361328125, -0.010705867782235146, -0.03387831151485443, 0.027980811893939972, -0.03441278263926506, 0.014473636634647846, -0.047938741743564606, 0.05118077993392944, 0.002922658808529377, 0.003250810783356428, 0.0513211265206337, -0.0211146436... |
40,950 | 40,950 | ['R. J. Lyon', 'J. M. Brooke', 'J. D. Knowles', 'B. W. Stappers'] | 1307.8012v1 | The domain of radio astronomy is currently facing significant computational
challenges, foremost amongst which are those posed by the development of the
world's largest radio telescope, the Square Kilometre Array (SKA). Preliminary
specifications for this instrument suggest that the final design will
incorporate betwee... | A Study on Classification in Imbalanced and Partially-Labelled Data
Streams | 2,013 | http://arxiv.org/pdf/1307.8012v1 | Title Study Classification Imbalanced PartiallyLabelled Data Streams Summary domain radio astronomy currently facing significant computational challenge foremost amongst posed development world largest radio telescope Square Kilometre Array SKA Preliminary specification instrument suggest final design incorporate 2000 ... | [0.03313268721103668, 0.013346614316105843, 0.002360785147175193, -0.03534968942403793, 0.000946431013289839, 0.05844506248831749, 0.04527443274855614, -0.005228640045970678, 0.028634045273065567, -0.021008146926760674, 0.01184335257858038, -0.021384410560131073, 0.02841917611658573, 0.05485237389802933, -0.01563506014... |
40,951 | 40,951 | ['Fayao Liu', 'Luping Zhou', 'Chunhua Shen', 'Jianping Yin'] | 1310.0890v1 | To achieve effective and efficient detection of Alzheimer's disease (AD),
many machine learning methods have been introduced into this realm. However,
the general case of limited training samples, as well as different feature
representations typically makes this problem challenging. In this work, we
propose a novel mul... | Multiple Kernel Learning in the Primal for Multi-modal Alzheimer's
Disease Classification | 2,013 | http://arxiv.org/pdf/1310.0890v1 | Title Multiple Kernel Learning Primal Multimodal Alzheimers Disease Classification Summary achieve effective efficient detection Alzheimers disease AD many machine learning method introduced realm However general case limited training sample well different feature representation typically make problem challenging work ... | [-0.012910126708447933, 0.026467129588127136, -0.026210321113467216, 0.04424434155225754, 0.025331350043416023, -0.007827386260032654, 0.04317941889166832, 0.0547591894865036, 0.04526562616229057, -0.016802562400698662, -0.02103344164788723, 0.019881630316376686, 0.025447724387049675, 0.019262008368968964, 0.0423227436... |
40,952 | 40,952 | ['Dan He', 'Irina Rish', 'David Haws', 'Simon Teyssedre', 'Zivan Karaman', 'Laxmi Parida'] | 1310.1659v1 | Whole genome prediction of complex phenotypic traits using high-density
genotyping arrays has attracted a great deal of attention, as it is relevant to
the fields of plant and animal breeding and genetic epidemiology. As the number
of genotypes is generally much bigger than the number of samples, predictive
models suff... | MINT: Mutual Information based Transductive Feature Selection for
Genetic Trait Prediction | 2,013 | http://arxiv.org/pdf/1310.1659v1 | Title MINT Mutual Information based Transductive Feature Selection Genetic Trait Prediction Summary Whole genome prediction complex phenotypic trait using highdensity genotyping array attracted great deal attention relevant field plant animal breeding genetic epidemiology number genotype generally much bigger number sa... | [-0.038179393857717514, 0.02483321540057659, -0.022472448647022247, -0.007480612024664879, 0.013874824158847332, 0.023677866905927658, -0.00757147092372179, 0.06803754717111588, 0.022217513993382454, -0.008756826631724834, 0.0192519910633564, 0.03011740744113922, 0.020069466903805733, 0.0029854855965822935, 0.004431898... |
40,953 | 40,953 | ['Kalpesh Adhatrao', 'Aditya Gaykar', 'Amiraj Dhawan', 'Rohit Jha', 'Vipul Honrao'] | 1310.2071v1 | An educational institution needs to have an approximate prior knowledge of
enrolled students to predict their performance in future academics. This helps
them to identify promising students and also provides them an opportunity to
pay attention to and improve those who would probably get lower grades. As a
solution, we... | Predicting Students' Performance Using ID3 And C4.5 Classification
Algorithms | 2,013 | http://arxiv.org/pdf/1310.2071v1 | Title Predicting Students Performance Using ID3 C45 Classification Algorithms Summary educational institution need approximate prior knowledge enrolled student predict performance future academic help identify promising student also provides opportunity pay attention improve would probably get lower grade solution deve... | [0.02212466672062874, 0.005041089840233326, -0.04993841424584389, 0.00900699757039547, 0.010933976620435715, -0.0013126450357958674, 0.010068457573652267, 0.01803361438214779, 0.01436610147356987, -0.06904782354831696, 0.026405317708849907, 0.004611867479979992, 0.027348414063453674, 0.05874902009963989, -0.02427620626... |
40,954 | 40,954 | ['Ofer Dekel', 'Jian Ding', 'Tomer Koren', 'Yuval Peres'] | 1310.2997v2 | We study the adversarial multi-armed bandit problem in a setting where the
player incurs a unit cost each time he switches actions. We prove that the
player's $T$-round minimax regret in this setting is
$\widetilde{\Theta}(T^{2/3})$, thereby closing a fundamental gap in our
understanding of learning with bandit feedbac... | Bandits with Switching Costs: T^{2/3} Regret | 2,013 | http://arxiv.org/pdf/1310.2997v2 | Title Bandits Switching Costs T23 Regret Summary study adversarial multiarmed bandit problem setting player incurs unit cost time switch action prove player Tround minimax regret setting widetildeThetaT23 thereby closing fundamental gap understanding learning bandit feedback corresponding fullinformation version proble... | [0.007094045635312796, 0.018617622554302216, -0.012498113326728344, -0.014607604593038559, -0.013728602789342403, -0.020479347556829453, 0.014965766109526157, -0.00015777282533235848, -0.01125158742070198, -0.019871553406119347, -0.021501295268535614, 0.010306610725820065, -0.06055688485503197, 0.02185981161892414, 0.0... |
40,955 | 40,955 | ['Sameh Sorour', 'Yves Lostanlen', 'Shahrokh Valaee'] | 1310.3407v1 | One major bottleneck in the practical implementation of received signal
strength (RSS) based indoor localization systems is the extensive deployment
efforts required to construct the radio maps through fingerprinting. In this
paper, we aim to design an indoor localization scheme that can be directly
employed without bu... | Joint Indoor Localization and Radio Map Construction with Limited
Deployment Load | 2,013 | http://arxiv.org/pdf/1310.3407v1 | Title Joint Indoor Localization Radio Map Construction Limited Deployment Load Summary One major bottleneck practical implementation received signal strength RSS based indoor localization system extensive deployment effort required construct radio map fingerprinting paper aim design indoor localization scheme directly ... | [0.007863097824156284, -0.07054716348648071, 0.0029511256143450737, -0.09132955223321915, -0.014771559275686741, 0.018178924918174744, 0.018031073734164238, -0.032853689044713974, 0.014224521815776825, 0.01565549150109291, -0.047200560569763184, 0.06689725816249847, 0.044802017509937286, -0.041257165372371674, -0.00417... |
40,956 | 40,956 | ['Adam Vaughan', 'Stanislav V. Bohac'] | 1310.3567v3 | Fuel efficient Homogeneous Charge Compression Ignition (HCCI) engine
combustion timing predictions must contend with non-linear chemistry,
non-linear physics, period doubling bifurcation(s), turbulent mixing, model
parameters that can drift day-to-day, and air-fuel mixture state information
that cannot typically be res... | An Extreme Learning Machine Approach to Predicting Near Chaotic HCCI
Combustion Phasing in Real-Time | 2,013 | http://arxiv.org/pdf/1310.3567v3 | Title Extreme Learning Machine Approach Predicting Near Chaotic HCCI Combustion Phasing RealTime Summary Fuel efficient Homogeneous Charge Compression Ignition HCCI engine combustion timing prediction must contend nonlinear chemistry nonlinear physic period doubling bifurcation turbulent mixing model parameter drift da... | [-0.05232285335659981, -0.008873019367456436, -0.02826397493481636, 0.002160851377993822, 0.025346415117383003, 0.04696854203939438, -0.023852694779634476, 0.04311870038509369, 0.0031787690240889788, 0.00048216237337328494, 0.04219678044319153, 0.032362163066864014, -0.03337530419230461, 0.08328664302825928, 0.00937752... |
40,957 | 40,957 | ['Albrecht Zimmermann', 'Sruthi Moorthy', 'Zifan Shi'] | 1310.3607v1 | Most existing work on predicting NCAAB matches has been developed in a
statistical context. Trusting the capabilities of ML techniques, particularly
classification learners, to uncover the importance of features and learn their
relationships, we evaluated a number of different paradigms on this task. In
this paper, we ... | Predicting college basketball match outcomes using machine learning
techniques: some results and lessons learned | 2,013 | http://arxiv.org/pdf/1310.3607v1 | Title Predicting college basketball match outcome using machine learning technique result lesson learned Summary existing work predicting NCAAB match developed statistical context Trusting capability ML technique particularly classification learner uncover importance feature learn relationship evaluated number differen... | [0.00792941264808178, 0.038351673632860184, -0.008353613317012787, -0.0017629218054935336, -0.027412962168455124, 0.006059346254914999, -0.0417260080575943, 0.005423928610980511, -0.02066590078175068, -0.04131876677274704, 0.057476550340652466, 0.008405037224292755, 0.03719167783856392, 0.048758767545223236, 0.03542116... |
40,958 | 40,958 | ['Hamidreza Chitsaz', 'Mohammad Aminisharifabad'] | 1310.4223v1 | We consider the problem of exact learning of parameters of a linear RNA
energy model from secondary structure data. A necessary and sufficient
condition for learnability of parameters is derived, which is based on
computing the convex hull of union of translated Newton polytopes of input
sequences. The set of learned e... | Exact Learning of RNA Energy Parameters From Structure | 2,013 | http://arxiv.org/pdf/1310.4223v1 | Title Exact Learning RNA Energy Parameters Structure Summary consider problem exact learning parameter linear RNA energy model secondary structure data necessary sufficient condition learnability parameter derived based computing convex hull union translated Newton polytopes input sequence set learned energy parameter ... | [-0.011045293882489204, -0.0005020659300498664, -0.003602386685088277, 0.019598597660660744, 0.0057447501458227634, 0.000605453213211149, -0.030199503526091576, 0.0066517069935798645, -0.06558886170387268, -0.004134358838200569, 0.022168301045894623, 0.0064245727844536304, 0.01790858432650566, 0.050649214535951614, 0.0... |
40,959 | 40,959 | ['Francesco Orabona', 'Tamir Hazan', 'Anand D. Sarwate', 'Tommi Jaakkola'] | 1310.4227v1 | The maximum a-posteriori (MAP) perturbation framework has emerged as a useful
approach for inference and learning in high dimensional complex models. By
maximizing a randomly perturbed potential function, MAP perturbations generate
unbiased samples from the Gibbs distribution. Unfortunately, the computational
cost of g... | On Measure Concentration of Random Maximum A-Posteriori Perturbations | 2,013 | http://arxiv.org/pdf/1310.4227v1 | Title Measure Concentration Random Maximum APosteriori Perturbations Summary maximum aposteriori MAP perturbation framework emerged useful approach inference learning high dimensional complex model maximizing randomly perturbed potential function MAP perturbation generate unbiased sample Gibbs distribution Unfortunatel... | [-0.03035052679479122, -0.012614153325557709, -0.045289527624845505, -0.04041101038455963, -0.026992304250597954, -0.01928771659731865, -0.0421745702624321, -0.021059241145849228, 0.044263556599617004, 0.019720692187547684, 0.01682913489639759, 0.01195173617452383, -0.035834405571222305, -0.039834193885326385, 0.029015... |
40,960 | 40,960 | ['Juan Liu', 'Baochang Zhang', 'Linlin Shen', 'Jianzhuang Liu', 'Jason Zhao'] | 1310.4485v1 | Keystroke Dynamics is an important biometric solution for person
authentication. Based upon keystroke dynamics, this paper designs an embedded
password protection device, develops an online system, collects two public
databases for promoting the research on keystroke authentication, exploits the
Gabor filter bank to ch... | The BeiHang Keystroke Dynamics Authentication System | 2,013 | http://arxiv.org/pdf/1310.4485v1 | Title BeiHang Keystroke Dynamics Authentication System Summary Keystroke Dynamics important biometric solution person authentication Based upon keystroke dynamic paper design embedded password protection device develops online system collect two public database promoting research keystroke authentication exploit Gabor ... | [0.036486946046352386, -0.02462651953101158, -0.015098967589437962, 0.0019370558438822627, -0.01438783947378397, 0.014718289487063885, 0.02782430872321129, 0.01513643842190504, 0.014685709029436111, -0.03517898917198181, 0.03295932337641716, -0.023107903078198433, 0.05283375084400177, 0.05496611073613167, 0.03241043910... |
40,961 | 40,961 | ['Pokkuluri Kiran Sree', 'Inampudi Ramesh Babu', 'SSSN Usha Devi Nedunuri'] | 1310.4495v1 | CA has grown as potential classifier for addressing major problems in
bioinformatics. Lot of bioinformatics problems like predicting the protein
coding region, finding the promoter region, predicting the structure of protein
and many other problems in bioinformatics can be addressed through Cellular
Automata. Even thou... | Multiple Attractor Cellular Automata (MACA) for Addressing Major
Problems in Bioinformatics | 2,013 | http://arxiv.org/pdf/1310.4495v1 | Title Multiple Attractor Cellular Automata MACA Addressing Major Problems Bioinformatics Summary CA grown potential classifier addressing major problem bioinformatics Lot bioinformatics problem like predicting protein coding region finding promoter region predicting structure protein many problem bioinformatics address... | [0.028637440875172615, 0.033561110496520996, -0.040403395891189575, -0.0489492304623127, -0.002320995321497321, -0.007153079379349947, 0.0015621209749951959, -0.000411581015214324, -0.05031043291091919, -0.007211481221020222, 0.043871473520994186, 0.012410640716552734, 0.0116270761936903, 0.04291292652487755, -0.001111... |
40,962 | 40,962 | ['G. Srinivas Rao', 'A. V. Ramana'] | 1310.8467v1 | Routing packets opportunistically is an essential part of multihop ad hoc
wireless sensor networks. The existing routing techniques are not adaptive
opportunistic. In this paper we have proposed an adaptive opportunistic routing
scheme that routes packets opportunistically in order to ensure that packet
loss is avoided... | Reinforcement Learning Framework for Opportunistic Routing in WSNs | 2,013 | http://arxiv.org/pdf/1310.8467v1 | Title Reinforcement Learning Framework Opportunistic Routing WSNs Summary Routing packet opportunistically essential part multihop ad hoc wireless sensor network existing routing technique adaptive opportunistic paper proposed adaptive opportunistic routing scheme route packet opportunistically order ensure packet loss... | [-0.02284465916454792, -0.039355821907520294, -0.00026991692720912397, -0.08695081621408463, -0.08011777698993683, -0.05228058248758316, -0.043167196214199066, -0.020081844180822372, -0.02257227897644043, -0.021757667884230614, 0.05180550366640091, 0.06526938080787659, -0.03193339705467224, -0.0009171674028038979, 0.01... |
40,963 | 40,963 | ['Dhruv Mahajan', 'S. Sathiya Keerthi', 'S. Sundararajan', 'Leon Bottou'] | 1311.0636v1 | This paper proposes a novel parallel stochastic gradient descent (SGD) method
that is obtained by applying parallel sets of SGD iterations (each set
operating on one node using the data residing in it) for finding the direction
in each iteration of a batch descent method. The method has strong convergence
properties. E... | A Parallel SGD method with Strong Convergence | 2,013 | http://arxiv.org/pdf/1311.0636v1 | Title Parallel SGD method Strong Convergence Summary paper proposes novel parallel stochastic gradient descent SGD method obtained applying parallel set SGD iteration set operating one node using data residing finding direction iteration batch descent method method strong convergence property Experiments datasets high ... | [-0.02567952685058117, 0.008049188181757927, -0.005853272974491119, 0.004052863456308842, -0.021388238295912743, 0.018615171313285828, 0.03781728446483612, -0.032073792070150375, -0.0016552613815292716, 0.03665860369801521, 0.018222467973828316, 0.01235443539917469, 0.019321158528327942, -0.0032492990139871836, -0.0214... |
40,964 | 40,964 | ['Alexander Rakhlin', 'Karthik Sridharan'] | 1311.1869v1 | We provide several applications of Optimistic Mirror Descent, an online
learning algorithm based on the idea of predictable sequences. First, we
recover the Mirror Prox algorithm for offline optimization, prove an extension
to Holder-smooth functions, and apply the results to saddle-point type
problems. Next, we prove ... | Optimization, Learning, and Games with Predictable Sequences | 2,013 | http://arxiv.org/pdf/1311.1869v1 | Title Optimization Learning Games Predictable Sequences Summary provide several application Optimistic Mirror Descent online learning algorithm based idea predictable sequence First recover Mirror Prox algorithm offline optimization prove extension Holdersmooth function apply result saddlepoint type problem Next prove ... | [0.0034754062071442604, 0.029113424941897392, -0.05619359388947487, -0.017314104363322258, -0.05104200169444084, -0.03553945943713188, -0.022815153002738953, 0.005214865785092115, -0.04343428835272789, 0.019612180069088936, 0.048137158155441284, -0.010297629050910473, 0.0028327826876193285, 0.0683707669377327, 0.021817... |
40,965 | 40,965 | ['Amit Daniely', 'Nati Linial', 'Shai Shalev-Shwartz'] | 1311.2272v2 | The basic problem in the PAC model of computational learning theory is to
determine which hypothesis classes are efficiently learnable. There is
presently a dearth of results showing hardness of learning problems. Moreover,
the existing lower bounds fall short of the best known algorithms.
The biggest challenge in pr... | From average case complexity to improper learning complexity | 2,013 | http://arxiv.org/pdf/1311.2272v2 | Title average case complexity improper learning complexity Summary basic problem PAC model computational learning theory determine hypothesis class efficiently learnable presently dearth result showing hardness learning problem Moreover existing lower bound fall short best known algorithm biggest challenge proving comp... | [-0.02773536741733551, 0.04622664675116539, -0.015641719102859497, 0.01528140902519226, -0.03214150667190552, 0.004441718105226755, 0.032087016850709915, -0.017996730282902718, 0.0015464910538867116, 0.02146826684474945, 0.058743566274642944, 0.010161894373595715, 0.016187038272619247, -0.0033781761303544044, 0.0067173... |
40,966 | 40,966 | ['Moritz Hardt', 'Eric Price'] | 1311.2495v4 | We provide a new robust convergence analysis of the well-known power method
for computing the dominant singular vectors of a matrix that we call the noisy
power method. Our result characterizes the convergence behavior of the
algorithm when a significant amount noise is introduced after each
matrix-vector multiplicatio... | The Noisy Power Method: A Meta Algorithm with Applications | 2,013 | http://arxiv.org/pdf/1311.2495v4 | Title Noisy Power Method Meta Algorithm Applications Summary provide new robust convergence analysis wellknown power method computing dominant singular vector matrix call noisy power method result characterizes convergence behavior algorithm significant amount noise introduced matrixvector multiplication noisy power me... | [0.0010192787740379572, 0.04153474047780037, -0.025222236290574074, 0.0005520397098734975, -0.016625113785266876, -0.006960068829357624, -0.0002458220988046378, -0.028383692726492882, -0.010136079974472523, 0.03187909722328186, 0.05560959875583649, -0.0018074957188218832, 0.047163840383291245, -0.005584143567830324, 0.... |
40,967 | 40,967 | ['Christos Boutsidis', 'Alex Gittens', 'Prabhanjan Kambadur'] | 1311.2854v3 | Spectral clustering is one of the most important algorithms in data mining
and machine intelligence; however, its computational complexity limits its
application to truly large scale data analysis. The computational bottleneck in
spectral clustering is computing a few of the top eigenvectors of the
(normalized) Laplaci... | Spectral Clustering via the Power Method -- Provably | 2,013 | http://arxiv.org/pdf/1311.2854v3 | Title Spectral Clustering via Power Method Provably Summary Spectral clustering one important algorithm data mining machine intelligence however computational complexity limit application truly large scale data analysis computational bottleneck spectral clustering computing top eigenvectors normalized Laplacian matrix ... | [-0.009312434121966362, -0.041720565408468246, -0.030657444149255753, 0.00466013140976429, -0.012629942037165165, -0.016278840601444244, 0.015910737216472626, -0.014289086684584618, 0.0006157367024570704, 0.012797555886209011, 0.01974419876933098, 0.044128164649009705, 0.02000156044960022, -0.008394671604037285, 0.0172... |
40,968 | 40,968 | ['Nan Du', 'Le Song', 'Manuel Gomez Rodriguez', 'Hongyuan Zha'] | 1311.3669v1 | If a piece of information is released from a media site, can it spread, in 1
month, to a million web pages? This influence estimation problem is very
challenging since both the time-sensitive nature of the problem and the issue
of scalability need to be addressed simultaneously. In this paper, we propose a
randomized a... | Scalable Influence Estimation in Continuous-Time Diffusion Networks | 2,013 | http://arxiv.org/pdf/1311.3669v1 | Title Scalable Influence Estimation ContinuousTime Diffusion Networks Summary piece information released medium site spread 1 month million web page influence estimation problem challenging since timesensitive nature problem issue scalability need addressed simultaneously paper propose randomized algorithm influence es... | [-0.005476965103298426, -0.024961471557617188, -0.041756466031074524, -0.034628983587026596, -0.041555315256118774, -0.08329758793115616, 0.02968105673789978, -0.02644147351384163, 0.003525223582983017, 0.0035948611330240965, 0.014158732257783413, 0.02682960219681263, 0.0060806311666965485, 0.0755024254322052, 0.024257... |
40,969 | 40,969 | ['Shaona Ghosh', 'Adam Prugel-Bennett'] | 1311.5022v3 | On-line linear optimization on combinatorial action sets (d-dimensional
actions) with bandit feedback, is known to have complexity in the order of the
dimension of the problem. The exponential weighted strategy achieves the best
known regret bound that is of the order of $d^{2}\sqrt{n}$ (where $d$ is the
dimension of t... | Extended Formulations for Online Linear Bandit Optimization | 2,013 | http://arxiv.org/pdf/1311.5022v3 | Title Extended Formulations Online Linear Bandit Optimization Summary Online linear optimization combinatorial action set ddimensional action bandit feedback known complexity order dimension problem exponential weighted strategy achieves best known regret bound order d2sqrtn dimension problem n time horizon However str... | [-0.00047512687160633504, 0.05714038386940956, -0.0180160291492939, -0.04867197573184967, -0.021437423303723335, -0.03911413252353668, 0.01024189218878746, 0.0359378308057785, -0.03437339514493942, -0.026953190565109253, 0.04475192725658417, 0.00586831197142601, -0.04815716668963432, 0.05701917037367821, 0.022504130378... |
40,970 | 40,970 | ['Smriti Bhagat', 'Udi Weinsberg', 'Stratis Ioannidis', 'Nina Taft'] | 1311.6802v2 | Recommender systems leverage user demographic information, such as age,
gender, etc., to personalize recommendations and better place their targeted
ads. Oftentimes, users do not volunteer this information due to privacy
concerns, or due to a lack of initiative in filling out their online profiles.
We illustrate a new ... | Recommending with an Agenda: Active Learning of Private Attributes using
Matrix Factorization | 2,013 | http://arxiv.org/pdf/1311.6802v2 | Title Recommending Agenda Active Learning Private Attributes using Matrix Factorization Summary Recommender system leverage user demographic information age gender etc personalize recommendation better place targeted ad Oftentimes user volunteer information due privacy concern due lack initiative filling online profile... | [0.02364696003496647, 0.044878192245960236, -0.011577319353818893, 0.011468187905848026, 0.0005908900639042258, -0.008883767761290073, 0.08278031647205353, 0.019730426371097565, 0.036792777478694916, -0.008317641913890839, -0.049978505820035934, 0.042599115520715714, 0.023693177849054337, 0.1051623746752739, -0.0199203... |
40,971 | 40,971 | ['Kareem Amin', 'Afshin Rostamizadeh', 'Umar Syed'] | 1311.6838v1 | Inspired by real-time ad exchanges for online display advertising, we
consider the problem of inferring a buyer's value distribution for a good when
the buyer is repeatedly interacting with a seller through a posted-price
mechanism. We model the buyer as a strategic agent, whose goal is to maximize
her long-term surplu... | Learning Prices for Repeated Auctions with Strategic Buyers | 2,013 | http://arxiv.org/pdf/1311.6838v1 | Title Learning Prices Repeated Auctions Strategic Buyers Summary Inspired realtime ad exchange online display advertising consider problem inferring buyer value distribution good buyer repeatedly interacting seller postedprice mechanism model buyer strategic agent whose goal maximize longterm surplus interested mechani... | [0.06913602352142334, 0.052049778401851654, -0.03112296760082245, -0.040448013693094254, -0.04191980138421059, -0.0360114723443985, 0.012269781902432442, -0.010073011741042137, -0.02444063499569893, -0.04586336016654968, -0.03535198047757149, -0.028022712096571922, -0.003915885929018259, 0.12985669076442719, -0.0223915... |
40,972 | 40,972 | ['Tianbao Yang', 'Shenghuo Zhu', 'Rong Jin', 'Yuanqing Lin'] | 1312.1031v2 | In \citep{Yangnips13}, the author presented distributed stochastic dual
coordinate ascent (DisDCA) algorithms for solving large-scale regularized loss
minimization. Extraordinary performances have been observed and reported for
the well-motivated updates, as referred to the practical updates, compared to
the naive upda... | Analysis of Distributed Stochastic Dual Coordinate Ascent | 2,013 | http://arxiv.org/pdf/1312.1031v2 | Title Analysis Distributed Stochastic Dual Coordinate Ascent Summary citepYangnips13 author presented distributed stochastic dual coordinate ascent DisDCA algorithm solving largescale regularized loss minimization Extraordinary performance observed reported wellmotivated update referred practical update compared naive ... | [-0.01674988865852356, 0.020872026681900024, -0.00979660451412201, -0.00908399187028408, 0.0339294895529747, -0.007554362062364817, 0.011466003023087978, -0.016312235966324806, 0.007062052842229605, 0.02451058104634285, 0.043146923184394836, -0.023566195741295815, 0.030163822695612907, 0.003762084525078535, -0.02317568... |
40,973 | 40,973 | ['Robert Kleinberg', 'Aleksandrs Slivkins', 'Eli Upfal'] | 1312.1277v2 | In a multi-armed bandit problem, an online algorithm chooses from a set of
strategies in a sequence of trials so as to maximize the total payoff of the
chosen strategies. While the performance of bandit algorithms with a small
finite strategy set is quite well understood, bandit problems with large
strategy sets are st... | Bandits and Experts in Metric Spaces | 2,013 | http://arxiv.org/pdf/1312.1277v2 | Title Bandits Experts Metric Spaces Summary multiarmed bandit problem online algorithm chooses set strategy sequence trial maximize total payoff chosen strategy performance bandit algorithm small finite strategy set quite well understood bandit problem large strategy set still topic active investigation motivated pract... | [-0.009663126431405544, 0.05846431106328964, -0.032465409487485886, -0.012453884817659855, -0.026465101167559624, -0.014569409191608429, 0.03698282688856125, 0.05300457403063774, 0.012568565085530281, -0.011478906497359276, -0.01410318911075592, -0.00037840628647245467, -0.05006938427686691, 0.054599784314632416, 0.037... |
40,974 | 40,974 | ['Ferhat Özgür Çatak', 'Mehmet Erdal Balaban'] | 1312.4108v1 | Although Support Vector Machine (SVM) algorithm has a high generalization
property to classify for unseen examples after training phase and it has small
loss value, the algorithm is not suitable for real-life classification and
regression problems. SVMs cannot solve hundreds of thousands examples in
training dataset. I... | A MapReduce based distributed SVM algorithm for binary classification | 2,013 | http://arxiv.org/pdf/1312.4108v1 | Title MapReduce based distributed SVM algorithm binary classification Summary Although Support Vector Machine SVM algorithm high generalization property classify unseen example training phase small loss value algorithm suitable reallife classification regression problem SVMs cannot solve hundred thousand example traini... | [0.02960212528705597, -0.01033756323158741, -0.009603014215826988, 0.015670046210289, -0.004149139858782291, 0.05057276040315628, 0.06886381655931473, 0.02282813936471939, 0.048280857503414154, -0.01618228107690811, 0.03338008373975754, 0.010625648312270641, 0.021915026009082794, 0.020614443346858025, -0.01939245127141... |
40,975 | 40,975 | ['Gabriele Oliva', 'Roberto Setola', 'Christoforos N. Hadjicostis'] | 1312.4176v3 | In this paper we provide a fully distributed implementation of the k-means
clustering algorithm, intended for wireless sensor networks where each agent is
endowed with a possibly high-dimensional observation (e.g., position, humidity,
temperature, etc.) The proposed algorithm, by means of one-hop communication,
partiti... | Distributed k-means algorithm | 2,013 | http://arxiv.org/pdf/1312.4176v3 | Title Distributed kmeans algorithm Summary paper provide fully distributed implementation kmeans clustering algorithm intended wireless sensor network agent endowed possibly highdimensional observation eg position humidity temperature etc proposed algorithm mean onehop communication partition agent measuredependent gro... | [-0.02904057316482067, -0.06854823231697083, -0.019813748076558113, -0.04097357764840126, -0.009352781809866428, -0.00965588167309761, 0.05055515095591545, -0.01958255097270012, 0.03120160661637783, 0.007319129537791014, 0.010587744414806366, 0.08723427355289459, 0.0313677117228508, -0.024458929896354675, -0.0164403207... |
40,976 | 40,976 | ['Yaqub Alwan', 'Zoran Cvetkovic', 'Michael Curtis'] | 1312.5354v2 | We studied classification of human ECGs labelled as normal sinus rhythm,
ventricular fibrillation and ventricular tachycardia by means of support vector
machines in different representation spaces, using different observation
lengths. ECG waveform segments of duration 0.5-4 s, their Fourier magnitude
spectra, and lower... | Classification of Human Ventricular Arrhythmia in High Dimensional
Representation Spaces | 2,013 | http://arxiv.org/pdf/1312.5354v2 | Title Classification Human Ventricular Arrhythmia High Dimensional Representation Spaces Summary studied classification human ECGs labelled normal sinus rhythm ventricular fibrillation ventricular tachycardia mean support vector machine different representation space using different observation length ECG waveform segm... | [-0.02121356688439846, -0.07883370667695999, -0.007704783696681261, 0.012148004025220871, 0.05865132063627243, 0.027786027640104294, 0.040896225720644, 0.011208959855139256, -0.0014073821948841214, 0.015018830075860023, 0.037309613078832626, -0.03068230114877224, 0.04566248878836632, 0.023490238934755325, -0.0131244137... |
40,977 | 40,977 | ['W. Liu', 'H. Liu', 'D. Tao', 'Y. Wang', 'K. Lu'] | 1312.6180v1 | With the rapid advance of Internet technology and smart devices, users often
need to manage large amounts of multimedia information using smart devices,
such as personal image and video accessing and browsing. These requirements
heavily rely on the success of image (video) annotation, and thus large scale
image annotat... | Manifold regularized kernel logistic regression for web image annotation | 2,013 | http://arxiv.org/pdf/1312.6180v1 | Title Manifold regularized kernel logistic regression web image annotation Summary rapid advance Internet technology smart device user often need manage large amount multimedia information using smart device personal image video accessing browsing requirement heavily rely success image video annotation thus large scale... | [0.014737071469426155, -0.02566034533083439, -0.01761402003467083, 0.01764518767595291, 0.014676563441753387, 0.010736431926488876, 0.03960264474153519, 0.037192922085523605, 0.028936665505170822, -0.050272852182388306, 0.04193749651312828, 0.02295149303972721, -0.023005712777376175, 0.0303631741553545, 0.0498207621276... |
40,978 | 40,978 | ['Luis Marujo', 'Anatole Gershman', 'Jaime Carbonell', 'David Martins de Matos', 'João P. Neto'] | 1312.6597v2 | In this work, we propose two stochastic architectural models (CMC and CMC-M)
with two layers of classifiers applicable to datasets with one and multiple
skewed classes. This distinction becomes important when the datasets have a
large number of classes. Therefore, we present a novel solution to imbalanced
multiclass le... | Co-Multistage of Multiple Classifiers for Imbalanced Multiclass Learning | 2,013 | http://arxiv.org/pdf/1312.6597v2 | Title CoMultistage Multiple Classifiers Imbalanced Multiclass Learning Summary work propose two stochastic architectural model CMC CMCM two layer classifier applicable datasets one multiple skewed class distinction becomes important datasets large number class Therefore present novel solution imbalanced multiclass lear... | [-0.007224293425679207, -0.02073262631893158, -0.027690371498465538, -0.005434877704828978, -0.01454142015427351, 0.013203087262809277, 0.004545657429844141, 0.008178765885531902, -0.007132458966225386, -0.0864437073469162, -0.023007584735751152, 0.014381421729922295, -0.008029265329241753, 0.0008948540780693293, -0.02... |
40,979 | 40,979 | ['Pranjal Awasthi', 'Maria-Florina Balcan', 'Konstantin Voevodski'] | 1312.6724v3 | We study the design of interactive clustering algorithms for data sets
satisfying natural stability assumptions. Our algorithms start with any initial
clustering and only make local changes in each step; both are desirable
features in many applications. We show that in this constrained setting one can
still design prov... | Local algorithms for interactive clustering | 2,013 | http://arxiv.org/pdf/1312.6724v3 | Title Local algorithm interactive clustering Summary study design interactive clustering algorithm data set satisfying natural stability assumption algorithm start initial clustering make local change step desirable feature many application show constrained setting one still design provably efficient algorithm produce ... | [-0.053496330976486206, -0.0314425453543663, -0.0479523129761219, -0.037356190383434296, -0.015472076833248138, -0.031039319932460785, 0.04202471300959587, 0.035045232623815536, 0.06782004237174988, 0.02752435952425003, 0.04908397048711777, 0.06726004183292389, 0.023688729852437973, 0.04042540863156319, -0.007932973094... |
40,980 | 40,980 | ['Ahmed K. Farahat', 'Ahmed Elgohary', 'Ali Ghodsi', 'Mohamed S. Kamel'] | 1312.6838v1 | In today's information systems, the availability of massive amounts of data
necessitates the development of fast and accurate algorithms to summarize these
data and represent them in a succinct format. One crucial problem in big data
analytics is the selection of representative instances from large and
massively-distri... | Greedy Column Subset Selection for Large-scale Data Sets | 2,013 | http://arxiv.org/pdf/1312.6838v1 | Title Greedy Column Subset Selection Largescale Data Sets Summary today information system availability massive amount data necessitates development fast accurate algorithm summarize data represent succinct format One crucial problem big data analytics selection representative instance large massivelydistributed data f... | [-0.0016948145348578691, 0.06314875185489655, -0.046479467302560806, 0.03296172246336937, -0.010897084139287472, 0.01851133443415165, 0.002417157171294093, 0.07810366898775101, 0.024707598611712456, 0.026878103613853455, 0.03143556788563728, -0.007157328072935343, -0.01201583445072174, 0.0005245009670034051, 0.00589403... |
40,981 | 40,981 | ['Anupriya Gogna', 'Ankita Shukla', 'Angshul Majumdar'] | 1312.6872v1 | In this paper we address the problem of recovering a matrix, with inherent
low rank structure, from its lower dimensional projections. This problem is
frequently encountered in wide range of areas including pattern recognition,
wireless sensor networks, control systems, recommender systems, image/video
reconstruction e... | Matrix recovery using Split Bregman | 2,013 | http://arxiv.org/pdf/1312.6872v1 | Title Matrix recovery using Split Bregman Summary paper address problem recovering matrix inherent low rank structure lower dimensional projection problem frequently encountered wide range area including pattern recognition wireless sensor network control system recommender system imagevideo reconstruction etc theory p... | [-0.035535380244255066, -0.01052936539053917, -0.02927820198237896, 0.0380781926214695, -0.012092416174709797, 0.01676681824028492, 0.014054128900170326, 0.09582503139972687, 0.0217551551759243, 0.005461183376610279, 0.049225326627492905, -0.029189446941018105, -0.0013533857418224216, 0.019204378128051758, -0.013911689... |
40,982 | 40,982 | ['Prashanth L. A.', 'Abhranil Chatterjee', 'Shalabh Bhatnagar'] | 1312.7292v2 | In this paper, we consider an intrusion detection application for Wireless
Sensor Networks (WSNs). We study the problem of scheduling the sleep times of
the individual sensors to maximize the network lifetime while keeping the
tracking error to a minimum. We formulate this problem as a
partially-observable Markov decis... | Two Timescale Convergent Q-learning for Sleep--Scheduling in Wireless
Sensor Networks | 2,013 | http://arxiv.org/pdf/1312.7292v2 | Title Two Timescale Convergent Qlearning SleepScheduling Wireless Sensor Networks Summary paper consider intrusion detection application Wireless Sensor Networks WSNs study problem scheduling sleep time individual sensor maximize network lifetime keeping tracking error minimum formulate problem partiallyobservable Mark... | [-0.036693722009658813, -0.014425288885831833, -0.0020875148475170135, -0.04063248634338379, -0.06455568224191666, -0.0324527807533741, 0.017121966928243637, -0.027721986174583435, -0.017287926748394966, -0.04141266271471977, 0.064125195145607, 0.01406125444918871, 0.0020029430743306875, 0.014406044967472553, -0.033117... |
40,983 | 40,983 | ['Christopher Genovese', 'Marco Perone-Pacifico', 'Isabella Verdinelli', 'Larry Wasserman'] | 1312.7567v1 | We derive nonparametric confidence intervals for the eigenvalues of the
Hessian at modes of a density estimate. This provides information about the
strength and shape of modes and can also be used as a significance test. We use
a data-splitting approach in which potential modes are identified using the
first half of th... | Nonparametric Inference For Density Modes | 2,013 | http://arxiv.org/pdf/1312.7567v1 | Title Nonparametric Inference Density Modes Summary derive nonparametric confidence interval eigenvalue Hessian mode density estimate provides information strength shape mode also used significance test use datasplitting approach potential mode identified using first half data inference done second half data get valid ... | [-0.05992446094751358, -0.01003600936383009, -0.013457928784191608, -0.0010952523443847895, -0.011730453930795193, -0.030125411227345467, 0.010653099045157433, 0.005984117742627859, -0.09936357289552689, 0.03270292282104492, -0.0550401508808136, 0.027716295793652534, 0.016984187066555023, 0.04547993093729019, 0.0117969... |
40,984 | 40,984 | ['Andrey Bernstein', 'Nahum Shimkin'] | 1312.7658v1 | Approachability theory, introduced by Blackwell (1956), provides fundamental
results on repeated games with vector-valued payoffs, and has been usefully
applied since in the theory of learning in games and to learning algorithms in
the online adversarial setup. Given a repeated game with vector payoffs, a
target set $S... | Response-Based Approachability and its Application to Generalized
No-Regret Algorithms | 2,013 | http://arxiv.org/pdf/1312.7658v1 | Title ResponseBased Approachability Application Generalized NoRegret Algorithms Summary Approachability theory introduced Blackwell 1956 provides fundamental result repeated game vectorvalued payoff usefully applied since theory learning game learning algorithm online adversarial setup Given repeated game vector payoff... | [0.01984550431370735, 0.04454702511429787, -0.03381237015128136, 0.010234987363219261, -0.033976368606090546, -0.03713057190179825, -0.02164146862924099, 0.0057821921072900295, -0.046956297010183334, 0.008896337822079659, -0.003477181540802121, -0.0016341862501576543, -0.020781155675649643, 0.01693395897746086, 0.00657... |
40,985 | 40,985 | ['Andreas Veit', 'Christoph Goebel', 'Rohit Tidke', 'Christoph Doblander', 'Hans-Arno Jacobsen'] | 1404.0200v1 | The increasing use of renewable energy sources with variable output, such as
solar photovoltaic and wind power generation, calls for Smart Grids that
effectively manage flexible loads and energy storage. The ability to forecast
consumption at different locations in distribution systems will be a key
capability of Smart... | Household Electricity Demand Forecasting -- Benchmarking
State-of-the-Art Methods | 2,014 | http://arxiv.org/pdf/1404.0200v1 | Title Household Electricity Demand Forecasting Benchmarking StateoftheArt Methods Summary increasing use renewable energy source variable output solar photovoltaic wind power generation call Smart Grids effectively manage flexible load energy storage ability forecast consumption different location distribution system k... | [-0.0379190556704998, 0.06061387062072754, -0.013775194063782692, -0.0326029397547245, 0.04633514955639839, 0.017824867740273476, 0.014609687961637974, -0.028686033561825752, 0.02616647072136402, 0.028822364285588264, 0.03994959965348244, 0.038869187235832214, 0.02512250281870365, 0.015619117766618729, 0.02870304323732... |
40,986 | 40,986 | ['Peter Banda', 'Christof Teuscher'] | 1404.0427v2 | The current biochemical information processing systems behave in a
predetermined manner because all features are defined during the design phase.
To make such unconventional computing systems reusable and programmable for
biomedical applications, adaptation, learning, and self-modification based on
external stimuli wou... | Learning Two-input Linear and Nonlinear Analog Functions with a Simple
Chemical System | 2,014 | http://arxiv.org/pdf/1404.0427v2 | Title Learning Twoinput Linear Nonlinear Analog Functions Simple Chemical System Summary current biochemical information processing system behave predetermined manner feature defined design phase make unconventional computing system reusable programmable biomedical application adaptation learning selfmodification based... | [-0.014848598279058933, 0.0014081965200603008, -0.02396402135491371, -0.028486911207437515, 0.014101103879511356, -0.015752140432596207, 0.019498640671372414, -0.002660108497366309, 0.07132178544998169, -0.007615420967340469, -0.024691296741366386, 0.015779174864292145, -0.043481457978487015, 0.06663356721401215, 0.027... |
40,987 | 40,987 | ['Pokkuluri Kiran Sree', 'Inampudi Ramesh Babu', 'SSSN Usha Devi N'] | 1404.0453v1 | This paper aims at providing a survey on the problems that can be easily
addressed by cellular automata in bioinformatics. Some of the authors have
proposed algorithms for addressing some problems in bioinformatics but the
application of cellular automata in bioinformatics is a virgin field in
research. None of the res... | Cellular Automata and Its Applications in Bioinformatics: A Review | 2,014 | http://arxiv.org/pdf/1404.0453v1 | Title Cellular Automata Applications Bioinformatics Review Summary paper aim providing survey problem easily addressed cellular automaton bioinformatics author proposed algorithm addressing problem bioinformatics application cellular automaton bioinformatics virgin field research None researcher tried relate major prob... | [0.023938070982694626, 0.002358368132263422, -0.04592857509851456, -0.04781568795442581, -0.053729742765426636, 0.01087858434766531, 0.043048810213804245, -0.009922889061272144, -0.025218116119503975, -0.022094490006566048, 0.03255058452486992, -0.014102030545473099, 0.04194922000169754, 0.0577927902340889, 0.006423369... |
40,988 | 40,988 | ['Da Kuang', 'Alex Gittens', 'Raffay Hamid'] | 1404.0466v2 | The dominant cost in solving least-square problems using Newton's method is
often that of factorizing the Hessian matrix over multiple values of the
regularization parameter ($\lambda$). We propose an efficient way to
interpolate the Cholesky factors of the Hessian matrix computed over a small
set of $\lambda$ values. ... | piCholesky: Polynomial Interpolation of Multiple Cholesky Factors for
Efficient Approximate Cross-Validation | 2,014 | http://arxiv.org/pdf/1404.0466v2 | Title piCholesky Polynomial Interpolation Multiple Cholesky Factors Efficient Approximate CrossValidation Summary dominant cost solving leastsquare problem using Newtons method often factorizing Hessian matrix multiple value regularization parameter lambda propose efficient way interpolate Cholesky factor Hessian matri... | [-0.07128561288118362, 3.4418244467815384e-05, 0.017461182549595833, 0.034172333776950836, 0.008366814814507961, -0.03999403864145279, 0.008577927947044373, 0.008852668106555939, 0.006860606838017702, -0.01119784452021122, 0.02435884438455105, 0.0074510956183075905, 0.0002963700389955193, -0.015511750243604183, 0.00927... |
40,989 | 40,989 | ['Pokkuluri Kiran Sree', 'Inampudi Ramesh Babu', 'SSSN Usha Devi N'] | 1404.1144v1 | Bioinformatics incorporates information regarding biological data storage,
accessing mechanisms and presentation of characteristics within this data. Most
of the problems in bioinformatics and be addressed efficiently by computer
techniques. This paper aims at building a classifier based on Multiple
Attractor Cellular ... | AIS-MACA- Z: MACA based Clonal Classifier for Splicing Site, Protein
Coding and Promoter Region Identification in Eukaryotes | 2,014 | http://arxiv.org/pdf/1404.1144v1 | Title AISMACA Z MACA based Clonal Classifier Splicing Site Protein Coding Promoter Region Identification Eukaryotes Summary Bioinformatics incorporates information regarding biological data storage accessing mechanism presentation characteristic within data problem bioinformatics addressed efficiently computer techniqu... | [0.025592301040887833, -0.011358577758073807, -0.022355547174811363, -0.04130639135837555, 0.010755693539977074, 0.009863986633718014, -0.0016092027071863413, -0.013583037070930004, -0.0030494099482893944, -0.003832188667729497, 0.007013603579252958, 0.022341134026646614, 0.04928319901227951, 0.05371585115790367, 0.014... |
40,990 | 40,990 | ['Joost Broekens', 'Tim Baarslag'] | 1404.2078v2 | Understanding the affective, cognitive and behavioural processes involved in
risk taking is essential for treatment and for setting environmental conditions
to limit damage. Using Temporal Difference Reinforcement Learning (TDRL) we
computationally investigated the effect of optimism in risk perception in a
variety of ... | Optimistic Risk Perception in the Temporal Difference error Explains the
Relation between Risk-taking, Gambling, Sensation-seeking and Low Fear | 2,014 | http://arxiv.org/pdf/1404.2078v2 | Title Optimistic Risk Perception Temporal Difference error Explains Relation Risktaking Gambling Sensationseeking Low Fear Summary Understanding affective cognitive behavioural process involved risk taking essential treatment setting environmental condition limit damage Using Temporal Difference Reinforcement Learning ... | [-0.006744008976966143, 0.029287565499544144, -0.009933690540492535, -0.0785992369055748, 0.03274562209844589, 0.027421578764915466, -0.05534638464450836, 0.030688051134347916, 0.03904818743467331, 0.056567851454019547, 0.03995613008737564, 0.014925181865692139, -0.0026456951163709164, 0.042137645184993744, 0.009937148... |
40,991 | 40,991 | ['Kerstin Eder', 'Chris Harper', 'Ute Leonards'] | 1404.2229v3 | The success of the human-robot co-worker team in a flexible manufacturing
environment where robots learn from demonstration heavily relies on the correct
and safe operation of the robot. How this can be achieved is a challenge that
requires addressing both technical as well as human-centric research questions.
In this ... | Towards the Safety of Human-in-the-Loop Robotics: Challenges and
Opportunities for Safety Assurance of Robotic Co-Workers | 2,014 | http://arxiv.org/pdf/1404.2229v3 | Title Towards Safety HumanintheLoop Robotics Challenges Opportunities Safety Assurance Robotic CoWorkers Summary success humanrobot coworker team flexible manufacturing environment robot learn demonstration heavily relies correct safe operation robot achieved challenge requires addressing technical well humancentric re... | [0.006857107859104872, 0.00939254742115736, 0.0010401303879916668, -0.060909904539585114, -0.009248628281056881, 0.007027375977486372, 0.04684048518538475, -0.01433063019067049, 0.0011605358449742198, -0.00948204193264246, -0.0030784234404563904, 0.046602800488471985, 0.020791416987776756, 0.03634591028094292, 0.021637... |
40,992 | 40,992 | ['Lee-Ad Gottlieb', 'Aryeh Kontorovich', 'Pinhas Nisnevitch'] | 1404.3368v3 | We present the first sample compression algorithm for nearest neighbors with
non-trivial performance guarantees. We complement these guarantees by
demonstrating almost matching hardness lower bounds, which show that our bound
is nearly optimal. Our result yields new insight into margin-based nearest
neighbor classifica... | Near-optimal sample compression for nearest neighbors | 2,014 | http://arxiv.org/pdf/1404.3368v3 | Title Nearoptimal sample compression nearest neighbor Summary present first sample compression algorithm nearest neighbor nontrivial performance guarantee complement guarantee demonstrating almost matching hardness lower bound show bound nearly optimal result yield new insight marginbased nearest neighbor classificatio... | [-0.02766427956521511, 0.023411227390170097, -0.0024303942918777466, 0.007983503863215446, -0.041377853602170944, 0.023063959553837776, 0.04366122931241989, 0.08624773472547531, -0.06457660347223282, 0.016636114567518234, 0.004951551090925932, 0.06610605865716934, 0.03242524340748787, -0.019617676734924316, 0.004570136... |
40,993 | 40,993 | ['Amit Daniely', 'Shai Shalev-Shwatz'] | 1404.3378v2 | Using the recently developed framework of [Daniely et al, 2014], we show that
under a natural assumption on the complexity of refuting random K-SAT formulas,
learning DNF formulas is hard. Furthermore, the same assumption implies the
hardness of learning intersections of $\omega(\log(n))$ halfspaces,
agnostically learn... | Complexity theoretic limitations on learning DNF's | 2,014 | http://arxiv.org/pdf/1404.3378v2 | Title Complexity theoretic limitation learning DNFs Summary Using recently developed framework Daniely et al 2014 show natural assumption complexity refuting random KSAT formula learning DNF formula hard Furthermore assumption implies hardness learning intersection omegalogn halfspaces agnostically learning conjunction... | [-0.0014909396413713694, 0.0468716099858284, 0.008793581277132034, 0.017973145470023155, -0.03722177445888519, -0.007519484031945467, -0.016680574044585228, 0.003940622787922621, 0.03364253416657448, 0.030302871018648148, 0.06432951241731644, -0.007050706539303064, 0.0035683424212038517, 0.005567284766584635, 0.0198644... |
40,994 | 40,994 | ['Karthik Raman', 'Thorsten Joachims'] | 1404.3656v1 | MOOCs have the potential to revolutionize higher education with their wide
outreach and accessibility, but they require instructors to come up with
scalable alternates to traditional student evaluation. Peer grading -- having
students assess each other -- is a promising approach to tackling the problem
of evaluation at... | Methods for Ordinal Peer Grading | 2,014 | http://arxiv.org/pdf/1404.3656v1 | Title Methods Ordinal Peer Grading Summary MOOCs potential revolutionize higher education wide outreach accessibility require instructor come scalable alternate traditional student evaluation Peer grading student ass promising approach tackling problem evaluation scale since number grader naturally scale number student... | [0.05036589503288269, 0.04054434597492218, -0.023720813915133476, -0.009017388336360455, 0.018207857385277748, 0.020169472321867943, 0.03703445941209793, -0.03922387957572937, -0.010676183737814426, -0.01680605113506317, 0.007143206894397736, 0.05150848999619484, 0.00258232350461185, 0.03464389964938164, -0.03139970079... |
40,995 | 40,995 | ['Vitaly Feldman', 'Pravesh Kothari', 'Jan Vondrák'] | 1404.4702v2 | We study the complexity of learning and approximation of self-bounding
functions over the uniform distribution on the Boolean hypercube ${0,1}^n$.
Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if
for every $x \in {0,1}^n$, $f(x)$ upper bounds the sum of all the $n$ marginal
decreases in the... | Nearly Tight Bounds on $\ell_1$ Approximation of Self-Bounding Functions | 2,014 | http://arxiv.org/pdf/1404.4702v2 | Title Nearly Tight Bounds ell1 Approximation SelfBounding Functions Summary study complexity learning approximation selfbounding function uniform distribution Boolean hypercube 01n Informally function f01n rightarrow mathbbR selfbounding every x 01n fx upper bound sum n marginal decrease value function x Selfbounding f... | [-0.07314060628414154, -0.0014816432958468795, -0.010115645825862885, 0.013221423141658306, 0.001716929255053401, -0.0375608466565609, 0.0005477922386489809, -0.028358448296785355, -0.00500745652243495, 0.027814745903015137, 0.0029539596289396286, 0.02362065576016903, -0.03980785608291626, 0.03174518793821335, -0.01110... |
40,996 | 40,996 | ['Orly Avner', 'Shie Mannor'] | 1404.5421v1 | We consider the problem of multiple users targeting the arms of a single
multi-armed stochastic bandit. The motivation for this problem comes from
cognitive radio networks, where selfish users need to coexist without any side
communication between them, implicit cooperation or common control. Even the
number of users m... | Concurrent bandits and cognitive radio networks | 2,014 | http://arxiv.org/pdf/1404.5421v1 | Title Concurrent bandit cognitive radio network Summary consider problem multiple user targeting arm single multiarmed stochastic bandit motivation problem come cognitive radio network selfish user need coexist without side communication implicit cooperation common control Even number user may unknown vary user join le... | [-0.0038258256390690804, 0.01033470407128334, -9.752090409165248e-05, -0.058785200119018555, -0.01862151548266411, -0.03428879380226135, 0.0005111002246849239, -0.04986076429486275, 0.028452806174755096, 0.03216594457626343, -0.041852112859487534, 0.023880619555711746, -0.05257115140557289, -0.0011756493477150798, -0.0... |
40,997 | 40,997 | ['Ran Zhao', 'Deanna Needell', 'Christopher Johansen', 'Jerry L. Grenard'] | 1404.5899v1 | In this paper, we compare and analyze clustering methods with missing data in
health behavior research. In particular, we propose and analyze the use of
compressive sensing's matrix completion along with spectral clustering to
cluster health related data. The empirical tests and real data results show
that these method... | A Comparison of Clustering and Missing Data Methods for Health Sciences | 2,014 | http://arxiv.org/pdf/1404.5899v1 | Title Comparison Clustering Missing Data Methods Health Sciences Summary paper compare analyze clustering method missing data health behavior research particular propose analyze use compressive sensing matrix completion along spectral clustering cluster health related data empirical test real data result show method ou... | [0.01200083177536726, 0.03366800770163536, -0.0309994425624609, -0.03664875775575638, 0.03799080476164818, 0.0233785267919302, 0.01256601046770811, 0.039235472679138184, 0.04961733520030975, 0.06377717107534409, 0.04938759654760361, 0.005662803538143635, 0.0451861210167408, -0.017506442964076996, -0.017496217042207718,... |
40,998 | 40,998 | ['Zongyan Huang', 'Matthew England', 'David Wilson', 'James H. Davenport', 'Lawrence C. Paulson', 'James Bridge'] | 1404.6369v1 | Cylindrical algebraic decomposition(CAD) is a key tool in computational
algebraic geometry, particularly for quantifier elimination over real-closed
fields. When using CAD, there is often a choice for the ordering placed on the
variables. This can be important, with some problems infeasible with one
variable ordering b... | Applying machine learning to the problem of choosing a heuristic to
select the variable ordering for cylindrical algebraic decomposition | 2,014 | http://arxiv.org/pdf/1404.6369v1 | Title Applying machine learning problem choosing heuristic select variable ordering cylindrical algebraic decomposition Summary Cylindrical algebraic decompositionCAD key tool computational algebraic geometry particularly quantifier elimination realclosed field using CAD often choice ordering placed variable important ... | [-0.051736243069171906, 0.07104861736297607, -0.0108353141695261, 0.02905256487429142, -0.02301345206797123, -0.01019418053328991, 0.03415394946932793, -0.03303016722202301, -0.03412940353155136, 0.017596380785107613, 0.058892663568258286, 0.0639001727104187, 0.019091380760073662, -0.002840763423591852, -0.043881688266... |
40,999 | 40,999 | ['Imen Trabelsi', 'Dorra Ben Ayed'] | 1407.0380v1 | Several speaker identification systems are giving good performance with clean
speech but are affected by the degradations introduced by noisy audio
conditions. To deal with this problem, we investigate the use of complementary
information at different levels for computing a combined match score for the
unknown speaker.... | A Multi Level Data Fusion Approach for Speaker Identification on
Telephone Speech | 2,014 | http://arxiv.org/pdf/1407.0380v1 | Title Multi Level Data Fusion Approach Speaker Identification Telephone Speech Summary Several speaker identification system giving good performance clean speech affected degradation introduced noisy audio condition deal problem investigate use complementary information different level computing combined match score un... | [0.0008173971436917782, 0.034721169620752335, 0.001753009739331901, 0.004335300996899605, -0.005883560981601477, -0.000960739329457283, 0.026873866096138954, -0.01339450478553772, -0.030785657465457916, -0.020689545199275017, -0.04555188864469528, -0.011969495564699173, 0.08595353364944458, 0.00796235166490078, -0.0267... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.