Search is not available for this dataset
id string | submitter string | authors string | title string | comments string | journal-ref string | doi string | report-no string | categories string | license string | abstract string | versions list | update_date timestamp[s] | authors_parsed list | prompt string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1211.5817 | Seyed-Mehdi-Reza Beheshti | Seyed-Mehdi-Reza Beheshti, Sherif Sakr, Boualem Benatallah, Hamid Reza
Motahari-Nezhad | Extending SPARQL to Support Entity Grouping and Path Queries | 23 pages. arXiv admin note: text overlap with arXiv:1211.5009 | null | null | UNSW-CSE-TR-1019 | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ability to efficiently find relevant subgraphs and paths in a large graph
to a given query is important in many applications including scientific data
analysis, social networks, and business intelligence. Currently, there is
little support and no efficient approaches for expressing and executing such
queries. Thi... | [
{
"version": "v1",
"created": "Wed, 21 Nov 2012 10:55:36 GMT"
}
] | 2012-11-27T00:00:00 | [
[
"Beheshti",
"Seyed-Mehdi-Reza",
""
],
[
"Sakr",
"Sherif",
""
],
[
"Benatallah",
"Boualem",
""
],
[
"Motahari-Nezhad",
"Hamid Reza",
""
]
] | TITLE: Extending SPARQL to Support Entity Grouping and Path Queries
ABSTRACT: The ability to efficiently find relevant subgraphs and paths in a large graph
to a given query is important in many applications including scientific data
analysis, social networks, and business intelligence. Currently, there is
little su... |
1211.5820 | Erjia Yan | Erjia Yan, Ying Ding, Blaise Cronin, Loet Leydesdorff | A bird's-eye view of scientific trading: Dependency relations among
fields of science | null | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We use a trading metaphor to study knowledge transfer in the sciences as well
as the social sciences. The metaphor comprises four dimensions: (a) Discipline
Self-dependence, (b) Knowledge Exports/Imports, (c) Scientific Trading
Dynamics, and (d) Scientific Trading Impact. This framework is applied to a
dataset of 221... | [
{
"version": "v1",
"created": "Sun, 25 Nov 2012 23:22:05 GMT"
}
] | 2012-11-27T00:00:00 | [
[
"Yan",
"Erjia",
""
],
[
"Ding",
"Ying",
""
],
[
"Cronin",
"Blaise",
""
],
[
"Leydesdorff",
"Loet",
""
]
] | TITLE: A bird's-eye view of scientific trading: Dependency relations among
fields of science
ABSTRACT: We use a trading metaphor to study knowledge transfer in the sciences as well
as the social sciences. The metaphor comprises four dimensions: (a) Discipline
Self-dependence, (b) Knowledge Exports/Imports, (c) Sc... |
1211.0191 | Branko Ristic | Branko Ristic, Jamie Sherrah and \'Angel F. Garc\'ia-Fern\'andez | Performance Evaluation of Random Set Based Pedestrian Tracking
Algorithms | 6 pages, 3 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper evaluates the error performance of three random finite set based
multi-object trackers in the context of pedestrian video tracking. The
evaluation is carried out using a publicly available video dataset of 4500
frames (town centre street) for which the ground truth is available. The input
to all pedestrian ... | [
{
"version": "v1",
"created": "Thu, 25 Oct 2012 23:21:46 GMT"
}
] | 2012-11-26T00:00:00 | [
[
"Ristic",
"Branko",
""
],
[
"Sherrah",
"Jamie",
""
],
[
"García-Fernández",
"Ángel F.",
""
]
] | TITLE: Performance Evaluation of Random Set Based Pedestrian Tracking
Algorithms
ABSTRACT: The paper evaluates the error performance of three random finite set based
multi-object trackers in the context of pedestrian video tracking. The
evaluation is carried out using a publicly available video dataset of 4500
fr... |
1211.5245 | Benjamin Laken | Benjamin A. Laken, Enric Palle, Jasa Calogovic and Eimear M. Dunne | A cosmic ray-climate link and cloud observations | 13 pages, 6 figures | J. Space Weather Space Clim., 2, A18, 13pp, 2012 | 10.1051/swsc/2012018 | null | physics.ao-ph astro-ph.EP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite over 35 years of constant satellite-based measurements of cloud,
reliable evidence of a long-hypothesized link between changes in solar activity
and Earth's cloud cover remains elusive. This work examines evidence of a
cosmic ray cloud link from a range of sources, including satellite-based cloud
measurements... | [
{
"version": "v1",
"created": "Thu, 22 Nov 2012 10:24:27 GMT"
}
] | 2012-11-26T00:00:00 | [
[
"Laken",
"Benjamin A.",
""
],
[
"Palle",
"Enric",
""
],
[
"Calogovic",
"Jasa",
""
],
[
"Dunne",
"Eimear M.",
""
]
] | TITLE: A cosmic ray-climate link and cloud observations
ABSTRACT: Despite over 35 years of constant satellite-based measurements of cloud,
reliable evidence of a long-hypothesized link between changes in solar activity
and Earth's cloud cover remains elusive. This work examines evidence of a
cosmic ray cloud link f... |
1211.5520 | Ashish Tendulkar Dr | Vivekanand Samant, Arvind Hulgeri, Alfonso Valencia, Ashish V.
Tendulkar | Accurate Demarcation of Protein Domain Linkers based on Structural
Analysis of Linker Probable Region | 18 pages, 2 figures | International Journal of Computational Biology, 0001:01-19, 2012 | null | null | cs.CE q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In multi-domain proteins, the domains are connected by a flexible
unstructured region called as protein domain linker. The accurate demarcation
of these linkers holds a key to understanding of their biochemical and
evolutionary attributes. This knowledge helps in designing a suitable linker
for engineering stable mul... | [
{
"version": "v1",
"created": "Fri, 23 Nov 2012 14:53:54 GMT"
}
] | 2012-11-26T00:00:00 | [
[
"Samant",
"Vivekanand",
""
],
[
"Hulgeri",
"Arvind",
""
],
[
"Valencia",
"Alfonso",
""
],
[
"Tendulkar",
"Ashish V.",
""
]
] | TITLE: Accurate Demarcation of Protein Domain Linkers based on Structural
Analysis of Linker Probable Region
ABSTRACT: In multi-domain proteins, the domains are connected by a flexible
unstructured region called as protein domain linker. The accurate demarcation
of these linkers holds a key to understanding of th... |
1211.4888 | Tuhin Sahai | Tuhin Sahai, Stefan Klus and Michael Dellnitz | A Traveling Salesman Learns Bayesian Networks | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structure learning of Bayesian networks is an important problem that arises
in numerous machine learning applications. In this work, we present a novel
approach for learning the structure of Bayesian networks using the solution of
an appropriately constructed traveling salesman problem. In our approach, one
computes ... | [
{
"version": "v1",
"created": "Tue, 20 Nov 2012 21:50:22 GMT"
}
] | 2012-11-22T00:00:00 | [
[
"Sahai",
"Tuhin",
""
],
[
"Klus",
"Stefan",
""
],
[
"Dellnitz",
"Michael",
""
]
] | TITLE: A Traveling Salesman Learns Bayesian Networks
ABSTRACT: Structure learning of Bayesian networks is an important problem that arises
in numerous machine learning applications. In this work, we present a novel
approach for learning the structure of Bayesian networks using the solution of
an appropriately const... |
1211.4658 | Monowar Bhuyan H | Monowar H. Bhuyan, Sarat Saharia, and Dhruba Kr Bhattacharyya | An Effective Method for Fingerprint Classification | 9 pages, 7 figures, 6 tables referred journal publication. arXiv
admin note: substantial text overlap with arXiv:1211.4503 | International A. Journal of e-Technology, Vol. 1, No. 3, pp.
89-97, January, 2010 | null | null | cs.CV cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an effective method for fingerprint classification using
data mining approach. Initially, it generates a numeric code sequence for each
fingerprint image based on the ridge flow patterns. Then for each class, a seed
is selected by using a frequent itemsets generation technique. These seeds are
sub... | [
{
"version": "v1",
"created": "Tue, 20 Nov 2012 03:25:57 GMT"
}
] | 2012-11-21T00:00:00 | [
[
"Bhuyan",
"Monowar H.",
""
],
[
"Saharia",
"Sarat",
""
],
[
"Bhattacharyya",
"Dhruba Kr",
""
]
] | TITLE: An Effective Method for Fingerprint Classification
ABSTRACT: This paper presents an effective method for fingerprint classification using
data mining approach. Initially, it generates a numeric code sequence for each
fingerprint image based on the ridge flow patterns. Then for each class, a seed
is selected ... |
1211.4142 | Shaina Race | Ralph Abbey, Jeremy Diepenbrock, Amy Langville, Carl Meyer, Shaina
Race, Dexin Zhou | Data Clustering via Principal Direction Gap Partitioning | null | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore the geometrical interpretation of the PCA based clustering
algorithm Principal Direction Divisive Partitioning (PDDP). We give several
examples where this algorithm breaks down, and suggest a new method, gap
partitioning, which takes into account natural gaps in the data between
clusters. Geometric feature... | [
{
"version": "v1",
"created": "Sat, 17 Nov 2012 18:28:30 GMT"
}
] | 2012-11-20T00:00:00 | [
[
"Abbey",
"Ralph",
""
],
[
"Diepenbrock",
"Jeremy",
""
],
[
"Langville",
"Amy",
""
],
[
"Meyer",
"Carl",
""
],
[
"Race",
"Shaina",
""
],
[
"Zhou",
"Dexin",
""
]
] | TITLE: Data Clustering via Principal Direction Gap Partitioning
ABSTRACT: We explore the geometrical interpretation of the PCA based clustering
algorithm Principal Direction Divisive Partitioning (PDDP). We give several
examples where this algorithm breaks down, and suggest a new method, gap
partitioning, which tak... |
1211.4503 | Monowar Bhuyan H | Monowar H. Bhuyan and D. K. Bhattacharyya | An Effective Fingerprint Classification and Search Method | 10 pages, 8 figures, 6 tables, referred journal publication | International Journal of Computer Science and Network Security,
Vol. 9, No.11, pp. 39-48, 2009 | null | null | cs.CV cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an effective fingerprint classification method designed
based on a hierarchical agglomerative clustering technique. The performance of
the technique was evaluated in terms of several real-life datasets and a
significant improvement in reducing the misclassification error has been
noticed. This pap... | [
{
"version": "v1",
"created": "Mon, 19 Nov 2012 17:13:26 GMT"
}
] | 2012-11-20T00:00:00 | [
[
"Bhuyan",
"Monowar H.",
""
],
[
"Bhattacharyya",
"D. K.",
""
]
] | TITLE: An Effective Fingerprint Classification and Search Method
ABSTRACT: This paper presents an effective fingerprint classification method designed
based on a hierarchical agglomerative clustering technique. The performance of
the technique was evaluated in terms of several real-life datasets and a
significant i... |
1211.4521 | Tyler Clemons Mr | Tyler Clemons, S. M. Faisal, Shirish Tatikonda, Charu Aggarawl, and
Srinivasan Parthasarathy | Hash in a Flash: Hash Tables for Solid State Devices | 16 pages 10 figures | null | null | null | cs.DB cs.DS cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, information retrieval algorithms have taken center stage for
extracting important data in ever larger datasets. Advances in hardware
technology have lead to the increasingly wide spread use of flash storage
devices. Such devices have clear benefits over traditional hard drives in terms
of latency of ... | [
{
"version": "v1",
"created": "Mon, 19 Nov 2012 17:55:01 GMT"
}
] | 2012-11-20T00:00:00 | [
[
"Clemons",
"Tyler",
""
],
[
"Faisal",
"S. M.",
""
],
[
"Tatikonda",
"Shirish",
""
],
[
"Aggarawl",
"Charu",
""
],
[
"Parthasarathy",
"Srinivasan",
""
]
] | TITLE: Hash in a Flash: Hash Tables for Solid State Devices
ABSTRACT: In recent years, information retrieval algorithms have taken center stage for
extracting important data in ever larger datasets. Advances in hardware
technology have lead to the increasingly wide spread use of flash storage
devices. Such devices ... |
1211.4552 | Gabriel Synnaeve | Gabriel Synnaeve (LIG, LPPA), Pierre Bessiere (LPPA) | A Dataset for StarCraft AI \& an Example of Armies Clustering | Artificial Intelligence in Adversarial Real-Time Games 2012, Palo
Alto : United States (2012) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper advocates the exploration of the full state of recorded real-time
strategy (RTS) games, by human or robotic players, to discover how to reason
about tactics and strategy. We present a dataset of StarCraft games
encompassing the most of the games' state (not only player's orders). We
explain one of the poss... | [
{
"version": "v1",
"created": "Mon, 19 Nov 2012 20:18:43 GMT"
}
] | 2012-11-20T00:00:00 | [
[
"Synnaeve",
"Gabriel",
"",
"LIG, LPPA"
],
[
"Bessiere",
"Pierre",
"",
"LPPA"
]
] | TITLE: A Dataset for StarCraft AI \& an Example of Armies Clustering
ABSTRACT: This paper advocates the exploration of the full state of recorded real-time
strategy (RTS) games, by human or robotic players, to discover how to reason
about tactics and strategy. We present a dataset of StarCraft games
encompassing th... |
1011.4104 | Andri Mirzal | Andri Mirzal | Clustering and Latent Semantic Indexing Aspects of the Singular Value
Decomposition | 38 pages, submitted to Pattern Recognition | null | null | null | cs.LG cs.NA math.SP | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper discusses clustering and latent semantic indexing (LSI) aspects of
the singular value decomposition (SVD). The purpose of this paper is twofold.
The first is to give an explanation on how and why the singular vectors can be
used in clustering. And the second is to show that the two seemingly unrelated
SVD ... | [
{
"version": "v1",
"created": "Wed, 17 Nov 2010 23:39:12 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Mar 2011 18:56:56 GMT"
},
{
"version": "v3",
"created": "Wed, 17 Oct 2012 08:41:06 GMT"
},
{
"version": "v4",
"created": "Fri, 16 Nov 2012 04:26:29 GMT"
}
] | 2012-11-19T00:00:00 | [
[
"Mirzal",
"Andri",
""
]
] | TITLE: Clustering and Latent Semantic Indexing Aspects of the Singular Value
Decomposition
ABSTRACT: This paper discusses clustering and latent semantic indexing (LSI) aspects of
the singular value decomposition (SVD). The purpose of this paper is twofold.
The first is to give an explanation on how and why the si... |
1211.3444 | Deanna Needell | B. Cung, T. Jin, J. Ramirez, A. Thompson, C. Boutsidis and D. Needell | Spectral Clustering: An empirical study of Approximation Algorithms and
its Application to the Attrition Problem | null | null | null | null | cs.LG math.NA stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering is the problem of separating a set of objects into groups (called
clusters) so that objects within the same cluster are more similar to each
other than to those in different clusters. Spectral clustering is a now
well-known method for clustering which utilizes the spectrum of the data
similarity matrix to ... | [
{
"version": "v1",
"created": "Wed, 14 Nov 2012 22:05:09 GMT"
}
] | 2012-11-16T00:00:00 | [
[
"Cung",
"B.",
""
],
[
"Jin",
"T.",
""
],
[
"Ramirez",
"J.",
""
],
[
"Thompson",
"A.",
""
],
[
"Boutsidis",
"C.",
""
],
[
"Needell",
"D.",
""
]
] | TITLE: Spectral Clustering: An empirical study of Approximation Algorithms and
its Application to the Attrition Problem
ABSTRACT: Clustering is the problem of separating a set of objects into groups (called
clusters) so that objects within the same cluster are more similar to each
other than to those in different... |
1203.5387 | Vibhor Rastogi | Vibhor Rastogi, Ashwin Machanavajjhala, Laukik Chitnis, Anish Das
Sarma | Finding Connected Components on Map-reduce in Logarithmic Rounds | null | null | null | null | cs.DS cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a large graph G = (V,E) with millions of nodes and edges, how do we
compute its connected components efficiently? Recent work addresses this
problem in map-reduce, where a fundamental trade-off exists between the number
of map-reduce rounds and the communication of each round. Denoting d the
diameter of the gra... | [
{
"version": "v1",
"created": "Sat, 24 Mar 2012 05:16:27 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Nov 2012 01:50:51 GMT"
}
] | 2012-11-14T00:00:00 | [
[
"Rastogi",
"Vibhor",
""
],
[
"Machanavajjhala",
"Ashwin",
""
],
[
"Chitnis",
"Laukik",
""
],
[
"Sarma",
"Anish Das",
""
]
] | TITLE: Finding Connected Components on Map-reduce in Logarithmic Rounds
ABSTRACT: Given a large graph G = (V,E) with millions of nodes and edges, how do we
compute its connected components efficiently? Recent work addresses this
problem in map-reduce, where a fundamental trade-off exists between the number
of map-r... |
1211.2399 | Rustam Tagiew | Rustam Tagiew | Mining Determinism in Human Strategic Behavior | 8 pages, no figures, EEML 2012 | Experimental Economics and Machine Learning 2012, CEUR-WS Vol-870,
urn:nbn:de:0074-870-0 | null | null | cs.GT cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work lies in the fusion of experimental economics and data mining. It
continues author's previous work on mining behaviour rules of human subjects
from experimental data, where game-theoretic predictions partially fail to
work. Game-theoretic predictions aka equilibria only tend to success with
experienced subje... | [
{
"version": "v1",
"created": "Sun, 11 Nov 2012 11:27:01 GMT"
}
] | 2012-11-13T00:00:00 | [
[
"Tagiew",
"Rustam",
""
]
] | TITLE: Mining Determinism in Human Strategic Behavior
ABSTRACT: This work lies in the fusion of experimental economics and data mining. It
continues author's previous work on mining behaviour rules of human subjects
from experimental data, where game-theoretic predictions partially fail to
work. Game-theoretic pred... |
1211.2556 | Fatai Anifowose | Fatai Adesina Anifowose | A Comparative Study of Gaussian Mixture Model and Radial Basis Function
for Voice Recognition | 9 pages, 10 figures; International Journal of Advanced Computer
Science and Applications (IJACSA), Vol. 1, No.3, September 2010 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A comparative study of the application of Gaussian Mixture Model (GMM) and
Radial Basis Function (RBF) in biometric recognition of voice has been carried
out and presented. The application of machine learning techniques to biometric
authentication and recognition problems has gained a widespread acceptance. In
this r... | [
{
"version": "v1",
"created": "Mon, 12 Nov 2012 10:42:58 GMT"
}
] | 2012-11-13T00:00:00 | [
[
"Anifowose",
"Fatai Adesina",
""
]
] | TITLE: A Comparative Study of Gaussian Mixture Model and Radial Basis Function
for Voice Recognition
ABSTRACT: A comparative study of the application of Gaussian Mixture Model (GMM) and
Radial Basis Function (RBF) in biometric recognition of voice has been carried
out and presented. The application of machine lea... |
1211.1752 | Abhishek Anand Abhishek | Abhishek Anand and Sherwin Li | 3D Scene Grammar for Parsing RGB-D Pointclouds | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We pose 3D scene-understanding as a problem of parsing in a grammar. A
grammar helps us capture the compositional structure of real-word objects,
e.g., a chair is composed of a seat, a back-rest and some legs. Having multiple
rules for an object helps us capture structural variations in objects, e.g., a
chair can opt... | [
{
"version": "v1",
"created": "Thu, 8 Nov 2012 03:11:53 GMT"
}
] | 2012-11-09T00:00:00 | [
[
"Anand",
"Abhishek",
""
],
[
"Li",
"Sherwin",
""
]
] | TITLE: 3D Scene Grammar for Parsing RGB-D Pointclouds
ABSTRACT: We pose 3D scene-understanding as a problem of parsing in a grammar. A
grammar helps us capture the compositional structure of real-word objects,
e.g., a chair is composed of a seat, a back-rest and some legs. Having multiple
rules for an object helps ... |
1208.2448 | Yong Zeng | Yong Zeng, Zhifeng Bao, Guoliang Li, Tok Wang Ling, Jiaheng Lu | Breaking Out The XML MisMatch Trap | The article is already withdrawn | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In keyword search, when user cannot get what she wants, query refinement is
needed and reason can be various. We first give a thorough categorization of
the reason, then focus on solving one category of query refinement problem in
the context of XML keyword search, where what user searches for does not exist
in the d... | [
{
"version": "v1",
"created": "Sun, 12 Aug 2012 18:51:23 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Nov 2012 03:09:15 GMT"
},
{
"version": "v3",
"created": "Wed, 7 Nov 2012 07:34:13 GMT"
}
] | 2012-11-08T00:00:00 | [
[
"Zeng",
"Yong",
""
],
[
"Bao",
"Zhifeng",
""
],
[
"Li",
"Guoliang",
""
],
[
"Ling",
"Tok Wang",
""
],
[
"Lu",
"Jiaheng",
""
]
] | TITLE: Breaking Out The XML MisMatch Trap
ABSTRACT: In keyword search, when user cannot get what she wants, query refinement is
needed and reason can be various. We first give a thorough categorization of
the reason, then focus on solving one category of query refinement problem in
the context of XML keyword search... |
1204.2169 | Hang-Hyun Jo | Hang-Hyun Jo, M\'arton Karsai, Juuso Karikoski, Kimmo Kaski | Spatiotemporal correlations of handset-based service usages | 11 pages, 15 figures | EPJ Data Science 1, 10 (2012) | 10.1140/epjds10 | null | physics.soc-ph physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study spatiotemporal correlations and temporal diversities of
handset-based service usages by analyzing a dataset that includes detailed
information about locations and service usages of 124 users over 16 months. By
constructing the spatiotemporal trajectories of the users we detect several
meaningful places or co... | [
{
"version": "v1",
"created": "Tue, 10 Apr 2012 14:42:56 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Jul 2012 15:06:23 GMT"
},
{
"version": "v3",
"created": "Wed, 26 Sep 2012 12:16:40 GMT"
}
] | 2012-11-07T00:00:00 | [
[
"Jo",
"Hang-Hyun",
""
],
[
"Karsai",
"Márton",
""
],
[
"Karikoski",
"Juuso",
""
],
[
"Kaski",
"Kimmo",
""
]
] | TITLE: Spatiotemporal correlations of handset-based service usages
ABSTRACT: We study spatiotemporal correlations and temporal diversities of
handset-based service usages by analyzing a dataset that includes detailed
information about locations and service usages of 124 users over 16 months. By
constructing the spa... |
1209.0911 | Junming Huang Junming Huang | Junming Huang, Xue-Qi Cheng, Hua-Wei Shen, Xiaoming Sun, Tao Zhou,
Xiaolong Jin | Conquering the rating bound problem in neighborhood-based collaborative
filtering: a function recovery approach | 10 pages, 4 figures | null | null | null | cs.IR cs.AI cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As an important tool for information filtering in the era of socialized web,
recommender systems have witnessed rapid development in the last decade. As
benefited from the better interpretability, neighborhood-based collaborative
filtering techniques, such as item-based collaborative filtering adopted by
Amazon, have... | [
{
"version": "v1",
"created": "Wed, 5 Sep 2012 09:55:27 GMT"
}
] | 2012-11-07T00:00:00 | [
[
"Huang",
"Junming",
""
],
[
"Cheng",
"Xue-Qi",
""
],
[
"Shen",
"Hua-Wei",
""
],
[
"Sun",
"Xiaoming",
""
],
[
"Zhou",
"Tao",
""
],
[
"Jin",
"Xiaolong",
""
]
] | TITLE: Conquering the rating bound problem in neighborhood-based collaborative
filtering: a function recovery approach
ABSTRACT: As an important tool for information filtering in the era of socialized web,
recommender systems have witnessed rapid development in the last decade. As
benefited from the better interp... |
1211.1136 | Malathi Subramanian | S.Malathi and S.Sridhar | Estimation of Effort in Software Cost Analysis for Heterogenous Dataset
using Fuzzy Analogy | 5 pages,5 figures | Journal of IEEE Transactions on Software Engineering,2010 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the significant objectives of software engineering community is to use
effective and useful models for precise calculation of effort in software cost
estimation. The existing techniques cannot handle the dataset having
categorical variables efficiently including the commonly used analogy method.
Also, the proj... | [
{
"version": "v1",
"created": "Tue, 6 Nov 2012 08:15:30 GMT"
}
] | 2012-11-07T00:00:00 | [
[
"Malathi",
"S.",
""
],
[
"Sridhar",
"S.",
""
]
] | TITLE: Estimation of Effort in Software Cost Analysis for Heterogenous Dataset
using Fuzzy Analogy
ABSTRACT: One of the significant objectives of software engineering community is to use
effective and useful models for precise calculation of effort in software cost
estimation. The existing techniques cannot handl... |
1205.6326 | Iain Murray | Krzysztof Chalupka, Christopher K. I. Williams and Iain Murray | A Framework for Evaluating Approximation Methods for Gaussian Process
Regression | 19 pages, 4 figures | null | null | null | stat.ML cs.LG stat.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gaussian process (GP) predictors are an important component of many Bayesian
approaches to machine learning. However, even a straightforward implementation
of Gaussian process regression (GPR) requires O(n^2) space and O(n^3) time for
a dataset of n examples. Several approximation methods have been proposed, but
ther... | [
{
"version": "v1",
"created": "Tue, 29 May 2012 10:59:30 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Nov 2012 17:39:32 GMT"
}
] | 2012-11-06T00:00:00 | [
[
"Chalupka",
"Krzysztof",
""
],
[
"Williams",
"Christopher K. I.",
""
],
[
"Murray",
"Iain",
""
]
] | TITLE: A Framework for Evaluating Approximation Methods for Gaussian Process
Regression
ABSTRACT: Gaussian process (GP) predictors are an important component of many Bayesian
approaches to machine learning. However, even a straightforward implementation
of Gaussian process regression (GPR) requires O(n^2) space a... |
1211.0498 | Rami Al-Rfou' | Rami Al-Rfou' | Detecting English Writing Styles For Non-native Speakers | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Analyzing writing styles of non-native speakers is a challenging task. In
this paper, we analyze the comments written in the discussion pages of the
English Wikipedia. Using learning algorithms, we are able to detect native
speakers' writing style with an accuracy of 74%. Given the diversity of the
English Wikipedia ... | [
{
"version": "v1",
"created": "Fri, 2 Nov 2012 17:37:06 GMT"
}
] | 2012-11-05T00:00:00 | [
[
"Al-Rfou'",
"Rami",
""
]
] | TITLE: Detecting English Writing Styles For Non-native Speakers
ABSTRACT: Analyzing writing styles of non-native speakers is a challenging task. In
this paper, we analyze the comments written in the discussion pages of the
English Wikipedia. Using learning algorithms, we are able to detect native
speakers' writing ... |
1211.0210 | Sundararajan Sellamanickam | Sathiya Keerthi Selvaraj, Sundararajan Sellamanickam, Shirish Shevade | Extension of TSVM to Multi-Class and Hierarchical Text Classification
Problems With General Losses | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transductive SVM (TSVM) is a well known semi-supervised large margin learning
method for binary text classification. In this paper we extend this method to
multi-class and hierarchical classification problems. We point out that the
determination of labels of unlabeled examples with fixed classifier weights is
a linea... | [
{
"version": "v1",
"created": "Thu, 1 Nov 2012 15:52:11 GMT"
}
] | 2012-11-02T00:00:00 | [
[
"Selvaraj",
"Sathiya Keerthi",
""
],
[
"Sellamanickam",
"Sundararajan",
""
],
[
"Shevade",
"Shirish",
""
]
] | TITLE: Extension of TSVM to Multi-Class and Hierarchical Text Classification
Problems With General Losses
ABSTRACT: Transductive SVM (TSVM) is a well known semi-supervised large margin learning
method for binary text classification. In this paper we extend this method to
multi-class and hierarchical classificatio... |
1211.0224 | Lorena Etcheverry | Lorena Etcheverry and Alejandro A. Vaisman | Views over RDF Datasets: A State-of-the-Art and Open Challenges | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Views on RDF datasets have been discussed in several works, nevertheless
there is no consensus on their definition nor the requirements they should
fulfill. In traditional data management systems, views have proved to be useful
in different application scenarios such as data integration, query answering,
data securit... | [
{
"version": "v1",
"created": "Thu, 1 Nov 2012 17:00:27 GMT"
}
] | 2012-11-02T00:00:00 | [
[
"Etcheverry",
"Lorena",
""
],
[
"Vaisman",
"Alejandro A.",
""
]
] | TITLE: Views over RDF Datasets: A State-of-the-Art and Open Challenges
ABSTRACT: Views on RDF datasets have been discussed in several works, nevertheless
there is no consensus on their definition nor the requirements they should
fulfill. In traditional data management systems, views have proved to be useful
in diff... |
1210.3926 | Julian McAuley | Julian McAuley, Jure Leskovec, Dan Jurafsky | Learning Attitudes and Attributes from Multi-Aspect Reviews | 11 pages, 6 figures, extended version of our ICDM 2012 submission | null | null | null | cs.CL cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The majority of online reviews consist of plain-text feedback together with a
single numeric score. However, there are multiple dimensions to products and
opinions, and understanding the `aspects' that contribute to users' ratings may
help us to better understand their individual preferences. For example, a
user's im... | [
{
"version": "v1",
"created": "Mon, 15 Oct 2012 07:36:57 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Oct 2012 16:14:35 GMT"
}
] | 2012-11-01T00:00:00 | [
[
"McAuley",
"Julian",
""
],
[
"Leskovec",
"Jure",
""
],
[
"Jurafsky",
"Dan",
""
]
] | TITLE: Learning Attitudes and Attributes from Multi-Aspect Reviews
ABSTRACT: The majority of online reviews consist of plain-text feedback together with a
single numeric score. However, there are multiple dimensions to products and
opinions, and understanding the `aspects' that contribute to users' ratings may
help... |
1210.8353 | Alex Susemihl | Chris H\"ausler, Alex Susemihl | Temporal Autoencoding Restricted Boltzmann Machine | null | null | null | null | stat.ML cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Much work has been done refining and characterizing the receptive fields
learned by deep learning algorithms. A lot of this work has focused on the
development of Gabor-like filters learned when enforcing sparsity constraints
on a natural image dataset. Little work however has investigated how these
filters might exp... | [
{
"version": "v1",
"created": "Wed, 31 Oct 2012 14:55:50 GMT"
}
] | 2012-11-01T00:00:00 | [
[
"Häusler",
"Chris",
""
],
[
"Susemihl",
"Alex",
""
]
] | TITLE: Temporal Autoencoding Restricted Boltzmann Machine
ABSTRACT: Much work has been done refining and characterizing the receptive fields
learned by deep learning algorithms. A lot of this work has focused on the
development of Gabor-like filters learned when enforcing sparsity constraints
on a natural image dat... |
1210.7657 | Antonio Giuliano Zippo Dr. | Antonio Giuliano Zippo | Text Classification with Compression Algorithms | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work concerns a comparison of SVM kernel methods in text categorization
tasks. In particular I define a kernel function that estimates the similarity
between two objects computing by their compressed lengths. In fact, compression
algorithms can detect arbitrarily long dependencies within the text strings.
Data t... | [
{
"version": "v1",
"created": "Mon, 29 Oct 2012 13:30:27 GMT"
}
] | 2012-10-30T00:00:00 | [
[
"Zippo",
"Antonio Giuliano",
""
]
] | TITLE: Text Classification with Compression Algorithms
ABSTRACT: This work concerns a comparison of SVM kernel methods in text categorization
tasks. In particular I define a kernel function that estimates the similarity
between two objects computing by their compressed lengths. In fact, compression
algorithms can d... |
1210.7191 | Robert Dunn | Robert J. H. Dunn (1), Kate M. Willett (1), Peter W. Thorne (2,3),
Emma V. Woolley, Imke Durre (3), Aiguo Dai (4), David E. Parker (1), Russ E.
Vose (3) ((1) Met Office Hadley Centre, Exeter, UK, (2) CICS-NC, Asheville,
NC, (3) NOAA NCDC, Asheville, NC, (4) NCAR, Boulder, CO) | HadISD: a quality-controlled global synoptic report database for
selected variables at long-term stations from 1973--2011 | Published in Climate of the Past, www.clim-past.net/8/1649/2012/. 31
pages, 23 figures, 9 pages. For data see
http://www.metoffice.gov.uk/hadobs/hadisd | Clim. Past, 8, 1649-1679 (2012) | 10.5194/cp-8-1649-2012 | null | physics.ao-ph | http://creativecommons.org/licenses/by/3.0/ | [Abridged] This paper describes the creation of HadISD: an automatically
quality-controlled synoptic resolution dataset of temperature, dewpoint
temperature, sea-level pressure, wind speed, wind direction and cloud cover
from global weather stations for 1973--2011. The full dataset consists of over
6000 stations, wit... | [
{
"version": "v1",
"created": "Fri, 26 Oct 2012 16:57:09 GMT"
}
] | 2012-10-29T00:00:00 | [
[
"Dunn",
"Robert J. H.",
""
],
[
"Willett",
"Kate M.",
""
],
[
"Thorne",
"Peter W.",
""
],
[
"Woolley",
"Emma V.",
""
],
[
"Durre",
"Imke",
""
],
[
"Dai",
"Aiguo",
""
],
[
"Parker",
"David E.",
""
],
[
... | TITLE: HadISD: a quality-controlled global synoptic report database for
selected variables at long-term stations from 1973--2011
ABSTRACT: [Abridged] This paper describes the creation of HadISD: an automatically
quality-controlled synoptic resolution dataset of temperature, dewpoint
temperature, sea-level pressur... |
1210.6891 | Clifton Phua | Clifton Phua, Hong Cao, Jo\~ao B\'artolo Gomes, Minh Nhut Nguyen | Predicting Near-Future Churners and Win-Backs in the Telecommunications
Industry | null | null | null | null | cs.CE cs.LG | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In this work, we presented the strategies and techniques that we have
developed for predicting the near-future churners and win-backs for a telecom
company. On a large-scale and real-world database containing customer profiles
and some transaction data from a telecom company, we first analyzed the data
schema, develo... | [
{
"version": "v1",
"created": "Wed, 24 Oct 2012 05:56:45 GMT"
}
] | 2012-10-26T00:00:00 | [
[
"Phua",
"Clifton",
""
],
[
"Cao",
"Hong",
""
],
[
"Gomes",
"João Bártolo",
""
],
[
"Nguyen",
"Minh Nhut",
""
]
] | TITLE: Predicting Near-Future Churners and Win-Backs in the Telecommunications
Industry
ABSTRACT: In this work, we presented the strategies and techniques that we have
developed for predicting the near-future churners and win-backs for a telecom
company. On a large-scale and real-world database containing custome... |
1210.6497 | Zhipeng Luo | Daifeng Li, Ying Ding, Xin Shuai, Golden Guo-zheng Sun, Jie Tang,
Zhipeng Luo, Jingwei Zhang and Guo Zhang | Topic-Level Opinion Influence Model(TOIM): An Investigation Using
Tencent Micro-Blogging | PLOS ONE Manuscript Draft | null | null | null | cs.SI cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mining user opinion from Micro-Blogging has been extensively studied on the
most popular social networking sites such as Twitter and Facebook in the U.S.,
but few studies have been done on Micro-Blogging websites in other countries
(e.g. China). In this paper, we analyze the social opinion influence on
Tencent, one o... | [
{
"version": "v1",
"created": "Wed, 24 Oct 2012 11:51:21 GMT"
}
] | 2012-10-25T00:00:00 | [
[
"Li",
"Daifeng",
""
],
[
"Ding",
"Ying",
""
],
[
"Shuai",
"Xin",
""
],
[
"Sun",
"Golden Guo-zheng",
""
],
[
"Tang",
"Jie",
""
],
[
"Luo",
"Zhipeng",
""
],
[
"Zhang",
"Jingwei",
""
],
[
"Zhang",
... | TITLE: Topic-Level Opinion Influence Model(TOIM): An Investigation Using
Tencent Micro-Blogging
ABSTRACT: Mining user opinion from Micro-Blogging has been extensively studied on the
most popular social networking sites such as Twitter and Facebook in the U.S.,
but few studies have been done on Micro-Blogging webs... |
1210.6122 | Dr Munaga HM Krishna Prasad | Hazarath Munaga and Venkata Jarugumalli | Performance Evaluation: Ball-Tree and KD-Tree in the Context of MST | 4 pages | http://link.springer.com/chapter/10.1007%2F978-3-642-32573-1_38?LI=true 2012 | 10.1007/978-3-642-32573-1_38 | null | cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Now a days many algorithms are invented or being inventing to find the
solution for Euclidean Minimum Spanning Tree, EMST, problem, as its
applicability is increasing in much wide range of fields containing spatial or
spatio temporal data viz. astronomy which consists of millions of spatial data.
To solve this proble... | [
{
"version": "v1",
"created": "Tue, 23 Oct 2012 04:09:30 GMT"
}
] | 2012-10-24T00:00:00 | [
[
"Munaga",
"Hazarath",
""
],
[
"Jarugumalli",
"Venkata",
""
]
] | TITLE: Performance Evaluation: Ball-Tree and KD-Tree in the Context of MST
ABSTRACT: Now a days many algorithms are invented or being inventing to find the
solution for Euclidean Minimum Spanning Tree, EMST, problem, as its
applicability is increasing in much wide range of fields containing spatial or
spatio tempor... |
1210.5873 | Ayodeji Akinduko Mr | A. A. Akinduko and E. M. Mirkes | Initialization of Self-Organizing Maps: Principal Components Versus
Random Initialization. A Case Study | 18 pages, 6 figures | null | null | null | stat.ML cs.LG | http://creativecommons.org/licenses/by/3.0/ | The performance of the Self-Organizing Map (SOM) algorithm is dependent on
the initial weights of the map. The different initialization methods can
broadly be classified into random and data analysis based initialization
approach. In this paper, the performance of random initialization (RI) approach
is compared to th... | [
{
"version": "v1",
"created": "Mon, 22 Oct 2012 11:17:31 GMT"
}
] | 2012-10-23T00:00:00 | [
[
"Akinduko",
"A. A.",
""
],
[
"Mirkes",
"E. M.",
""
]
] | TITLE: Initialization of Self-Organizing Maps: Principal Components Versus
Random Initialization. A Case Study
ABSTRACT: The performance of the Self-Organizing Map (SOM) algorithm is dependent on
the initial weights of the map. The different initialization methods can
broadly be classified into random and data an... |
1210.4839 | Stephane Caron | Stephane Caron, Branislav Kveton, Marc Lelarge, Smriti Bhagat | Leveraging Side Observations in Stochastic Bandits | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-142-151 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers stochastic bandits with side observations, a model that
accounts for both the exploration/exploitation dilemma and relationships
between arms. In this setting, after pulling an arm i, the decision maker also
observes the rewards for some other actions related to i. We will see that this
model is ... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:32:09 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Caron",
"Stephane",
""
],
[
"Kveton",
"Branislav",
""
],
[
"Lelarge",
"Marc",
""
],
[
"Bhagat",
"Smriti",
""
]
] | TITLE: Leveraging Side Observations in Stochastic Bandits
ABSTRACT: This paper considers stochastic bandits with side observations, a model that
accounts for both the exploration/exploitation dilemma and relationships
between arms. In this setting, after pulling an arm i, the decision maker also
observes the reward... |
1210.4851 | Sreangsu Acharyya | Sreangsu Acharyya, Oluwasanmi Koyejo, Joydeep Ghosh | Learning to Rank With Bregman Divergences and Monotone Retargeting | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-15-25 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a novel approach for learning to rank (LETOR) based on
the notion of monotone retargeting. It involves minimizing a divergence between
all monotonic increasing transformations of the training scores and a
parameterized prediction function. The minimization is both over the
transformations as wel... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:35:52 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Acharyya",
"Sreangsu",
""
],
[
"Koyejo",
"Oluwasanmi",
""
],
[
"Ghosh",
"Joydeep",
""
]
] | TITLE: Learning to Rank With Bregman Divergences and Monotone Retargeting
ABSTRACT: This paper introduces a novel approach for learning to rank (LETOR) based on
the notion of monotone retargeting. It involves minimizing a divergence between
all monotonic increasing transformations of the training scores and a
param... |
1210.4854 | Hannaneh Hajishirzi | Hannaneh Hajishirzi, Mohammad Rastegari, Ali Farhadi, Jessica K.
Hodgins | Semantic Understanding of Professional Soccer Commentaries | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-326-335 | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel approach to the problem of semantic parsing via
learning the correspondences between complex sentences and rich sets of events.
Our main intuition is that correct correspondences tend to occur more
frequently. Our model benefits from a discriminative notion of similarity to
learn the corre... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:37:21 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Hajishirzi",
"Hannaneh",
""
],
[
"Rastegari",
"Mohammad",
""
],
[
"Farhadi",
"Ali",
""
],
[
"Hodgins",
"Jessica K.",
""
]
] | TITLE: Semantic Understanding of Professional Soccer Commentaries
ABSTRACT: This paper presents a novel approach to the problem of semantic parsing via
learning the correspondences between complex sentences and rich sets of events.
Our main intuition is that correct correspondences tend to occur more
frequently. Ou... |
1210.4856 | Roger Grosse | Roger Grosse, Ruslan R Salakhutdinov, William T. Freeman, Joshua B.
Tenenbaum | Exploiting compositionality to explore a large space of model structures | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-306-315 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent proliferation of richly structured probabilistic models raises the
question of how to automatically determine an appropriate model for a dataset.
We investigate this question for a space of matrix decomposition models which
can express a variety of widely used models from unsupervised learning. To
enable m... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:37:41 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Grosse",
"Roger",
""
],
[
"Salakhutdinov",
"Ruslan R",
""
],
[
"Freeman",
"William T.",
""
],
[
"Tenenbaum",
"Joshua B.",
""
]
] | TITLE: Exploiting compositionality to explore a large space of model structures
ABSTRACT: The recent proliferation of richly structured probabilistic models raises the
question of how to automatically determine an appropriate model for a dataset.
We investigate this question for a space of matrix decomposition mode... |
1210.4874 | Hoong Chuin Lau | Hoong Chuin Lau, William Yeoh, Pradeep Varakantham, Duc Thien Nguyen,
Huaxing Chen | Dynamic Stochastic Orienteering Problems for Risk-Aware Applications | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-448-458 | cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Orienteering problems (OPs) are a variant of the well-known prize-collecting
traveling salesman problem, where the salesman needs to choose a subset of
cities to visit within a given deadline. OPs and their extensions with
stochastic travel times (SOPs) have been used to model vehicle routing problems
and tourist tri... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:42:27 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Lau",
"Hoong Chuin",
""
],
[
"Yeoh",
"William",
""
],
[
"Varakantham",
"Pradeep",
""
],
[
"Nguyen",
"Duc Thien",
""
],
[
"Chen",
"Huaxing",
""
]
] | TITLE: Dynamic Stochastic Orienteering Problems for Risk-Aware Applications
ABSTRACT: Orienteering problems (OPs) are a variant of the well-known prize-collecting
traveling salesman problem, where the salesman needs to choose a subset of
cities to visit within a given deadline. OPs and their extensions with
stochas... |
1210.4884 | Ankur P. Parikh | Ankur P. Parikh, Le Song, Mariya Ishteva, Gabi Teodoru, Eric P. Xing | A Spectral Algorithm for Latent Junction Trees | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-675-684 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Latent variable models are an elegant framework for capturing rich
probabilistic dependencies in many applications. However, current approaches
typically parametrize these models using conditional probability tables, and
learning relies predominantly on local search heuristics such as Expectation
Maximization. Using ... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:45:30 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Parikh",
"Ankur P.",
""
],
[
"Song",
"Le",
""
],
[
"Ishteva",
"Mariya",
""
],
[
"Teodoru",
"Gabi",
""
],
[
"Xing",
"Eric P.",
""
]
] | TITLE: A Spectral Algorithm for Latent Junction Trees
ABSTRACT: Latent variable models are an elegant framework for capturing rich
probabilistic dependencies in many applications. However, current approaches
typically parametrize these models using conditional probability tables, and
learning relies predominantly o... |
1210.4896 | Daniel Lowd | Daniel Lowd | Closed-Form Learning of Markov Networks from Dependency Networks | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-533-542 | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Markov networks (MNs) are a powerful way to compactly represent a joint
probability distribution, but most MN structure learning methods are very slow,
due to the high cost of evaluating candidates structures. Dependency networks
(DNs) represent a probability distribution as a set of conditional probability
distribut... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:48:08 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Lowd",
"Daniel",
""
]
] | TITLE: Closed-Form Learning of Markov Networks from Dependency Networks
ABSTRACT: Markov networks (MNs) are a powerful way to compactly represent a joint
probability distribution, but most MN structure learning methods are very slow,
due to the high cost of evaluating candidates structures. Dependency networks
(DNs... |
1210.4909 | Jens Roeder | Jens Roeder, Boaz Nadler, Kevin Kunzmann, Fred A. Hamprecht | Active Learning with Distributional Estimates | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-715-725 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Active Learning (AL) is increasingly important in a broad range of
applications. Two main AL principles to obtain accurate classification with few
labeled data are refinement of the current decision boundary and exploration of
poorly sampled regions. In this paper we derive a novel AL scheme that balances
these two p... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:53:17 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Roeder",
"Jens",
""
],
[
"Nadler",
"Boaz",
""
],
[
"Kunzmann",
"Kevin",
""
],
[
"Hamprecht",
"Fred A.",
""
]
] | TITLE: Active Learning with Distributional Estimates
ABSTRACT: Active Learning (AL) is increasingly important in a broad range of
applications. Two main AL principles to obtain accurate classification with few
labeled data are refinement of the current decision boundary and exploration of
poorly sampled regions. In... |
1210.4913 | Changhe Yuan | Changhe Yuan, Brandon Malone | An Improved Admissible Heuristic for Learning Optimal Bayesian Networks | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-924-933 | cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently two search algorithms, A* and breadth-first branch and bound
(BFBnB), were developed based on a simple admissible heuristic for learning
Bayesian network structures that optimize a scoring function. The heuristic
represents a relaxation of the learning problem such that each variable chooses
optimal parents ... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:55:57 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Yuan",
"Changhe",
""
],
[
"Malone",
"Brandon",
""
]
] | TITLE: An Improved Admissible Heuristic for Learning Optimal Bayesian Networks
ABSTRACT: Recently two search algorithms, A* and breadth-first branch and bound
(BFBnB), were developed based on a simple admissible heuristic for learning
Bayesian network structures that optimize a scoring function. The heuristic
repre... |
1210.4919 | Mirwaes Wahabzada | Mirwaes Wahabzada, Kristian Kersting, Christian Bauckhage, Christoph
Roemer, Agim Ballvora, Francisco Pinto, Uwe Rascher, Jens Leon, Lutz Ploemer | Latent Dirichlet Allocation Uncovers Spectral Characteristics of Drought
Stressed Plants | Appears in Proceedings of the Twenty-Eighth Conference on Uncertainty
in Artificial Intelligence (UAI2012) | null | null | UAI-P-2012-PG-852-862 | cs.LG cs.CE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the adaptation process of plants to drought stress is essential
in improving management practices, breeding strategies as well as engineering
viable crops for a sustainable agriculture in the coming decades.
Hyper-spectral imaging provides a particularly promising approach to gain such
understanding sin... | [
{
"version": "v1",
"created": "Tue, 16 Oct 2012 17:57:06 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Wahabzada",
"Mirwaes",
""
],
[
"Kersting",
"Kristian",
""
],
[
"Bauckhage",
"Christian",
""
],
[
"Roemer",
"Christoph",
""
],
[
"Ballvora",
"Agim",
""
],
[
"Pinto",
"Francisco",
""
],
[
"Rascher",
"Uwe",
"... | TITLE: Latent Dirichlet Allocation Uncovers Spectral Characteristics of Drought
Stressed Plants
ABSTRACT: Understanding the adaptation process of plants to drought stress is essential
in improving management practices, breeding strategies as well as engineering
viable crops for a sustainable agriculture in the co... |
1210.5135 | Yang Lu | Yang Lu, Mengying Wang, Menglu Li, Qili Zhu, Bo Yuan | LSBN: A Large-Scale Bayesian Structure Learning Framework for Model
Averaging | 13 pages, 6 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The motivation for this paper is to apply Bayesian structure learning using
Model Averaging in large-scale networks. Currently, Bayesian model averaging
algorithm is applicable to networks with only tens of variables, restrained by
its super-exponential complexity. We present a novel framework, called
LSBN(Large-Scal... | [
{
"version": "v1",
"created": "Thu, 18 Oct 2012 14:15:40 GMT"
}
] | 2012-10-19T00:00:00 | [
[
"Lu",
"Yang",
""
],
[
"Wang",
"Mengying",
""
],
[
"Li",
"Menglu",
""
],
[
"Zhu",
"Qili",
""
],
[
"Yuan",
"Bo",
""
]
] | TITLE: LSBN: A Large-Scale Bayesian Structure Learning Framework for Model
Averaging
ABSTRACT: The motivation for this paper is to apply Bayesian structure learning using
Model Averaging in large-scale networks. Currently, Bayesian model averaging
algorithm is applicable to networks with only tens of variables, r... |
1210.3165 | Ayatullah Faruk Mollah | Ayatullah Faruk Mollah, Subhadip Basu, Mita Nasipuri | Computationally Efficient Implementation of Convolution-based Locally
Adaptive Binarization Techniques | null | Proc. of Int'l Conf. on Information Processing, Springer, CCIS
292, pp. 159-168, 2012 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most important steps of document image processing is binarization.
The computational requirements of locally adaptive binarization techniques make
them unsuitable for devices with limited computing facilities. In this paper,
we have presented a computationally efficient implementation of convolution
based ... | [
{
"version": "v1",
"created": "Thu, 11 Oct 2012 10:04:44 GMT"
}
] | 2012-10-12T00:00:00 | [
[
"Mollah",
"Ayatullah Faruk",
""
],
[
"Basu",
"Subhadip",
""
],
[
"Nasipuri",
"Mita",
""
]
] | TITLE: Computationally Efficient Implementation of Convolution-based Locally
Adaptive Binarization Techniques
ABSTRACT: One of the most important steps of document image processing is binarization.
The computational requirements of locally adaptive binarization techniques make
them unsuitable for devices with lim... |
1210.3266 | Marco Pellegrini | Marco Pellegrini, Filippo Geraci, Miriam Baglioni | Detecting dense communities in large social and information networks
with the Core & Peel algorithm | null | null | null | null | cs.SI cs.DS physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting and characterizing dense subgraphs (tight communities) in social
and information networks is an important exploratory tool in social network
analysis. Several approaches have been proposed that either (i) partition the
whole network into clusters, even in low density region, or (ii) are aimed at
finding a s... | [
{
"version": "v1",
"created": "Thu, 11 Oct 2012 15:17:35 GMT"
}
] | 2012-10-12T00:00:00 | [
[
"Pellegrini",
"Marco",
""
],
[
"Geraci",
"Filippo",
""
],
[
"Baglioni",
"Miriam",
""
]
] | TITLE: Detecting dense communities in large social and information networks
with the Core & Peel algorithm
ABSTRACT: Detecting and characterizing dense subgraphs (tight communities) in social
and information networks is an important exploratory tool in social network
analysis. Several approaches have been propose... |
1210.3288 | Willie Neiswanger | Willie Neiswanger, Frank Wood | Unsupervised Detection and Tracking of Arbitrary Objects with Dependent
Dirichlet Process Mixtures | 21 pages, 7 figures | null | null | null | stat.ML cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a technique for the unsupervised detection and tracking
of arbitrary objects in videos. It is intended to reduce the need for detection
and localization methods tailored to specific object types and serve as a
general framework applicable to videos with varied objects, backgrounds, and
image quali... | [
{
"version": "v1",
"created": "Thu, 11 Oct 2012 16:30:15 GMT"
}
] | 2012-10-12T00:00:00 | [
[
"Neiswanger",
"Willie",
""
],
[
"Wood",
"Frank",
""
]
] | TITLE: Unsupervised Detection and Tracking of Arbitrary Objects with Dependent
Dirichlet Process Mixtures
ABSTRACT: This paper proposes a technique for the unsupervised detection and tracking
of arbitrary objects in videos. It is intended to reduce the need for detection
and localization methods tailored to speci... |
1210.3312 | Juan Manuel Torres Moreno | Juan-Manuel Torres-Moreno | Artex is AnotheR TEXt summarizer | 11 pages, 5 figures. arXiv admin note: substantial text overlap with
arXiv:1209.3126 | null | null | null | cs.IR cs.AI cs.CL | http://creativecommons.org/licenses/by/3.0/ | This paper describes Artex, another algorithm for Automatic Text
Summarization. In order to rank sentences, a simple inner product is calculated
between each sentence, a document vector (text topic) and a lexical vector
(vocabulary used by a sentence). Summaries are then generated by assembling the
highest ranked sen... | [
{
"version": "v1",
"created": "Thu, 11 Oct 2012 18:21:01 GMT"
}
] | 2012-10-12T00:00:00 | [
[
"Torres-Moreno",
"Juan-Manuel",
""
]
] | TITLE: Artex is AnotheR TEXt summarizer
ABSTRACT: This paper describes Artex, another algorithm for Automatic Text
Summarization. In order to rank sentences, a simple inner product is calculated
between each sentence, a document vector (text topic) and a lexical vector
(vocabulary used by a sentence). Summaries are... |
1210.2752 | Andrea Capocci | Andrea Capocci, Andrea Baldassarri, Vito D. P. Servedio, Vittorio
Loreto | Statistical Properties of Inter-arrival Times Distribution in Social
Tagging Systems | 6 pages, 10 figures; Proceedings of the 20th ACM conference on
Hypertext and hypermedia, 2009 | null | 10.1145/1557914.1557955 | null | physics.soc-ph cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Folksonomies provide a rich source of data to study social patterns taking
place on the World Wide Web. Here we study the temporal patterns of users'
tagging activity. We show that the statistical properties of inter-arrival
times between subsequent tagging events cannot be explained without taking into
account corre... | [
{
"version": "v1",
"created": "Tue, 9 Oct 2012 20:47:33 GMT"
}
] | 2012-10-11T00:00:00 | [
[
"Capocci",
"Andrea",
""
],
[
"Baldassarri",
"Andrea",
""
],
[
"Servedio",
"Vito D. P.",
""
],
[
"Loreto",
"Vittorio",
""
]
] | TITLE: Statistical Properties of Inter-arrival Times Distribution in Social
Tagging Systems
ABSTRACT: Folksonomies provide a rich source of data to study social patterns taking
place on the World Wide Web. Here we study the temporal patterns of users'
tagging activity. We show that the statistical properties of i... |
1210.2838 | Stefan Seer | Stefan Seer, Norbert Br\"andle, Carlo Ratti | Kinects and Human Kinetics: A New Approach for Studying Crowd Behavior | Preprint submitted to Transportation Research Part C: Emerging
Technologies, September 11, 2012 | null | null | null | cs.CV physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modeling crowd behavior relies on accurate data of pedestrian movements at a
high level of detail. Imaging sensors such as cameras provide a good basis for
capturing such detailed pedestrian motion data. However, currently available
computer vision technologies, when applied to conventional video footage, still
canno... | [
{
"version": "v1",
"created": "Wed, 10 Oct 2012 09:06:04 GMT"
}
] | 2012-10-11T00:00:00 | [
[
"Seer",
"Stefan",
""
],
[
"Brändle",
"Norbert",
""
],
[
"Ratti",
"Carlo",
""
]
] | TITLE: Kinects and Human Kinetics: A New Approach for Studying Crowd Behavior
ABSTRACT: Modeling crowd behavior relies on accurate data of pedestrian movements at a
high level of detail. Imaging sensors such as cameras provide a good basis for
capturing such detailed pedestrian motion data. However, currently avail... |
1210.2872 | Kulthida Tuamsuk | Tipawan Silwattananusarn and Kulthida Tuamsuk | Data Mining and Its Applications for Knowledge Management: A Literature
Review from 2007 to 2012 | 12 pages, 4 figures | International Journal of Data Mining & Knowledge Management
Process (IJDKP) Vol.2, No.5, 2012, pp. 13-24 | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data mining is one of the most important steps of the knowledge discovery in
databases process and is considered as significant subfield in knowledge
management. Research in data mining continues growing in business and in
learning organization over coming decades. This review paper explores the
applications of data ... | [
{
"version": "v1",
"created": "Wed, 10 Oct 2012 11:12:13 GMT"
}
] | 2012-10-11T00:00:00 | [
[
"Silwattananusarn",
"Tipawan",
""
],
[
"Tuamsuk",
"Kulthida",
""
]
] | TITLE: Data Mining and Its Applications for Knowledge Management: A Literature
Review from 2007 to 2012
ABSTRACT: Data mining is one of the most important steps of the knowledge discovery in
databases process and is considered as significant subfield in knowledge
management. Research in data mining continues grow... |
1210.2401 | Biao Xu | Biao Xu, Ruair\'i de Fr\'ein, Eric Robson and M\'iche\'al \'O Foghl\'u | Distributed Formal Concept Analysis Algorithms Based on an Iterative
MapReduce Framework | 17 pages, ICFCA 201, Formal Concept Analysis 2012 | null | 10.1007/978-3-642-29892-9_26 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While many existing formal concept analysis algorithms are efficient, they
are typically unsuitable for distributed implementation. Taking the MapReduce
(MR) framework as our inspiration we introduce a distributed approach for
performing formal concept mining. Our method has its novelty in that we use a
light-weight ... | [
{
"version": "v1",
"created": "Fri, 5 Oct 2012 10:28:24 GMT"
}
] | 2012-10-10T00:00:00 | [
[
"Xu",
"Biao",
""
],
[
"de Fréin",
"Ruairí",
""
],
[
"Robson",
"Eric",
""
],
[
"Foghlú",
"Mícheál Ó",
""
]
] | TITLE: Distributed Formal Concept Analysis Algorithms Based on an Iterative
MapReduce Framework
ABSTRACT: While many existing formal concept analysis algorithms are efficient, they
are typically unsuitable for distributed implementation. Taking the MapReduce
(MR) framework as our inspiration we introduce a distri... |
1210.2406 | Ali Tajer | Ali Tajer and H. Vincent Poor | Quick Search for Rare Events | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rare events can potentially occur in many applications. When manifested as
opportunities to be exploited, risks to be ameliorated, or certain features to
be extracted, such events become of paramount significance. Due to their
sporadic nature, the information-bearing signals associated with rare events
often lie in a... | [
{
"version": "v1",
"created": "Mon, 8 Oct 2012 20:15:32 GMT"
}
] | 2012-10-10T00:00:00 | [
[
"Tajer",
"Ali",
""
],
[
"Poor",
"H. Vincent",
""
]
] | TITLE: Quick Search for Rare Events
ABSTRACT: Rare events can potentially occur in many applications. When manifested as
opportunities to be exploited, risks to be ameliorated, or certain features to
be extracted, such events become of paramount significance. Due to their
sporadic nature, the information-bearing si... |
1210.2515 | Peijun Zhu | Ting Huang, Peijun Zhu, Zengyou He | Protein Inference and Protein Quantification: Two Sides of the Same Coin | 14 Pages, This paper has submitted to RECOMB2013 | null | null | null | cs.CE cs.DS q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivation: In mass spectrometry-based shotgun proteomics, protein
quantification and protein identification are two major computational problems.
To quantify the protein abundance, a list of proteins must be firstly inferred
from the sample. Then the relative or absolute protein abundance is estimated
with quantific... | [
{
"version": "v1",
"created": "Tue, 9 Oct 2012 07:36:26 GMT"
}
] | 2012-10-10T00:00:00 | [
[
"Huang",
"Ting",
""
],
[
"Zhu",
"Peijun",
""
],
[
"He",
"Zengyou",
""
]
] | TITLE: Protein Inference and Protein Quantification: Two Sides of the Same Coin
ABSTRACT: Motivation: In mass spectrometry-based shotgun proteomics, protein
quantification and protein identification are two major computational problems.
To quantify the protein abundance, a list of proteins must be firstly inferred
... |
1210.2695 | Lyndie Chiou | Lyndie Chiou | The Association of the Moon and the Sun with Large Earthquakes | null | null | null | null | physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The role of the moon in triggering earthquakes has been studied since the
early 1900s. Theory states that as land tides swept by the moon cross fault
lines, stress in the Earth's plates intensifies, increasing the likelihood of
small earthquakes. This paper studied the association of the moon and sun with
larger magn... | [
{
"version": "v1",
"created": "Tue, 9 Oct 2012 19:12:29 GMT"
}
] | 2012-10-10T00:00:00 | [
[
"Chiou",
"Lyndie",
""
]
] | TITLE: The Association of the Moon and the Sun with Large Earthquakes
ABSTRACT: The role of the moon in triggering earthquakes has been studied since the
early 1900s. Theory states that as land tides swept by the moon cross fault
lines, stress in the Earth's plates intensifies, increasing the likelihood of
small ea... |
1210.0310 | Rahele Kafieh | Raheleh Kafieh, Hossein Rabbani, Michael D. Abramoff, Milan Sonka | Intra-Retinal Layer Segmentation of 3D Optical Coherence Tomography
Using Coarse Grained Diffusion Map | 30 pages,32 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optical coherence tomography (OCT) is a powerful and noninvasive method for
retinal imaging. In this paper, we introduce a fast segmentation method based
on a new variant of spectral graph theory named diffusion maps. The research is
performed on spectral domain (SD) OCT images depicting macular and optic nerve
head ... | [
{
"version": "v1",
"created": "Mon, 1 Oct 2012 08:52:29 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Oct 2012 11:05:28 GMT"
}
] | 2012-10-09T00:00:00 | [
[
"Kafieh",
"Raheleh",
""
],
[
"Rabbani",
"Hossein",
""
],
[
"Abramoff",
"Michael D.",
""
],
[
"Sonka",
"Milan",
""
]
] | TITLE: Intra-Retinal Layer Segmentation of 3D Optical Coherence Tomography
Using Coarse Grained Diffusion Map
ABSTRACT: Optical coherence tomography (OCT) is a powerful and noninvasive method for
retinal imaging. In this paper, we introduce a fast segmentation method based
on a new variant of spectral graph theor... |
1210.2162 | Peter Welinder | Peter Welinder and Max Welling and Pietro Perona | Semisupervised Classifier Evaluation and Recalibration | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How many labeled examples are needed to estimate a classifier's performance
on a new dataset? We study the case where data is plentiful, but labels are
expensive. We show that by making a few reasonable assumptions on the structure
of the data, it is possible to estimate performance curves, with confidence
bounds, us... | [
{
"version": "v1",
"created": "Mon, 8 Oct 2012 07:15:57 GMT"
}
] | 2012-10-09T00:00:00 | [
[
"Welinder",
"Peter",
""
],
[
"Welling",
"Max",
""
],
[
"Perona",
"Pietro",
""
]
] | TITLE: Semisupervised Classifier Evaluation and Recalibration
ABSTRACT: How many labeled examples are needed to estimate a classifier's performance
on a new dataset? We study the case where data is plentiful, but labels are
expensive. We show that by making a few reasonable assumptions on the structure
of the data,... |
1210.2333 | Richard Davy | Richard Davy and Igor Esau | Surface air temperature variability in global climate models | 6 pages, 2 figures | null | null | null | physics.ao-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | New results from the Coupled Model Inter-comparison Project phase 5 (CMIP5)
and multiple global reanalysis datasets are used to investigate the
relationship between the mean and standard deviation in the surface air
temperature. A combination of a land-sea mask and orographic filter were used
to investigate the geogr... | [
{
"version": "v1",
"created": "Mon, 8 Oct 2012 16:47:26 GMT"
}
] | 2012-10-09T00:00:00 | [
[
"Davy",
"Richard",
""
],
[
"Esau",
"Igor",
""
]
] | TITLE: Surface air temperature variability in global climate models
ABSTRACT: New results from the Coupled Model Inter-comparison Project phase 5 (CMIP5)
and multiple global reanalysis datasets are used to investigate the
relationship between the mean and standard deviation in the surface air
temperature. A combina... |
1210.1714 | Andrew N. Jackson | Andrew N. Jackson | Formats over Time: Exploring UK Web History | 4 pages, 6 figures, presented at iPres 2012 in Toronto | null | null | null | cs.DL | http://creativecommons.org/licenses/by/3.0/ | Is software obsolescence a significant risk? To explore this issue, we
analysed a corpus of over 2.5 billion resources corresponding to the UK Web
domain, as crawled between 1996 and 2010. Using the DROID and Apache Tika
identification tools, we examined each resource and captured the results as
extended MIME types, ... | [
{
"version": "v1",
"created": "Fri, 5 Oct 2012 11:34:33 GMT"
}
] | 2012-10-08T00:00:00 | [
[
"Jackson",
"Andrew N.",
""
]
] | TITLE: Formats over Time: Exploring UK Web History
ABSTRACT: Is software obsolescence a significant risk? To explore this issue, we
analysed a corpus of over 2.5 billion resources corresponding to the UK Web
domain, as crawled between 1996 and 2010. Using the DROID and Apache Tika
identification tools, we examined ... |
1210.1258 | Mariya Ishteva | Mariya Ishteva, Haesun Park, Le Song | Unfolding Latent Tree Structures using 4th Order Tensors | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Discovering the latent structure from many observed variables is an important
yet challenging learning task. Existing approaches for discovering latent
structures often require the unknown number of hidden states as an input. In
this paper, we propose a quartet based approach which is \emph{agnostic} to
this number. ... | [
{
"version": "v1",
"created": "Wed, 3 Oct 2012 23:30:24 GMT"
}
] | 2012-10-05T00:00:00 | [
[
"Ishteva",
"Mariya",
""
],
[
"Park",
"Haesun",
""
],
[
"Song",
"Le",
""
]
] | TITLE: Unfolding Latent Tree Structures using 4th Order Tensors
ABSTRACT: Discovering the latent structure from many observed variables is an important
yet challenging learning task. Existing approaches for discovering latent
structures often require the unknown number of hidden states as an input. In
this paper, w... |
1210.1317 | Phong Nguyen | Phong Nguyen, Jun Wang, Melanie Hilario and Alexandros Kalousis | Learning Heterogeneous Similarity Measures for Hybrid-Recommendations in
Meta-Mining | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The notion of meta-mining has appeared recently and extends the traditional
meta-learning in two ways. First it does not learn meta-models that provide
support only for the learning algorithm selection task but ones that support
the whole data-mining process. In addition it abandons the so called black-box
approach t... | [
{
"version": "v1",
"created": "Thu, 4 Oct 2012 07:17:37 GMT"
}
] | 2012-10-05T00:00:00 | [
[
"Nguyen",
"Phong",
""
],
[
"Wang",
"Jun",
""
],
[
"Hilario",
"Melanie",
""
],
[
"Kalousis",
"Alexandros",
""
]
] | TITLE: Learning Heterogeneous Similarity Measures for Hybrid-Recommendations in
Meta-Mining
ABSTRACT: The notion of meta-mining has appeared recently and extends the traditional
meta-learning in two ways. First it does not learn meta-models that provide
support only for the learning algorithm selection task but o... |
1210.1461 | Shusen Wang | Shusen Wang, Zhihua Zhang, Jian Li | A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and
Tighter Bound | accepted by NIPS 2012 | Shusen Wang and Zhihua Zhang. A Scalable CUR Matrix Decomposition
Algorithm: Lower Time Complexity and Tighter Bound. In Advances in Neural
Information Processing Systems 25, 2012 | null | null | cs.LG cs.DM stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The CUR matrix decomposition is an important extension of Nystr\"{o}m
approximation to a general matrix. It approximates any data matrix in terms of
a small number of its columns and rows. In this paper we propose a novel
randomized CUR algorithm with an expected relative-error bound. The proposed
algorithm has the a... | [
{
"version": "v1",
"created": "Thu, 4 Oct 2012 14:23:34 GMT"
}
] | 2012-10-05T00:00:00 | [
[
"Wang",
"Shusen",
""
],
[
"Zhang",
"Zhihua",
""
],
[
"Li",
"Jian",
""
]
] | TITLE: A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and
Tighter Bound
ABSTRACT: The CUR matrix decomposition is an important extension of Nystr\"{o}m
approximation to a general matrix. It approximates any data matrix in terms of
a small number of its columns and rows. In this paper we prop... |
1210.0386 | Junlin Hu | Junlin Hu and Ping Guo | Combined Descriptors in Spatial Pyramid Domain for Image Classification | 9 pages, 5 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently spatial pyramid matching (SPM) with scale invariant feature
transform (SIFT) descriptor has been successfully used in image classification.
Unfortunately, the codebook generation and feature quantization procedures
using SIFT feature have the high complexity both in time and space. To address
this problem, i... | [
{
"version": "v1",
"created": "Mon, 1 Oct 2012 13:05:20 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Oct 2012 06:03:23 GMT"
},
{
"version": "v3",
"created": "Wed, 3 Oct 2012 02:48:47 GMT"
}
] | 2012-10-04T00:00:00 | [
[
"Hu",
"Junlin",
""
],
[
"Guo",
"Ping",
""
]
] | TITLE: Combined Descriptors in Spatial Pyramid Domain for Image Classification
ABSTRACT: Recently spatial pyramid matching (SPM) with scale invariant feature
transform (SIFT) descriptor has been successfully used in image classification.
Unfortunately, the codebook generation and feature quantization procedures
usi... |
1210.0564 | Tao Hu | Tao Hu, Juan Nunez-Iglesias, Shiv Vitaladevuni, Lou Scheffer, Shan Xu,
Mehdi Bolorizadeh, Harald Hess, Richard Fetter and Dmitri Chklovskii | Super-resolution using Sparse Representations over Learned Dictionaries:
Reconstruction of Brain Structure using Electron Microscopy | 12 pages, 11 figures | null | null | null | cs.CV q-bio.NC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A central problem in neuroscience is reconstructing neuronal circuits on the
synapse level. Due to a wide range of scales in brain architecture such
reconstruction requires imaging that is both high-resolution and
high-throughput. Existing electron microscopy (EM) techniques possess required
resolution in the lateral... | [
{
"version": "v1",
"created": "Mon, 1 Oct 2012 20:30:36 GMT"
}
] | 2012-10-03T00:00:00 | [
[
"Hu",
"Tao",
""
],
[
"Nunez-Iglesias",
"Juan",
""
],
[
"Vitaladevuni",
"Shiv",
""
],
[
"Scheffer",
"Lou",
""
],
[
"Xu",
"Shan",
""
],
[
"Bolorizadeh",
"Mehdi",
""
],
[
"Hess",
"Harald",
""
],
[
"Fet... | TITLE: Super-resolution using Sparse Representations over Learned Dictionaries:
Reconstruction of Brain Structure using Electron Microscopy
ABSTRACT: A central problem in neuroscience is reconstructing neuronal circuits on the
synapse level. Due to a wide range of scales in brain architecture such
reconstruction ... |
1210.0595 | Amir Hosein Asiaee | Amir H. Asiaee, Prashant Doshi, Todd Minning, Satya Sahoo, Priti
Parikh, Amit Sheth, Rick L. Tarleton | From Questions to Effective Answers: On the Utility of Knowledge-Driven
Querying Systems for Life Sciences Data | null | null | null | null | cs.IR cs.DB | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We compare two distinct approaches for querying data in the context of the
life sciences. The first approach utilizes conventional databases to store the
data and intuitive form-based interfaces to facilitate easy querying of the
data. These interfaces could be seen as implementing a set of "pre-canned"
queries commo... | [
{
"version": "v1",
"created": "Mon, 1 Oct 2012 22:10:30 GMT"
}
] | 2012-10-03T00:00:00 | [
[
"Asiaee",
"Amir H.",
""
],
[
"Doshi",
"Prashant",
""
],
[
"Minning",
"Todd",
""
],
[
"Sahoo",
"Satya",
""
],
[
"Parikh",
"Priti",
""
],
[
"Sheth",
"Amit",
""
],
[
"Tarleton",
"Rick L.",
""
]
] | TITLE: From Questions to Effective Answers: On the Utility of Knowledge-Driven
Querying Systems for Life Sciences Data
ABSTRACT: We compare two distinct approaches for querying data in the context of the
life sciences. The first approach utilizes conventional databases to store the
data and intuitive form-based i... |
1210.0758 | Daniele Cerra | Daniele Cerra and Mihai Datcu | A fast compression-based similarity measure with applications to
content-based image retrieval | Pre-print | Journal of Visual Communication and Image Representation, vol. 23,
no. 2, pp. 293-302, 2012 | 10.1016/j.jvcir.2011.10.009 | null | stat.ML cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compression-based similarity measures are effectively employed in
applications on diverse data types with a basically parameter-free approach.
Nevertheless, there are problems in applying these techniques to
medium-to-large datasets which have been seldom addressed. This paper proposes
a similarity measure based on c... | [
{
"version": "v1",
"created": "Tue, 2 Oct 2012 13:04:49 GMT"
}
] | 2012-10-03T00:00:00 | [
[
"Cerra",
"Daniele",
""
],
[
"Datcu",
"Mihai",
""
]
] | TITLE: A fast compression-based similarity measure with applications to
content-based image retrieval
ABSTRACT: Compression-based similarity measures are effectively employed in
applications on diverse data types with a basically parameter-free approach.
Nevertheless, there are problems in applying these techniqu... |
1210.0866 | Aaron Adcock | Aaron Adcock and Daniel Rubin and Gunnar Carlsson | Classification of Hepatic Lesions using the Matching Metric | null | null | null | null | cs.CV cs.CG math.AT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a methodology of classifying hepatic (liver) lesions
using multidimensional persistent homology, the matching metric (also called
the bottleneck distance), and a support vector machine. We present our
classification results on a dataset of 132 lesions that have been outlined and
annotated by ... | [
{
"version": "v1",
"created": "Tue, 2 Oct 2012 18:08:54 GMT"
}
] | 2012-10-03T00:00:00 | [
[
"Adcock",
"Aaron",
""
],
[
"Rubin",
"Daniel",
""
],
[
"Carlsson",
"Gunnar",
""
]
] | TITLE: Classification of Hepatic Lesions using the Matching Metric
ABSTRACT: In this paper we present a methodology of classifying hepatic (liver) lesions
using multidimensional persistent homology, the matching metric (also called
the bottleneck distance), and a support vector machine. We present our
classificatio... |
1207.3598 | Fabian Pedregosa | Fabian Pedregosa (INRIA Paris - Rocquencourt, INRIA Saclay - Ile de
France), Alexandre Gramfort (INRIA Saclay - Ile de France, LNAO), Ga\"el
Varoquaux (INRIA Saclay - Ile de France, LNAO), Elodie Cauvet (NEUROSPIN),
Christophe Pallier (NEUROSPIN), Bertrand Thirion (INRIA Saclay - Ile de
France) | Learning to rank from medical imaging data | null | MLMI 2012 - 3rd International Workshop on Machine Learning in
Medical Imaging (2012) | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Medical images can be used to predict a clinical score coding for the
severity of a disease, a pain level or the complexity of a cognitive task. In
all these cases, the predicted variable has a natural order. While a standard
classifier discards this information, we would like to take it into account in
order to impr... | [
{
"version": "v1",
"created": "Mon, 16 Jul 2012 08:22:36 GMT"
},
{
"version": "v2",
"created": "Sun, 30 Sep 2012 17:04:22 GMT"
}
] | 2012-10-02T00:00:00 | [
[
"Pedregosa",
"Fabian",
"",
"INRIA Paris - Rocquencourt, INRIA Saclay - Ile de\n France"
],
[
"Gramfort",
"Alexandre",
"",
"INRIA Saclay - Ile de France, LNAO"
],
[
"Varoquaux",
"Gaël",
"",
"INRIA Saclay - Ile de France, LNAO"
],
[
"Cauvet",
"Elo... | TITLE: Learning to rank from medical imaging data
ABSTRACT: Medical images can be used to predict a clinical score coding for the
severity of a disease, a pain level or the complexity of a cognitive task. In
all these cases, the predicted variable has a natural order. While a standard
classifier discards this infor... |
1209.6419 | Xiaotong Yuan | Xiao-Tong Yuan and Tong Zhang | Partial Gaussian Graphical Model Estimation | 32 pages, 5 figures, 4tables | null | null | null | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the partial estimation of Gaussian graphical models from
high-dimensional empirical observations. We derive a convex formulation for
this problem using $\ell_1$-regularized maximum-likelihood estimation, which
can be solved via a block coordinate descent algorithm. Statistical estimation
performanc... | [
{
"version": "v1",
"created": "Fri, 28 Sep 2012 04:12:14 GMT"
}
] | 2012-10-01T00:00:00 | [
[
"Yuan",
"Xiao-Tong",
""
],
[
"Zhang",
"Tong",
""
]
] | TITLE: Partial Gaussian Graphical Model Estimation
ABSTRACT: This paper studies the partial estimation of Gaussian graphical models from
high-dimensional empirical observations. We derive a convex formulation for
this problem using $\ell_1$-regularized maximum-likelihood estimation, which
can be solved via a block ... |
1209.6540 | Gabor Sarkozy | G\'abor N. S\'ark\"ozy, Fei Song, Endre Szemer\'edi, Shubhendu Trivedi | A Practical Regularity Partitioning Algorithm and its Applications in
Clustering | null | null | null | null | math.CO cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we introduce a new clustering technique called Regularity
Clustering. This new technique is based on the practical variants of the two
constructive versions of the Regularity Lemma, a very useful tool in graph
theory. The lemma claims that every graph can be partitioned into pseudo-random
graphs. While ... | [
{
"version": "v1",
"created": "Fri, 28 Sep 2012 15:01:22 GMT"
}
] | 2012-10-01T00:00:00 | [
[
"Sárközy",
"Gábor N.",
""
],
[
"Song",
"Fei",
""
],
[
"Szemerédi",
"Endre",
""
],
[
"Trivedi",
"Shubhendu",
""
]
] | TITLE: A Practical Regularity Partitioning Algorithm and its Applications in
Clustering
ABSTRACT: In this paper we introduce a new clustering technique called Regularity
Clustering. This new technique is based on the practical variants of the two
constructive versions of the Regularity Lemma, a very useful tool i... |
1209.6342 | Jie Cheng MS | Jie Cheng, Elizaveta Levina, Pei Wang and Ji Zhu | Sparse Ising Models with Covariates | 32 pages (including 5 pages of appendix), 3 figures, 2 tables | null | null | null | stat.ML cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been a lot of work fitting Ising models to multivariate binary data
in order to understand the conditional dependency relationships between the
variables. However, additional covariates are frequently recorded together with
the binary data, and may influence the dependence relationships. Motivated by
such a... | [
{
"version": "v1",
"created": "Thu, 27 Sep 2012 19:43:44 GMT"
}
] | 2012-09-28T00:00:00 | [
[
"Cheng",
"Jie",
""
],
[
"Levina",
"Elizaveta",
""
],
[
"Wang",
"Pei",
""
],
[
"Zhu",
"Ji",
""
]
] | TITLE: Sparse Ising Models with Covariates
ABSTRACT: There has been a lot of work fitting Ising models to multivariate binary data
in order to understand the conditional dependency relationships between the
variables. However, additional covariates are frequently recorded together with
the binary data, and may infl... |
1209.5765 | Kevin Mote | Kevin Mote | Fast Point-Feature Label Placement for Dynamic Visualizations (2007) | null | Information Visualization (2007) 6, 249-260 | 10.1057/PALGRAVE.IVS.9500163 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a fast approach to automatic point label de-confliction
on interactive maps. The general Map Labeling problem is NP-hard and has been
the subject of much study for decades. Computerized maps have introduced
interactive zooming and panning, which has intensified the problem. Providing
dynamic labe... | [
{
"version": "v1",
"created": "Tue, 25 Sep 2012 20:58:42 GMT"
}
] | 2012-09-27T00:00:00 | [
[
"Mote",
"Kevin",
""
]
] | TITLE: Fast Point-Feature Label Placement for Dynamic Visualizations (2007)
ABSTRACT: This paper describes a fast approach to automatic point label de-confliction
on interactive maps. The general Map Labeling problem is NP-hard and has been
the subject of much study for decades. Computerized maps have introduced
in... |
1209.5766 | Kevin Mote | Kevin Mote | Fast Point-Feature Label Placement for Dynamic Visualizations (Thesis) | Master's Thesis, Washington State University | null | 10.1057/PALGRAVE.IVS.9500163 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a fast approach to automatic point label de-confliction
on interactive maps. The general Map Labeling problem is NP-hard and has been
the subject of much study for decades. Computerized maps have introduced
interactive zooming and panning, which has intensified the problem. Providing
dynamic labe... | [
{
"version": "v1",
"created": "Tue, 25 Sep 2012 20:59:51 GMT"
}
] | 2012-09-27T00:00:00 | [
[
"Mote",
"Kevin",
""
]
] | TITLE: Fast Point-Feature Label Placement for Dynamic Visualizations (Thesis)
ABSTRACT: This paper describes a fast approach to automatic point label de-confliction
on interactive maps. The general Map Labeling problem is NP-hard and has been
the subject of much study for decades. Computerized maps have introduced
... |
1209.6001 | Jonathan Shapiro | Ruefei He and Jonathan Shapiro | Bayesian Mixture Models for Frequent Itemset Discovery | null | null | null | null | cs.LG cs.IR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In binary-transaction data-mining, traditional frequent itemset mining often
produces results which are not straightforward to interpret. To overcome this
problem, probability models are often used to produce more compact and
conclusive results, albeit with some loss of accuracy. Bayesian statistics have
been widely ... | [
{
"version": "v1",
"created": "Wed, 26 Sep 2012 16:41:59 GMT"
}
] | 2012-09-27T00:00:00 | [
[
"He",
"Ruefei",
""
],
[
"Shapiro",
"Jonathan",
""
]
] | TITLE: Bayesian Mixture Models for Frequent Itemset Discovery
ABSTRACT: In binary-transaction data-mining, traditional frequent itemset mining often
produces results which are not straightforward to interpret. To overcome this
problem, probability models are often used to produce more compact and
conclusive results... |
1005.3063 | Diego Amancio Raphael | D.R. Amancio, M. G. V. Nunes, O. N. Oliveira Jr., L. da F. Costa | Good practices for a literature survey are not followed by authors while
preparing scientific manuscripts | null | Scientometrics, v. 90, p. 2, (2012) | 10.1007/s11192-012-0630-z | null | physics.soc-ph cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The number of citations received by authors in scientific journals has become
a major parameter to assess individual researchers and the journals themselves
through the impact factor. A fair assessment therefore requires that the
criteria for selecting references in a given manuscript should be unbiased with
respect ... | [
{
"version": "v1",
"created": "Mon, 17 May 2010 21:45:47 GMT"
},
{
"version": "v2",
"created": "Sun, 23 Sep 2012 00:49:13 GMT"
}
] | 2012-09-25T00:00:00 | [
[
"Amancio",
"D. R.",
""
],
[
"Nunes",
"M. G. V.",
""
],
[
"Oliveira",
"O. N.",
"Jr."
],
[
"Costa",
"L. da F.",
""
]
] | TITLE: Good practices for a literature survey are not followed by authors while
preparing scientific manuscripts
ABSTRACT: The number of citations received by authors in scientific journals has become
a major parameter to assess individual researchers and the journals themselves
through the impact factor. A fair ... |
1209.5038 | Daniel Gordon | Daniel Gordon, Danny Hendler, Lior Rokach | Fast Randomized Model Generation for Shapelet-Based Time Series
Classification | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series classification is a field which has drawn much attention over the
past decade. A new approach for classification of time series uses
classification trees based on shapelets. A shapelet is a subsequence extracted
from one of the time series in the dataset. A disadvantage of this approach is
the time requir... | [
{
"version": "v1",
"created": "Sun, 23 Sep 2012 07:50:42 GMT"
}
] | 2012-09-25T00:00:00 | [
[
"Gordon",
"Daniel",
""
],
[
"Hendler",
"Danny",
""
],
[
"Rokach",
"Lior",
""
]
] | TITLE: Fast Randomized Model Generation for Shapelet-Based Time Series
Classification
ABSTRACT: Time series classification is a field which has drawn much attention over the
past decade. A new approach for classification of time series uses
classification trees based on shapelets. A shapelet is a subsequence extr... |
1209.5335 | Arash Einolghozati | Erman Ayday, Arash Einolghozati, Faramarz Fekri | BPRS: Belief Propagation Based Iterative Recommender System | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we introduce the first application of the Belief Propagation
(BP) algorithm in the design of recommender systems. We formulate the
recommendation problem as an inference problem and aim to compute the marginal
probability distributions of the variables which represent the ratings to be
predicted. Howeve... | [
{
"version": "v1",
"created": "Mon, 24 Sep 2012 16:59:12 GMT"
}
] | 2012-09-25T00:00:00 | [
[
"Ayday",
"Erman",
""
],
[
"Einolghozati",
"Arash",
""
],
[
"Fekri",
"Faramarz",
""
]
] | TITLE: BPRS: Belief Propagation Based Iterative Recommender System
ABSTRACT: In this paper we introduce the first application of the Belief Propagation
(BP) algorithm in the design of recommender systems. We formulate the
recommendation problem as an inference problem and aim to compute the marginal
probability dis... |
1009.1380 | Stefano Marchesini | F. R. N. C. Maia, A. MacDowell, S. Marchesini, H. A. Padmore, D. Y.
Parkinson, J. Pien, A. Schirotzek, and C. Yang | Compressive Phase Contrast Tomography | 5 pages, "Image Reconstruction from Incomplete Data VI" conference
7800, SPIE Optical Engineering + Applications 1-5 August 2010 San Diego, CA
United States | Proc. SPIE 7800, 78000F (2010) | 10.1117/12.861946 | LBNL-3899E | physics.optics math.OC | http://creativecommons.org/licenses/publicdomain/ | When x-rays penetrate soft matter, their phase changes more rapidly than
their amplitude. In- terference effects visible with high brightness sources
creates higher contrast, edge enhanced images. When the object is piecewise
smooth (made of big blocks of a few components), such higher con- trast
datasets have a spar... | [
{
"version": "v1",
"created": "Tue, 7 Sep 2010 19:55:40 GMT"
}
] | 2012-09-24T00:00:00 | [
[
"Maia",
"F. R. N. C.",
""
],
[
"MacDowell",
"A.",
""
],
[
"Marchesini",
"S.",
""
],
[
"Padmore",
"H. A.",
""
],
[
"Parkinson",
"D. Y.",
""
],
[
"Pien",
"J.",
""
],
[
"Schirotzek",
"A.",
""
],
[
"Yan... | TITLE: Compressive Phase Contrast Tomography
ABSTRACT: When x-rays penetrate soft matter, their phase changes more rapidly than
their amplitude. In- terference effects visible with high brightness sources
creates higher contrast, edge enhanced images. When the object is piecewise
smooth (made of big blocks of a few... |
1201.5338 | Xiang Wang | Xiang Wang, Buyue Qian, Ian Davidson | On Constrained Spectral Clustering and Its Applications | Data Mining and Knowledge Discovery, 2012 | null | 10.1007/s10618-012-0291-9 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Constrained clustering has been well-studied for algorithms such as $K$-means
and hierarchical clustering. However, how to satisfy many constraints in these
algorithmic settings has been shown to be intractable. One alternative to
encode many constraints is to use spectral clustering, which remains a
developing area.... | [
{
"version": "v1",
"created": "Wed, 25 Jan 2012 18:36:11 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Sep 2012 06:04:35 GMT"
}
] | 2012-09-24T00:00:00 | [
[
"Wang",
"Xiang",
""
],
[
"Qian",
"Buyue",
""
],
[
"Davidson",
"Ian",
""
]
] | TITLE: On Constrained Spectral Clustering and Its Applications
ABSTRACT: Constrained clustering has been well-studied for algorithms such as $K$-means
and hierarchical clustering. However, how to satisfy many constraints in these
algorithmic settings has been shown to be intractable. One alternative to
encode many ... |
1206.5587 | Shafqat Shad Mr | Shafqat Ali Shad, Enhong Chen | Spatial Outlier Detection from GSM Mobility Data | null | International Journal of Advanced Research in Computer Science,
vol. 3, no. 3, pp. 68-74, 2012 | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper has been withdrawn by the authors. With the rigorous growth of
cellular network many mobility datasets are available publically, which
attracted researchers to study human mobility fall under spatio-temporal
phenomenon. Mobility profile building is main task in spatio-temporal trend
analysis which can be e... | [
{
"version": "v1",
"created": "Mon, 25 Jun 2012 06:47:46 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Aug 2012 18:33:59 GMT"
},
{
"version": "v3",
"created": "Fri, 21 Sep 2012 02:21:33 GMT"
}
] | 2012-09-24T00:00:00 | [
[
"Shad",
"Shafqat Ali",
""
],
[
"Chen",
"Enhong",
""
]
] | TITLE: Spatial Outlier Detection from GSM Mobility Data
ABSTRACT: This paper has been withdrawn by the authors. With the rigorous growth of
cellular network many mobility datasets are available publically, which
attracted researchers to study human mobility fall under spatio-temporal
phenomenon. Mobility profile bu... |
1209.0835 | Neil Zhenqiang Gong | Neil Zhenqiang Gong, Wenchang Xu, Ling Huang, Prateek Mittal, Emil
Stefanov, Vyas Sekar, Dawn Song | Evolution of Social-Attribute Networks: Measurements, Modeling, and
Implications using Google+ | 14 pages, 19 figures. will appear in IMC'12 | null | null | null | cs.SI cs.CY physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding social network structure and evolution has important
implications for many aspects of network and system design including
provisioning, bootstrapping trust and reputation systems via social networks,
and defenses against Sybil attacks. Several recent results suggest that
augmenting the social network st... | [
{
"version": "v1",
"created": "Wed, 5 Sep 2012 01:01:47 GMT"
},
{
"version": "v2",
"created": "Sat, 8 Sep 2012 04:12:28 GMT"
},
{
"version": "v3",
"created": "Tue, 11 Sep 2012 17:17:36 GMT"
},
{
"version": "v4",
"created": "Wed, 19 Sep 2012 02:24:50 GMT"
}
] | 2012-09-20T00:00:00 | [
[
"Gong",
"Neil Zhenqiang",
""
],
[
"Xu",
"Wenchang",
""
],
[
"Huang",
"Ling",
""
],
[
"Mittal",
"Prateek",
""
],
[
"Stefanov",
"Emil",
""
],
[
"Sekar",
"Vyas",
""
],
[
"Song",
"Dawn",
""
]
] | TITLE: Evolution of Social-Attribute Networks: Measurements, Modeling, and
Implications using Google+
ABSTRACT: Understanding social network structure and evolution has important
implications for many aspects of network and system design including
provisioning, bootstrapping trust and reputation systems via socia... |
1209.2493 | Subhabrata Mukherjee | Subhabrata Mukherjee, Pushpak Bhattacharyya | WikiSent : Weakly Supervised Sentiment Analysis Through Extractive
Summarization With Wikipedia | The paper is available at
http://subhabrata-mukherjee.webs.com/publications.htm | Lecture Notes in Computer Science Volume 7523, 2012, pp 774-793 | 10.1007/978-3-642-33460-3_55 | null | cs.IR cs.CL | http://creativecommons.org/licenses/by/3.0/ | This paper describes a weakly supervised system for sentiment analysis in the
movie review domain. The objective is to classify a movie review into a
polarity class, positive or negative, based on those sentences bearing opinion
on the movie alone. The irrelevant text, not directly related to the reviewer
opinion on ... | [
{
"version": "v1",
"created": "Wed, 12 Sep 2012 04:33:08 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Sep 2012 14:44:11 GMT"
}
] | 2012-09-19T00:00:00 | [
[
"Mukherjee",
"Subhabrata",
""
],
[
"Bhattacharyya",
"Pushpak",
""
]
] | TITLE: WikiSent : Weakly Supervised Sentiment Analysis Through Extractive
Summarization With Wikipedia
ABSTRACT: This paper describes a weakly supervised system for sentiment analysis in the
movie review domain. The objective is to classify a movie review into a
polarity class, positive or negative, based on thos... |
1209.2495 | Subhabrata Mukherjee | Subhabrata Mukherjee, Akshat Malu, A.R. Balamurali, Pushpak
Bhattacharyya | TwiSent: A Multistage System for Analyzing Sentiment in Twitter | The paper is available at
http://subhabrata-mukherjee.webs.com/publications.htm | In Proceedings of The 21st ACM Conference on Information and
Knowledge Management (CIKM), 2012 as a poster | null | null | cs.IR cs.CL | http://creativecommons.org/licenses/by/3.0/ | In this paper, we present TwiSent, a sentiment analysis system for Twitter.
Based on the topic searched, TwiSent collects tweets pertaining to it and
categorizes them into the different polarity classes positive, negative and
objective. However, analyzing micro-blog posts have many inherent challenges
compared to the... | [
{
"version": "v1",
"created": "Wed, 12 Sep 2012 04:39:37 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Sep 2012 14:43:49 GMT"
}
] | 2012-09-19T00:00:00 | [
[
"Mukherjee",
"Subhabrata",
""
],
[
"Malu",
"Akshat",
""
],
[
"Balamurali",
"A. R.",
""
],
[
"Bhattacharyya",
"Pushpak",
""
]
] | TITLE: TwiSent: A Multistage System for Analyzing Sentiment in Twitter
ABSTRACT: In this paper, we present TwiSent, a sentiment analysis system for Twitter.
Based on the topic searched, TwiSent collects tweets pertaining to it and
categorizes them into the different polarity classes positive, negative and
objective... |
1209.3873 | Erwin Lalik | Erwin Lalik | Chaos in oscillatory heat evolution accompanying the sorption of
hydrogen and deuterium in palladium | 17 pages, 5 figures | null | null | null | physics.chem-ph nlin.CD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aperiodic oscillations in the sorption of H2 or D2 in metallic Pd powder have
been observed, and a novel method to confirm their deterministic rather than
random character has been devised. A theorem relating the square of a function,
with the derivative and integral with variable upper limit of the same function
has... | [
{
"version": "v1",
"created": "Tue, 18 Sep 2012 08:51:11 GMT"
}
] | 2012-09-19T00:00:00 | [
[
"Lalik",
"Erwin",
""
]
] | TITLE: Chaos in oscillatory heat evolution accompanying the sorption of
hydrogen and deuterium in palladium
ABSTRACT: Aperiodic oscillations in the sorption of H2 or D2 in metallic Pd powder have
been observed, and a novel method to confirm their deterministic rather than
random character has been devised. A theo... |
1209.4056 | Kashyap Dixit | Kashyap Dixit and Madhav Jha and Abhradeep Thakurta | Testing Lipschitz Property over Product Distribution and its
Applications to Statistical Data Privacy | 17 pages | null | null | null | cs.CR | http://creativecommons.org/licenses/by/3.0/ | In this work, we present a connection between Lipschitz property testing and
a relaxed notion of differential privacy, where we assume that the datasets are
being sampled from a domain according to some distribution defined on it.
Specifically, we show that testing whether an algorithm is private can be
reduced to te... | [
{
"version": "v1",
"created": "Tue, 18 Sep 2012 18:51:17 GMT"
}
] | 2012-09-19T00:00:00 | [
[
"Dixit",
"Kashyap",
""
],
[
"Jha",
"Madhav",
""
],
[
"Thakurta",
"Abhradeep",
""
]
] | TITLE: Testing Lipschitz Property over Product Distribution and its
Applications to Statistical Data Privacy
ABSTRACT: In this work, we present a connection between Lipschitz property testing and
a relaxed notion of differential privacy, where we assume that the datasets are
being sampled from a domain according ... |
1209.3286 | Nikolay Glazyrin | Nikolay Glazyrin | Music Recommendation System for Million Song Dataset Challenge | 4 pages | null | null | null | cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper a system that took 8th place in Million Song Dataset challenge
is described. Given full listening history for 1 million of users and half of
listening history for 110000 users participatints should predict the missing
half. The system proposed here uses memory-based collaborative filtering
approach and ... | [
{
"version": "v1",
"created": "Fri, 14 Sep 2012 18:59:03 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Sep 2012 18:53:14 GMT"
}
] | 2012-09-18T00:00:00 | [
[
"Glazyrin",
"Nikolay",
""
]
] | TITLE: Music Recommendation System for Million Song Dataset Challenge
ABSTRACT: In this paper a system that took 8th place in Million Song Dataset challenge
is described. Given full listening history for 1 million of users and half of
listening history for 110000 users participatints should predict the missing
half... |
1209.3332 | George Teodoro | George Teodoro, Tony Pan, Tahsin M. Kurc, Jun Kong, Lee A. D. Cooper,
Joel H. Saltz | High-throughput Execution of Hierarchical Analysis Pipelines on Hybrid
Cluster Platforms | 12 pages, 14 figures | null | null | null | cs.DC cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose, implement, and experimentally evaluate a runtime middleware to
support high-throughput execution on hybrid cluster machines of large-scale
analysis applications. A hybrid cluster machine consists of computation nodes
which have multiple CPUs and general purpose graphics processing units (GPUs).
Our work t... | [
{
"version": "v1",
"created": "Fri, 14 Sep 2012 21:56:51 GMT"
}
] | 2012-09-18T00:00:00 | [
[
"Teodoro",
"George",
""
],
[
"Pan",
"Tony",
""
],
[
"Kurc",
"Tahsin M.",
""
],
[
"Kong",
"Jun",
""
],
[
"Cooper",
"Lee A. D.",
""
],
[
"Saltz",
"Joel H.",
""
]
] | TITLE: High-throughput Execution of Hierarchical Analysis Pipelines on Hybrid
Cluster Platforms
ABSTRACT: We propose, implement, and experimentally evaluate a runtime middleware to
support high-throughput execution on hybrid cluster machines of large-scale
analysis applications. A hybrid cluster machine consists ... |
1209.3433 | Salah A. Aly | Hossam M. Zawbaa, Salah A. Aly, Adnan A. Gutub | A Hajj And Umrah Location Classification System For Video Crowded Scenes | 9 pages, 10 figures, 2 tables, 3 algirthms | null | null | null | cs.CV cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a new automatic system for classifying ritual locations in
diverse Hajj and Umrah video scenes is investigated. This challenging subject
has mostly been ignored in the past due to several problems one of which is the
lack of realistic annotated video datasets. HUER Dataset is defined to model
six diffe... | [
{
"version": "v1",
"created": "Sat, 15 Sep 2012 20:57:51 GMT"
}
] | 2012-09-18T00:00:00 | [
[
"Zawbaa",
"Hossam M.",
""
],
[
"Aly",
"Salah A.",
""
],
[
"Gutub",
"Adnan A.",
""
]
] | TITLE: A Hajj And Umrah Location Classification System For Video Crowded Scenes
ABSTRACT: In this paper, a new automatic system for classifying ritual locations in
diverse Hajj and Umrah video scenes is investigated. This challenging subject
has mostly been ignored in the past due to several problems one of which i... |
1209.3694 | Yifei Ma | Yifei Ma, Roman Garnett, Jeff Schneider | Submodularity in Batch Active Learning and Survey Problems on Gaussian
Random Fields | null | null | null | null | cs.LG cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many real-world datasets can be represented in the form of a graph whose edge
weights designate similarities between instances. A discrete Gaussian random
field (GRF) model is a finite-dimensional Gaussian process (GP) whose prior
covariance is the inverse of a graph Laplacian. Minimizing the trace of the
predictive ... | [
{
"version": "v1",
"created": "Mon, 17 Sep 2012 15:43:11 GMT"
}
] | 2012-09-18T00:00:00 | [
[
"Ma",
"Yifei",
""
],
[
"Garnett",
"Roman",
""
],
[
"Schneider",
"Jeff",
""
]
] | TITLE: Submodularity in Batch Active Learning and Survey Problems on Gaussian
Random Fields
ABSTRACT: Many real-world datasets can be represented in the form of a graph whose edge
weights designate similarities between instances. A discrete Gaussian random
field (GRF) model is a finite-dimensional Gaussian proces... |
1209.3026 | Hany SalahEldeen | Hany M. SalahEldeen and Michael L. Nelson | Losing My Revolution: How Many Resources Shared on Social Media Have
Been Lost? | 12 pages, Theory and Practice of Digital Libraries (TPDL) 2012 | null | null | null | cs.DL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social media content has grown exponentially in the recent years and the role
of social media has evolved from just narrating life events to actually shaping
them. In this paper we explore how many resources shared in social media are
still available on the live web or in public web archives. By analyzing six
differe... | [
{
"version": "v1",
"created": "Thu, 13 Sep 2012 20:08:07 GMT"
}
] | 2012-09-17T00:00:00 | [
[
"SalahEldeen",
"Hany M.",
""
],
[
"Nelson",
"Michael L.",
""
]
] | TITLE: Losing My Revolution: How Many Resources Shared on Social Media Have
Been Lost?
ABSTRACT: Social media content has grown exponentially in the recent years and the role
of social media has evolved from just narrating life events to actually shaping
them. In this paper we explore how many resources shared in... |
1209.3089 | Lei Wu Dr. | Mehdi Adda, Lei Wu, Sharon White, Yi Feng | Pattern Detection with Rare Item-set Mining | 17 pages, 5 figures, International Journal on Soft Computing,
Artificial Intelligence and Applications (IJSCAI), Vol.1, No.1, August 2012 | null | null | null | cs.SE cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The discovery of new and interesting patterns in large datasets, known as
data mining, draws more and more interest as the quantities of available data
are exploding. Data mining techniques may be applied to different domains and
fields such as computer science, health sector, insurances, homeland security,
banking a... | [
{
"version": "v1",
"created": "Fri, 14 Sep 2012 04:25:56 GMT"
}
] | 2012-09-17T00:00:00 | [
[
"Adda",
"Mehdi",
""
],
[
"Wu",
"Lei",
""
],
[
"White",
"Sharon",
""
],
[
"Feng",
"Yi",
""
]
] | TITLE: Pattern Detection with Rare Item-set Mining
ABSTRACT: The discovery of new and interesting patterns in large datasets, known as
data mining, draws more and more interest as the quantities of available data
are exploding. Data mining techniques may be applied to different domains and
fields such as computer s... |
1209.2868 | Georg Groh | Georg Groh and Florian Straub and Benjamin Koster | Spatio-Temporal Small Worlds for Decentralized Information Retrieval in
Social Networking | null | null | null | null | cs.SI cs.IR physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We discuss foundations and options for alternative, agent-based information
retrieval (IR) approaches in Social Networking, especially Decentralized and
Mobile Social Networking scenarios. In addition to usual semantic contexts,
these approaches make use of long-term social and spatio-temporal contexts in
order to sa... | [
{
"version": "v1",
"created": "Thu, 13 Sep 2012 12:11:10 GMT"
}
] | 2012-09-14T00:00:00 | [
[
"Groh",
"Georg",
""
],
[
"Straub",
"Florian",
""
],
[
"Koster",
"Benjamin",
""
]
] | TITLE: Spatio-Temporal Small Worlds for Decentralized Information Retrieval in
Social Networking
ABSTRACT: We discuss foundations and options for alternative, agent-based information
retrieval (IR) approaches in Social Networking, especially Decentralized and
Mobile Social Networking scenarios. In addition to usu... |
1209.2553 | Malathi Subramanian | S. Malathi and S. Sridhar | Optimization of fuzzy analogy in software cost estimation using
linguistic variables | 14 pages, 8 figures; Journal of Systems and Software, 2011. arXiv
admin note: text overlap with arXiv:1112.3877 by other authors | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most important objectives of software engineering community has
been the increase of useful models that beneficially explain the development of
life cycle and precisely calculate the effort of software cost estimation. In
analogy concept, there is deficiency in handling the datasets containing
categorical ... | [
{
"version": "v1",
"created": "Wed, 12 Sep 2012 10:35:01 GMT"
}
] | 2012-09-13T00:00:00 | [
[
"Malathi",
"S.",
""
],
[
"Sridhar",
"S.",
""
]
] | TITLE: Optimization of fuzzy analogy in software cost estimation using
linguistic variables
ABSTRACT: One of the most important objectives of software engineering community has
been the increase of useful models that beneficially explain the development of
life cycle and precisely calculate the effort of software... |
1209.1322 | Wahbeh Qardaji | Wahbeh Qardaji, Weining Yang, Ninghui Li | Differentially Private Grids for Geospatial Data | null | null | null | null | cs.CR cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we tackle the problem of constructing a differentially private
synopsis for two-dimensional datasets such as geospatial datasets. The current
state-of-the-art methods work by performing recursive binary partitioning of
the data domains, and constructing a hierarchy of partitions. We show that the
key c... | [
{
"version": "v1",
"created": "Thu, 6 Sep 2012 15:47:45 GMT"
}
] | 2012-09-07T00:00:00 | [
[
"Qardaji",
"Wahbeh",
""
],
[
"Yang",
"Weining",
""
],
[
"Li",
"Ninghui",
""
]
] | TITLE: Differentially Private Grids for Geospatial Data
ABSTRACT: In this paper, we tackle the problem of constructing a differentially private
synopsis for two-dimensional datasets such as geospatial datasets. The current
state-of-the-art methods work by performing recursive binary partitioning of
the data domains... |
1209.1323 | Sheng Yu | Sheng Yu and Subhash Kak | An Empirical Study of How Users Adopt Famous Entities | 7 pages, 10 figures | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Users of social networking services construct their personal social networks
by creating asymmetric and symmetric social links. Users usually follow friends
and selected famous entities that include celebrities and news agencies. In
this paper, we investigate how users follow famous entities. We statically and
dynami... | [
{
"version": "v1",
"created": "Thu, 6 Sep 2012 15:47:55 GMT"
}
] | 2012-09-07T00:00:00 | [
[
"Yu",
"Sheng",
""
],
[
"Kak",
"Subhash",
""
]
] | TITLE: An Empirical Study of How Users Adopt Famous Entities
ABSTRACT: Users of social networking services construct their personal social networks
by creating asymmetric and symmetric social links. Users usually follow friends
and selected famous entities that include celebrities and news agencies. In
this paper, ... |
1209.0913 | Jun Wang | Jun Wang and Alexandros Kalousis | Structuring Relevant Feature Sets with Multiple Model Learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Feature selection is one of the most prominent learning tasks, especially in
high-dimensional datasets in which the goal is to understand the mechanisms
that underly the learning dataset. However most of them typically deliver just
a flat set of relevant features and provide no further information on what kind
of str... | [
{
"version": "v1",
"created": "Wed, 5 Sep 2012 10:08:02 GMT"
}
] | 2012-09-06T00:00:00 | [
[
"Wang",
"Jun",
""
],
[
"Kalousis",
"Alexandros",
""
]
] | TITLE: Structuring Relevant Feature Sets with Multiple Model Learning
ABSTRACT: Feature selection is one of the most prominent learning tasks, especially in
high-dimensional datasets in which the goal is to understand the mechanisms
that underly the learning dataset. However most of them typically deliver just
a fl... |
1205.5407 | Deniz Yuret | Deniz Yuret | FASTSUBS: An Efficient and Exact Procedure for Finding the Most Likely
Lexical Substitutes Based on an N-gram Language Model | 4 pages, 1 figure, to appear in IEEE Signal Processing Letters | null | 10.1109/LSP.2012.2215587 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lexical substitutes have found use in areas such as paraphrasing, text
simplification, machine translation, word sense disambiguation, and part of
speech induction. However the computational complexity of accurately
identifying the most likely substitutes for a word has made large scale
experiments difficult. In this... | [
{
"version": "v1",
"created": "Thu, 24 May 2012 11:53:41 GMT"
},
{
"version": "v2",
"created": "Sat, 1 Sep 2012 07:54:47 GMT"
}
] | 2012-09-04T00:00:00 | [
[
"Yuret",
"Deniz",
""
]
] | TITLE: FASTSUBS: An Efficient and Exact Procedure for Finding the Most Likely
Lexical Substitutes Based on an N-gram Language Model
ABSTRACT: Lexical substitutes have found use in areas such as paraphrasing, text
simplification, machine translation, word sense disambiguation, and part of
speech induction. However... |
1208.5801 | Nivan Ferreira Jr | Nivan Ferreira, James T. Klosowski, Carlos Scheidegger, Claudio Silva | Vector Field k-Means: Clustering Trajectories by Fitting Multiple Vector
Fields | 30 pages, 15 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scientists study trajectory data to understand trends in movement patterns,
such as human mobility for traffic analysis and urban planning. There is a
pressing need for scalable and efficient techniques for analyzing this data and
discovering the underlying patterns. In this paper, we introduce a novel
technique whic... | [
{
"version": "v1",
"created": "Tue, 28 Aug 2012 21:51:36 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Aug 2012 18:17:40 GMT"
}
] | 2012-09-03T00:00:00 | [
[
"Ferreira",
"Nivan",
""
],
[
"Klosowski",
"James T.",
""
],
[
"Scheidegger",
"Carlos",
""
],
[
"Silva",
"Claudio",
""
]
] | TITLE: Vector Field k-Means: Clustering Trajectories by Fitting Multiple Vector
Fields
ABSTRACT: Scientists study trajectory data to understand trends in movement patterns,
such as human mobility for traffic analysis and urban planning. There is a
pressing need for scalable and efficient techniques for analyzing ... |
1201.4481 | Vadim Zotev | Vadim Zotev, Han Yuan, Raquel Phillips, Jerzy Bodurka | EEG-assisted retrospective motion correction for fMRI: E-REMCOR | 19 pages, 10 figures, to appear in NeuroImage | NeuroImage 63 (2012) 698-712 | 10.1016/j.neuroimage.2012.07.031 | null | physics.med-ph physics.ins-det | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a method for retrospective motion correction of fMRI data in
simultaneous EEG-fMRI that employs the EEG array as a sensitive motion
detector. EEG motion artifacts are used to generate motion regressors
describing rotational head movements with millisecond temporal resolution.
These regressors are utilized ... | [
{
"version": "v1",
"created": "Sat, 21 Jan 2012 15:19:12 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Jul 2012 19:05:35 GMT"
}
] | 2012-08-31T00:00:00 | [
[
"Zotev",
"Vadim",
""
],
[
"Yuan",
"Han",
""
],
[
"Phillips",
"Raquel",
""
],
[
"Bodurka",
"Jerzy",
""
]
] | TITLE: EEG-assisted retrospective motion correction for fMRI: E-REMCOR
ABSTRACT: We propose a method for retrospective motion correction of fMRI data in
simultaneous EEG-fMRI that employs the EEG array as a sensitive motion
detector. EEG motion artifacts are used to generate motion regressors
describing rotational ... |
1208.6137 | Deepak Kumar | Deepak Kumar, M N Anil Prasad and A G Ramakrishnan | Benchmarking recognition results on word image datasets | 16 pages, 4 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We have benchmarked the maximum obtainable recognition accuracy on various
word image datasets using manual segmentation and a currently available
commercial OCR. We have developed a Matlab program, with graphical user
interface, for semi-automated pixel level segmentation of word images. We
discuss the advantages of... | [
{
"version": "v1",
"created": "Thu, 30 Aug 2012 11:24:44 GMT"
}
] | 2012-08-31T00:00:00 | [
[
"Kumar",
"Deepak",
""
],
[
"Prasad",
"M N Anil",
""
],
[
"Ramakrishnan",
"A G",
""
]
] | TITLE: Benchmarking recognition results on word image datasets
ABSTRACT: We have benchmarked the maximum obtainable recognition accuracy on various
word image datasets using manual segmentation and a currently available
commercial OCR. We have developed a Matlab program, with graphical user
interface, for semi-auto... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.