检索结果-内蒙古大学图书馆

***: A gesture recognizer developed using data mining

AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING 2012年第3期26卷 351-366页

作者： Chang, Samuel Hsiao-Heng Blagojevic, Rachel Plimmer, Beryl Univ Auckland Dept Comp Sci Auckland 1142 New Zealand

Although many approaches to digital ink recognition have been proposed, most lack the flexibility and adaptability to provide acceptable recognition rates across a variety of problem spaces. This project uses a systematic approach of data mining analysis to build a gesture recognizer for sketched diagrams. A wide range of algorithms was tested, and those with the best performance were chosen for further tuning and analysis. Our resulting recognizer, RATA. Gesture, is an ensemble of four algorithms. We evaluated it against four popular gesture recognizers with three data sets;one of our own and two from other projects. Except for recognizer-data set pairs (e.g., PaleoSketch recognizer and PaleoSketch data set) the results show that it outperforms the other recognizers. This demonstrates the potential of this approach to produce flexible and accurate recognizers.

关键词： Pen-Based Interfaces recognition algorithms Sketch recognition Sketch Tools

来源：评论

学校读者我要写书评

暂无评论

Using data mining for digital ink recognition: Dividing text and shapes in sketched diagrams

引用

COMPUTERS & GRAPHICS-UK 2011年第5期35卷 976-991页

作者： Blagojevic, Rachel Plimmer, Beryl Grundy, John Wang, Yong Univ Auckland Auckland 1 New Zealand Swinburne Univ Technol Hawthorn Vic 3122 Australia

The low accuracy rates of text-shape dividers for digital ink diagrams are hindering their use in real world applications. While recognition of handwriting is well advanced and there have been many recognition approaches proposed for hand drawn sketches, there has been less attention on the division of text and drawing ink. Feature based recognition is a common approach for text-shape division. However, the choice of features and algorithms are critical to the success of the recognition. We propose the use of data mining techniques to build more accurate text-shape dividers. A comparative study is used to systematically identify the algorithms best suited for the specific problem. We have generated dividers using data mining with diagrams from three domains and a comprehensive ink feature library. The extensive evaluation on diagrams from six different domains has shown that our resulting dividers, using LADTree and LogitBoost, are significantly more accurate than three existing dividers. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Sketch tools recognition algorithms Sketch recognition Pen-based interfaces

来源：评论

学校读者我要写书评

暂无评论

LARGE-GIRTH ROOTS OF GRAPHS

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 2010年第4期24卷 1501-1514页

作者： Adamaszek, Anna Adamaszek, Micha L. Univ Warwick Warwick Math Inst Coventry CV4 7AL W Midlands England Univ Warwick Ctr Discrete Math & Its Applicat DIMAP Coventry CV4 7AL W Midlands England

We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus improving a recently conjectured bound. Our algorithm also finds all r-th roots of a given graph that have girth at least 2r + 3 and no degree one vertices, which is a step toward a recent conjecture of Levenshtein [Discrete Math., 308 (2008), pp. 993-998] that such roots should be unique. Similar algorithms have so far been designed only for r = 2, 3. On the negative side, we prove that recognition of graph powers becomes an NP-complete problem when the bound on girth is about twice smaller.

关键词： graph roots graph powers complexity recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Characterising (k, l)-leaf powers

引用

DISCRETE APPLIED MATHEMATICS 2010年第2期158卷 110-122页

作者： Brandstaedt, Andreas Wagner, Peter Univ Rostock Inst Informat D-18051 Rostock Germany

We say that, for k >= 2 and l > k, a tree T with distance function d(T) (x, y) is a (k, l)-leaf root of a finite simple graph G = (V, E) if V is the set of leaves of T, for all edges xy is an element of E, d(T) (x, y) <= k, and for all non-edges xy is not an element of E, d(T) (x, y) >= l. graph is a (k, l)-leaf power if it has a (k, l)-leaf root. This new notion modifies the concept of k-leaf powers (which are, in our terminology, the (k, k + 1)-leaf powers) introduced and studied by Nishimura, Ragde and Thilikos;k-leaf powers are motivated by the search for underlying phylogenetic trees. Recently, a lot of work has been done on k-leaf powers and roots as well as on their variants phylogenetic roots and Steiner roots. Many problems, however, remain open. We give the structural characterisations of (k, l)-leaf powers, for some k and e, which also imply an efficient recognition of these classes, and in this way we improve and extend a recent paper by Kennedy, Lin and Yan on strictly chordal graphs;one of our motivations for studying (k, l)-leaf powers is the fact that strictly chordal graphs are precisely the (4, 6)-leaf powers. (C) 2009 Elsevier B.V. All rights reserved.

关键词： (k, l)-leaf powers k-leaf powers Trees Block graphs Strictly chordal graphs Characterisations recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

On proportions of pre-involutions in finite classical groups

引用

JOURNAL OF ALGEBRA 2010年第5期324卷 1016-1043页

作者： Niemeyer, Alice C. Popiel, Tomasz Praeger, Cheryl E. Univ Western Australia Sch Math & Stat M019 Crawley WA 6009 Australia

Key to a computational study of the finite classical groups in odd characteristic are efficient methods for constructing involutions and their centralisers. Constructing an involution in a given conjugacy class is usually achieved by finding an element of even order that powers up to an involution in the class. Lower bounds on the proportions of such elements are therefore required to control the failure probability of these algorithms. Previous results of Christopher Parker and Robert Wilson give an O(n(-3)) lower bound that holds for all involution classes in n-dimensional simple classical groups in odd characteristic. We improve this lower bound to O(n(-2) log n), and in certain cases to O(n(-1)), and also treat a larger family of (not necessarily simple) classical groups. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Finite classical groups Involutions Proportions recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Building Digital Ink Recognizers Using Data Mining: Distinguishing between Text and Shapes in Hand Drawn Diagrams

Building Digital Ink Recognizers Using Data Mining: Distingu...

引用

23rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems

作者： Blagojevic, Rachel Plimmer, Beryl Grundy, John Wang, Yong Univ Auckland Private Bag 92019 Auckland 1 New Zealand Swinburne Univ Technol Hawthorn Vic 3122 Australia

ISBN: (纸本)9783642130212

The low accuracy rates of text-shape dividers or digital ink diagrams are hindering their use in real world applications While recognition of handwriting is well advanced and time have been many recognition approaches proposed for hand drawn sketches, there has been less attention on the division of text and drawing. The choice of features and algorithms is critical to the success of the recognition, yet heuristics currently form the basis of selection We purpose the use of data minim! techniques to automate the process of building text-shape recognizers This systematic approach identifies the algorithms best suited to the specific problem and generates the trained recognizer We have generated dividers using data mining and training with diagrams from three domains The evaluation of our new recognizer on realistic diagrams from two different domains, against two other recognizers shows it to be more successful at dividing shapes and text with 95 2% of strokes correctly classified compared with 86 9% and 83 3% for the two others

关键词： Sketch tools recognition algorithms sketch recognition pen-based interfaces

来源：评论

学校读者我要写书评

暂无评论

LARGE-GIRTH ROOTS OF GRAPHS

LARGE-GIRTH ROOTS OF GRAPHS

引用

27th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Adamaszek, Anna Adamaszek, Micha L. Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ Warwick Warwick Math Inst Coventry CV4 7AL W Midlands England

ISBN: (纸本)9783939897163

We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + 3, thus improving a bound conjectured by Farzad et al. (STACS 2009). Our algorithm also finds all r-th roots of a given graph that have girth at least 2r + 3 and no degree one vertices, which is a step towards a recent conjecture of Levenshtein that such root should be unique. On the negative side, we prove that recognition becomes an NP- complete problem when the bound on girth is about twice smaller. Similar results have so far only been attempted for r = 2, 3.

关键词： Graph roots Graph powers NP-completeness recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Building digital ink recognizers using data mining: distinguishing between text and shapes in hand drawn diagrams 10

Building digital ink recognizers using data mining: distingu...

引用

Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I

作者： Rachel Blagojevic Beryl Plimmer John Grundy Yong Wang University of Auckland Auckland New Zealand Swinburne University of Technology Hawthorn Victoria Australia

ISBN: (纸本)9783642130212

The low accuracy rates of text-shape dividers for digital ink diagrams are hindering their use in real world applications. While recognition of handwriting is well advanced and there have been many recognition approaches proposed for hand drawn sketches, there has been less attention on the division of text and drawing. The choice of features and algorithms is critical to the success of the recognition, yet heuristics currently form the basis of selection. We propose the use of data mining techniques to automate the process of building textshape recognizers. This systematic approach identifies the algorithms best suited to the specific problem and generates the trained recognizer. We have generated dividers using data mining and training with diagrams from three domains. The evaluation of our new recognizer on realistic diagrams from two different domains, against two other recognizers shows it to be more successful at dividing shapes and text with 95.2% of strokes correctly classified compared with 86.9% and 83.3% for the two others.

关键词： sketch tools recognition algorithms sketch recognition pen-based interfaces

来源：评论

学校读者我要写书评

暂无评论

On the complexity of recognizing directed path families

引用

DISCRETE APPLIED MATHEMATICS 2009年第11期157卷 2525-2535页

作者： Apollonio, N. Frandosa, P. G. Univ Roma La Sapienza Dipartimento Stat Probabil & Stat Applicate I-00185 Rome Italy

A Directed Path Family is a family of subsets of some finite ground set whose members call be realized as arc sets of simple directed paths in some directed graph. In this paper we show that recognizing whether a given family is a Directed Path family is an NP-Complete problem, even when all members in the family have at most two elements. If instead of a family of subsets, we are given a collection of words from some finite alphabet, then deciding whether there exists a directed graph G Such that each word ill the language is the set of arcs of some path in G, is a polynomial-time solvable problem. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Directed line graph Hypergraph 2-colorability recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Distance-Hereditary Comparability Graphs

引用

Electronic Notes in Discrete Mathematics 2009年第C期35卷 227-233页

作者： Di Stefano, Gabriele Dipartimento di Ingegneria Elettrica e dell'Informazione Università degli Studi dell'Aquila L'Aquila Italy

We study the class of the distance-hereditary comparability graphs, that is, those graphs which admit a transitive orientation and are completely decomposable with respect to the split decomposition. We provide a characterization in terms of forbidden subgraphs. We also provide further characterizations and one of them, based on the split decomposition, is used to devise a recognizing algorithm working in linear time. Finally, we show how to build distance-hereditary comparability graphs. © 2009 Elsevier B.V. All rights reserved.

关键词： Graph theory recognition algorithms split decomposition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：