Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9065)
- Missouri University of Science and Technology (1898)
- City University of New York (CUNY) (958)
- Brigham Young University (710)
- University of Texas at Arlington (661)
-
- Syracuse University (479)
- University of Central Florida (477)
- University of Nevada, Las Vegas (393)
- Chulalongkorn University (258)
- Regis University (254)
- Portland State University (243)
- TÜBİTAK (230)
- Old Dominion University (197)
- University of South Carolina (194)
- San Jose State University (192)
- Wright State University (186)
- Technological University Dublin (152)
- Washington University in St. Louis (148)
- University of South Florida (137)
- Purdue University (112)
- Edith Cowan University (111)
- University of Nebraska - Lincoln (109)
- Nova Southeastern University (101)
- Zayed University (97)
- California Polytechnic State University, San Luis Obispo (96)
- Dartmouth College (94)
- University of New Mexico (94)
- Air Force Institute of Technology (89)
- University at Albany, State University of New York (89)
- Kennesaw State University (76)
- Keyword
-
- Machine learning (603)
- Artificial intelligence (408)
- Deep learning (340)
- Machine Learning (267)
- College for Professional Studies (253)
-
- School of Computer & Information Science (236)
- Security (197)
- Artificial Intelligence (191)
- Natural language processing (184)
- Deep Learning (182)
- Computer Science (180)
- Privacy (149)
- Social media (140)
- Computer science (138)
- Algorithms (137)
- MS Computer and Information Technology (136)
- Data mining (135)
- Neural networks (129)
- Natural Language Processing (123)
- Reinforcement learning (123)
- Computer vision (122)
- Cybersecurity (118)
- Twitter (116)
- Software engineering (115)
- AI (114)
- Classification (109)
- Regis University MSCIT thesis (108)
- Cloud computing (106)
- Optimization (106)
- Clustering (96)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8532)
- Computer Science Faculty Research & Creative Works (907)
- Theses and Dissertations (837)
- Computer Science Technical Reports (411)
- Faculty Publications (383)
-
- Computer Science and Engineering Theses - Archive (364)
- Electronic Theses and Dissertations (331)
- Publications and Research (291)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Computer Science and Engineering Dissertations - Archive (270)
- Open Educational Resources (262)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (258)
- Regis University Student Publications (comprehensive collection) (254)
- Masters Theses (236)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (236)
- Turkish Journal of Electrical Engineering and Computer Sciences (230)
- Dissertations and Theses (204)
- Dissertations and Theses Collection (Open Access) (192)
- Electrical Engineering and Computer Science - Technical Reports (176)
- Master's Projects (167)
- Dissertations, Theses, and Capstone Projects (145)
- Electrical Engineering and Computer Science - All Scholarship (138)
- McKelvey School of Engineering Graduate Student Theses & Dissertations (137)
- USF Tampa Graduate Theses and Dissertations (122)
- Doctoral Dissertations (119)
- Electronic Theses and Dissertations, 2020-2023 (119)
- All Works (97)
- Computer Science Faculty Publications (95)
- Northeast Parallel Architecture Center (92)
- Dissertations (89)
- Publication Type
- File Type
Articles 17311 - 17340 of 20646
Full-Text Articles in Entire DC Network
Modeling Architectural Strategy Using Design Structure Networks, C. Jason Woodard
Modeling Architectural Strategy Using Design Structure Networks, C. Jason Woodard
Research Collection School Of Computing and Information Systems
System architects face the formidable task of purposefully shaping an evolving space of complex designs. Their task s further complicated when they lack full control of the design process, and therefore must anticipate the behavior of other stakeholders, including the designers of component products and competing systems. This paper presents a conceptual tool called a design structure network (DSN) to help architects and design scientists reason effectively about these situations. A DSN is a graphical representation of a system’s design space. DSNs improve on existing representation schemes by providing a compact and intuitive way to express design options—the ability to …
A Linear-Time Algorithm For Broadcast Domination In A Tree, John Dabney
A Linear-Time Algorithm For Broadcast Domination In A Tree, John Dabney
All Theses
The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power p at vertex v is capable of dominating all vertices within distance p from v. Our goal is to assign a broadcast power f(v) to every vertex v in a graph such that the sum for all v over V of f(v) is minimized, and such that every vertex u with f(u) = 0 is within distance f(v) of some vertex v with f(v) > 0. The problem is solvable in polynomial time on a general graph, and Blair et al. …
Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong
Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong
Research Collection School Of Computing and Information Systems
Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life social networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. We have access to complete data of Cyworld's ilchon (friend) relationships and analyze its degree distribution, clustering property, degree correlation, and evolution over time. We also use Cyworld data to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network …
Learning To Classify E-Mail, Irena Koprinska, Josiah Poon, James Clark, Jason Yuk Hin Chan
Learning To Classify E-Mail, Irena Koprinska, Josiah Poon, James Clark, Jason Yuk Hin Chan
Research Collection School Of Computing and Information Systems
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a supervised learning setting, we investigate the use of random forest for automatic e-mail filing into folders and spam e-mail filtering. We show that random forest is a good choice for these tasks as it runs fast on large and high dimensional databases, is easy to tune and is highly accurate, outperforming popular algorithms such as decision trees, support vector machines and naive Bayes. We introduce a new accurate feature selector with linear time complexity. …
Management Of An Intelligent Argumentation Network For A Web-Based Collaborative Engineering Design Environment, Xiaoqing Frank Liu, Man Zheng, Ganesh K. Venayagamoorthy, Ming-Chuan Leu
Management Of An Intelligent Argumentation Network For A Web-Based Collaborative Engineering Design Environment, Xiaoqing Frank Liu, Man Zheng, Ganesh K. Venayagamoorthy, Ming-Chuan Leu
Computer Science Faculty Research & Creative Works
Conflict resolution is one of the most challenging tasks in collaborative engineering design. In our previous research, a web-based intelligent collaborative system was developed to address this challenge based on intelligent computational argumentation. However, two important issues were not resolved in that system: priority of participants and self-conflicting arguments. In this paper, we develop two methods for incorporating priorities of participants into the computational argumentation network: 1) weighted summation and 2) re-assessment of strengths of arguments based on priority of owners of the argument using fuzzy logic inference. In addition, we develop a method for detection of self-conflicting arguments. Incorporation …
Conquer: A Peer Group-Based Incentive Model For Constraint Querying In Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Conquer: A Peer Group-Based Incentive Model For Constraint Querying In Mobile-P2p Networks, Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsuregawa
Computer Science Faculty Research & Creative Works
In mobile ad-hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries with varying constraints on query response time, data quality of results and trustworthiness of the data source. This work proposes ConQuer, which addresses constraint queries in economybased M-P2P networks. ConQuer proposes a broker-based incentive M-P2P model for handling user-defined constraint queries. It also provides incentives for MPs to form collaborative peer groups for maximizing data availability and revenues by mutually allocating and deallocating data items using a royalty-based revenue-sharing method. Such reallocations facilitate MPs in providing …
Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska
Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska
Research Collection School Of Computing and Information Systems
Traditional supervised classification algorithms require a large number of labelled examples to perform accurately. Semi-supervised classification algorithms attempt to overcome this major limitation by also using unlabelled examples. Unlabelled examples have also been used to improve nearest neighbour text classification in a method called bridging. In this paper, we propose the use of bridging in a semi-supervised setting. We introduce a new bridging algorithm that can be used as a base classifier in any supervised approach such as co-training or selflearning. We empirically show that classification performance increases by improving the semi-supervised algorithm’s ability to correctly assign labels to previouslyunlabelled …
Cognitive Evaluation Of Information Modeling Methods, Keng Siau, Yuan Wang
Cognitive Evaluation Of Information Modeling Methods, Keng Siau, Yuan Wang
Research Collection School Of Computing and Information Systems
In the field of information system engineering, information modeling method is a technique to capture user requirements and to understand system complexity. The importance of information modeling has been recognized by practitioners and researchers, but little has been explored to analyze the available information modeling methods or to evaluate them in terms of their strengths, weaknesses, and effectiveness. This research analyzes six information-modeling methods: use case diagram, rich picture diagram, entity-relationship diagram, Trochim’s concept mapping, repertory grid, and causal mapping. These information-modeling methods are analyzed from a cognitive perspective in order to better understand their nature, the assumptions, and the …
Gprune: A Constraint Pushing Framework For Graph Pattern Mining, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
Gprune: A Constraint Pushing Framework For Graph Pattern Mining, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
Research Collection School Of Computing and Information Systems
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset constraints, structural constraints, such as density and diameter of a graph, are very hard to be pushed deep into the mining process. In this paper, we give the first comprehensive study on the pruning properties of both traditional and structural constraints aiming to reduce not only the pattern search space but the data search space as well. A new general framework, called gPrune, is proposed to incorporate all the constraints in such a way that they …
Deckard: Scalable And Accurate Tree-Based Detection Of Code Clones, Lingxiao Jiang, Ghassan Misherghi, Zhendong Su, Stephane Glondu
Deckard: Scalable And Accurate Tree-Based Detection Of Code Clones, Lingxiao Jiang, Ghassan Misherghi, Zhendong Su, Stephane Glondu
Research Collection School Of Computing and Information Systems
Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. In this paper, we present an efficient algorithm for identifying similar subtrees and apply it to tree representations of source code. Our algorithm is based on a novel characterization of subtrees with numerical vectors in the Euclidean Rn and an efficient algorithm to cluster these vectors w.r.t. the Euclidean distance metric. Subtrees with vectors in one cluster are considered similar. We have implemented our tree similarity algorithm as a clone detection tool called DECKARD …
Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang
Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang
Research Collection School Of Computing and Information Systems
Considerable research and experiment results in recent years have shown that the server-proxy-user architecture represents an efficient and scalable new paradigm for multimedia content delivery. However, not much effort has been spent on the security issues in such systems. In this paper, we study data authentication in multimedia content delivery, and in particular, we focus on achieving end-to-end authentication from the multimedia server to end users in the server-proxy-user architecture where intermediary proxies transcode multimedia content dynamically. We present a formal model for the end-to-end authentication problem, and propose a basic construction for generic data modality and prove its security. …
Forgery Attack To An Asymptotically Optimal Traitor Tracing Scheme, Yongdong Wu, Feng Bao, Robert H. Deng
Forgery Attack To An Asymptotically Optimal Traitor Tracing Scheme, Yongdong Wu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
In this paper, we present a forgery attack to a black-box traitor tracing scheme [2] called as CPP scheme. CPP scheme has efficient transmission rate and allows the tracer to identify a traitor with just one invalid ciphertext. Since the original CPP scheme is vulnerable to the multi-key attack, we improved CPP to thwart the attack. However, CPP is vulnerable to a fatal forgery attack. In the forgery attack, two traitors can collude to forge all valid decryption keys. The forged keys appear as perfect genuine keys, can decrypt all protected content, but are untraceable by the tracer. Fortunately, we …
Object-Relational Mapping As A Persistence Mechanism For Object-Oriented Applications, Jeffrey M. Barnes
Object-Relational Mapping As A Persistence Mechanism For Object-Oriented Applications, Jeffrey M. Barnes
Mathematics, Statistics, and Computer Science Honors Projects
Many object-oriented applications created today, especially Web applications, use relational databases for persistence. Often there is a straightforward correspondence between database tables on the one hand and application classes on the other. Application developers usually write a great deal of code to connect to and query the database, code which differs little from class to class and is often tedious to write. Moreover, the parallel class and table structures constitute a duplication of information, which requires duplication of work and increases the likelihood of errors. Ideally, we could automate this duplication, rendering it invisible to developers. This is the idea …
Manifold Sculpting, Michael S. Gashler
Manifold Sculpting, Michael S. Gashler
Theses and Dissertations
Manifold learning algorithms have been shown to be useful for many applications of numerical analysis. Unfortunately, existing algorithms often produce noisy results, do not scale well, and are unable to benefit from prior knowledge about the expected results. We propose a new algorithm that iteratively discovers manifolds by preserving the local structure among neighboring data points while scaling down the values in unwanted dimensions. This algorithm produces less noisy results than existing algorithms, and it scales better when the number of data points is much larger than the number of dimensions. Additionally, this algorithm is able to benefit from existing …
Passwords For Everyone: Secure Mnemonic-Based Accessible Authentication, Umut Topkara, Mercan Topkara, Mikhail J. Atallah
Passwords For Everyone: Secure Mnemonic-Based Accessible Authentication, Umut Topkara, Mercan Topkara, Mikhail J. Atallah
Department of Computer Science Technical Reports
No abstract provided.
Hop-By-Hop Transport Control For Multi-Hop Wireless Networks, Daniel N. Scofield
Hop-By-Hop Transport Control For Multi-Hop Wireless Networks, Daniel N. Scofield
Theses and Dissertations
TCP can perform poorly in multi-hop wireless networks due to problems with contention and poor feedback from end-to-end control algorithms. This thesis explores the design of a hop-by-hop transport protocol (HxH). By allowing intermediate nodes to actively participate, the protocol can respond more quickly to changing network conditions and exploit the unique characteristics of wireless networks. Results indicate that hop-by-hop transport can achieve throughput rates that are double those of TCP, depending on the speed of the wireless links.
T-Spline Simplification, David L. Cardon
T-Spline Simplification, David L. Cardon
Theses and Dissertations
This work focuses on generating approximations of complex T-spline surfaces with similar but less complex T-splines. Two approaches to simplifying T-splines are proposed: a bottom-up approach that iteratively refines an over-simple T-spline to approximate a complex one, and a top-down approach that evaluates existing control points for removal in producing an approximations. This thesis develops and compares the two simplification methods, determining the simplification tasks to which each is best suited. In addition, this thesis documents supporting developments made to T-spline research as simplification was developed.
Design And Implementation Of An Online Bath And Body Products Business, Norma Prince
Design And Implementation Of An Online Bath And Body Products Business, Norma Prince
Regis University Student Publications (comprehensive collection)
This project created an online extension of a bath and body products business. Currently, the author's son owns a business that provides soap and lip balm to brick-andmortar businesses. The products have been well accepted in the marketplace and an online venture was the next logical step to increase market share. For this project, a website was created that serves as an online storefront and product catalog. A traditional phased project management approach was used to complete the project. The analysis phase consisted of research into competitive companies as well as how to successfully design and implement an interactive website. …
Development Of A Web Based Application For Tracking Human Resource Utilization For A Consulting Firm, Martin Kyne
Development Of A Web Based Application For Tracking Human Resource Utilization For A Consulting Firm, Martin Kyne
Regis University Student Publications (comprehensive collection)
Velocity Systems LLC is a privately owned company located in Franktown, Colorado that specializes in the implementation of PeopleSoft ERP, CRM and data warehouse solutions. Velocity Systems' and its partners have been involved in this community for over a decade and have created a large network of relationships with both clients and other consultants who provide services similar to Velocity Systems. The implementation of a PeopleSoft packaged application requires a high degree of coordination of a lot of different skills. The resources provided by Velocity have worked in the industry as consultants for at least seven years and in that …
Control Of The Electronic Management Of Information, A. Boone, R. Szatmary Jr.
Control Of The Electronic Management Of Information, A. Boone, R. Szatmary Jr.
Publications (YM)
This procedure establishes the responsibilities and provides direction for developing and evaluating the adequacy of process controls on specific uses of electronically stored information. These uses include, but are not limited to, information used in design input, developed as design output, or developed as input to or output from scientific investigation or performance assessment modeling and analysis. This pertains to information that resides in an electronic information management system or on electronic media.
Model-Driven Software Development, Susan Minton
Model-Driven Software Development, Susan Minton
Regis University Student Publications (comprehensive collection)
Model-Driven Software Development (MDSD) is an emerging technology approach that has potential to revolutionize the software industry. MDSD has the ability to both increase software delivery velocity, while at the same time reduce complexity and reuse software assets. Experts in the field believe that the MDSD approach helps to abstract away the growing interdependencies of enterprise software development by use of sophisticated tools, models, and automatic code generation. Through the use of Unified Modeling Language (UML/UML2) and other related technologies, the models are intricate enough to fully represent a system domain and then generate system code to represent that system. …
Computing Best Coverage Path In The Presence Of Obstacles In Wireless Sensor Networks, Senjuti Basu Roy
Computing Best Coverage Path In The Presence Of Obstacles In Wireless Sensor Networks, Senjuti Basu Roy
Computer Science and Engineering Theses - Archive
Given a set S = {S1,...,Sn} of n homogeneous wireless sensors deployed in a two dimensional area, a source point s and a destination point t, the least protected point p along a path (s,t) is that point such that the Euclidean distance between p and its closest sensor node Si is maximum. This distance between p and S_{i} is called the Cover value of the path P(s,t). The Best Coverage Path between s and t, denoted as BCP(s,t), is the path that has the minimum cover value. Although there exists efficient algorithms to compute BCP in O(n log n) …
A Random Walk Approach To Sampling Hidden Databases, Arjun Dasgupta
A Random Walk Approach To Sampling Hidden Databases, Arjun Dasgupta
Computer Science and Engineering Theses - Archive
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden back-end database to provide answers to user queries. Generating a uniform random sample of this hidden database by using only the publicly available interface gives us access to the underlying data distribution. In this thesis, we propose a random walk scheme over the query space provided by the interface to sample such databases. We discuss variants where the query space is visualized as a fixed and random ordering of attributes. We also propose techniques to further improve the …
Mining Colossal Frequent Patterns By Core Pattern Fusion, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, Hong Cheng
Mining Colossal Frequent Patterns By Core Pattern Fusion, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, Hong Cheng
Research Collection School Of Computing and Information Systems
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the existing frequent-pattern mining algorithms encounter challenges at mining rather large patterns, called colossal frequent patterns, in the presence of an explosive number of frequent patterns. Colossal patterns are critical to many applications, especially in domains like bioinformatics. In this study, we investigate a novel mining approach called Pattern-Fusion to efficiently find a good approximation to the colossal patterns. With Pattern-Fusion, a colossal pattern is discovered by fusing its small core patterns in one step, …
Social Network Structures In Open Source Software Development Teams, Y. Long, Keng Siau
Social Network Structures In Open Source Software Development Teams, Y. Long, Keng Siau
Research Collection School Of Computing and Information Systems
Drawing on social network theories and previous studies, this research examines the dynamics of social network structures in open source software (OSS) teams. Three projects were selected from SourceForge.net in terms of their similarities as well as their differences. Monthly data were extracted from the bug tracking systems in order to achieve a longitudinal view of the interaction pattern of each project. Social network analysis was used to generate the indices of social structure. The finding suggests that the interaction pattern of OSS projects evolves from a single hub at the beginning to a corel periphery model as the projects …
Mining Minimal Distinguishing Subsequence Patterns With Gap Constraints, Xiaonan Ji, James Bailey, Guozhu Dong
Mining Minimal Distinguishing Subsequence Patterns With Gap Constraints, Xiaonan Ji, James Bailey, Guozhu Dong
Kno.e.sis Publications
Discovering contrasts between collections of data is an important task in data mining. In this paper, we introduce a new type of contrast pattern, called a Minimal Distinguishing Subsequence (MDS). An MDS is a minimal subsequence that occurs frequently in one class of sequences and infrequently in sequences of another class. It is a natural way of representing strong and succinct contrast information between two sequential datasets and can be useful in applications such as protein comparison, document comparison and building sequential classification models. Mining MDS patterns is a challenging task and is significantly different from mining contrasts between relational/transactional …
Cs 415: Social Implications Of Computing, Leo Finkelstein
Cs 415: Social Implications Of Computing, Leo Finkelstein
Computer Science & Engineering Syllabi
CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.
An Automatically Tuning Intrusion Detection System, Zhenwei Yu, Jeffrey J.-P. Tsai, Thomas Weigert
An Automatically Tuning Intrusion Detection System, Zhenwei Yu, Jeffrey J.-P. Tsai, Thomas Weigert
Computer Science Faculty Research & Creative Works
An intrusion detection system (IDS) is a security layer used to detect ongoing intrusive activities in information systems. Traditionally, intrusion detection relies on extensive knowledge of security experts, in particular, on their familiarity with the computer system to be protected. To reduce this dependence, various data-mining and machine learning techniques have been deployed for intrusion detection. An IDS is usually working in a dynamically changing environment, which forces continuous tuning of the intrusion detection model, in order to maintain sufficient performance. The manual tuning process required by current systems depends on the system operators in working out the tuning solution …
A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu
A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu
Research Collection School Of Computing and Information Systems
One critical task in content-based video retrieval is to rank search results with combinations of multimodal resources effectively. This paper proposes a novel multimodal and multilevel ranking framework for content-based video retrieval. The main idea of our approach is to represent videos by graphs and learn harmonic ranking functions through fusing multimodal resources over these graphs smoothly. We further tackle the efficiency issue by a multilevel learning scheme, which makes the semi-supervised ranking method practical for large-scale applications. Our empirical evaluations on TRECVID 2005 dataset show that the proposed multimodal and multilevel ranking framework is effective and promising for content-based …
A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu
A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu
Research Collection School Of Computing and Information Systems
One critical task in content-based video retrieval is to rank search results with combinations of multimodal resources effectively. This paper proposes a novel multimodal and multilevel ranking framework for content-based video retrieval. The main idea of our approach is to represent videos by graphs and learn harmonic ranking functions through fusing multimodal resources over these graphs smoothly. We further tackle the efficiency issue by a multilevel learning scheme, which makes the semi-supervised ranking method practical for large-scale applications. Our empirical evaluations on TRECVID 2005 dataset show that the proposed multimodal and multilevel ranking framework is effective and promising for content-based …